Results 111 to 120 of about 159 (153)
Some of the next articles are maybe not open access.
A Novel Modular Multiplier for Isogeny-Based Post-Quantum Cryptography
2020 IEEE Computer Society Annual Symposium on VLSI (ISVLSI), 2020Supersingular isogeny key encapsulation (SIKE) protocol is a promising candidate for the standard of post quantum cryptography (PQC), but it suffers from high computational complexity. Since the modular multiplication takes up a large proportion of the computations in SIKE protocol, accelerating this operation can efficiently speed up the entire ...
Bo Wu +3 more
openaire +1 more source
Isogeny-Based Cryptography: A Promising Post-Quantum Technique
IT Professional, 2019Recent advances in quantum computing have made existing public key cryptosystems vulnerable to enormous security threats. Therefore, numerous efforts have been exploring post-quantum cryptographic techniques to address the emergence of quantum computing. We focus on one promising post-quantum cryptography known as “isogeny-based cryptography,” first by
Cong Peng +3 more
openaire +1 more source
Lattice based and isogeny based post-quantum cryptography
2023Modern cryptography involving public-keys relies on mathematically difficult problems, such as factoring large numbers into prime factors and finding rational points on elliptic curves. A typical public-key scheme involves two communicators who each have a public and a private key.
openaire +1 more source
Finite Field Arithmetic Using AVX-512 For Isogeny-Based Cryptography
Anais do XVIII Simpósio Brasileiro de Segurança da Informação e de Sistemas Computacionais (SBSeg 2018), 2018Isogeny-based cryptography introduces new candidates to quantum-resistant cryptographic protocols. The cost of finite field arithmetic dominates the cost of isogeny-based cryptosystems. In this work, we apply AVX-512 vector instructions to accelerate the finite field modular multiplication.
Gabriell Orisaka +2 more
openaire +1 more source
Optimized Arithmetic Operations for Isogeny-Based Cryptography on Huff Curves
2020Up to now, the state-of-the-art implementations of Supersingular Isogeny Diffie-Hellman (SIDH) work with Montgomery curves or Edwards curves, due to the facts that such curve models provide high efficiency for elliptic curve arithmetic operations. In this work, we propose a new w-coordinate method to optimize the arithmetic operations on Huff curves ...
Yan Huang +3 more
openaire +1 more source
Ultra-Fast Modular Multiplication Implementation for Isogeny-Based Post-Quantum Cryptography
2019 IEEE International Workshop on Signal Processing Systems (SiPS), 2019Supersingular isogeny key encapsulation (SIKE) protocol delivers promising public and secret key sizes over other post-quantum candidates. However, the huge computations form the bottleneck and limit its practical applications. The modular multiplication operation, which is one of the most computationally demanding operations in the fundamental ...
Jing Tian, Jun Lin, Zhongfeng Wang
openaire +1 more source
Advanced threshold signature schemes leveraging isogeny-based cryptography
Global Journal of Engineering and Technology AdvancesThis paper investigates the use of threshold signature schemes in isogeny-based cryptosystems. By leveraging the distinct features of isogeny graphs, we propose a protocol that offers high security and practical efficiency, making it ideal for distributed ledger technologies and secure multi-party computations.
null Mohammed El Baraka +1 more
openaire +1 more source
Constructing Canonical Strategies for Parallel Implementation of Isogeny Based Cryptography
2018Isogeny based cryptographic systems are one of the very competitive systems that are potentially secure against quantum attacks. The run time of isogeny based systems are dominated by a sequence of point multiplications and isogeny computations performed over supersingular elliptic curves in a specific order. The order of the sequence play an important
Aaron Hutchinson, Koray Karabina
openaire +1 more source
On Fast Calculation of Addition Chains for Isogeny-Based Cryptography
2017Addition chain calculations play a critical role in determining the efficiency of cryptosystems based on isogenies on elliptic curves. However, finding a minimal length addition chain is not easy; a generalized version of the problem, in which one must find a chain that simultaneously forms each of a sequence of values, is NP-complete.
Brian Koziel +3 more
openaire +1 more source
2023
either well studied isogeny problems that are believed to be hard or based on novel well ...
openaire +1 more source
either well studied isogeny problems that are believed to be hard or based on novel well ...
openaire +1 more source