Results 131 to 140 of about 23,538,535 (168)
The module action for isogeny based cryptography.
IACR Cryptol. ePrint Arch.openaire +2 more sources
Unconditional Foundations for Supersingular Isogeny-Based Cryptography [PDF]
Lecture Notes in Computer ScienceIn this paper, we prove that the supersingular isogeny problem (Isogeny), endomorphism ring problem (EndRing) and maximal order problem (MaxOrder) are equivalent under probabilistic polynomial time reductions, unconditionally. Isogeny-based cryptography is founded on the presumed hardness of these problems, and their interconnection is at the heart of ...
Benjamin Wesolowski
exaly +8 more sources
Improvement of the Square-Root Vélu's Formulas for Isogeny-Based Cryptography
JSIAM Letters, 2023 Summary: Isogeny-based cryptography is a promising candidate for post-quantum cryptography. Speeding up the isogeny computation of large prime degrees up to several thousands is a main research topic in isogeny-based cryptography. The currently most efficient method for computing isogenies is the square-root Vélu's formulas.
Hiroshi Onuki, Tsuyoshi Takagi
exaly +4 more sources
Supersingular Isogeny-Based Cryptography: A Survey
Interdisciplinary Information Sciences, 2021 Summary: With the advent of quantum computers that showed the viability of Shor's Algorithm to factor integers, it became apparent that asymmetric cryptographic algorithms might soon become insecure. Since then, a large number of new algorithms that are conjectured to be quantum-secure have been proposed, many of which come with non-negligible trade ...
STRATIL, Philipp +2 more
exaly +4 more sources
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Optimizing the Evaluation of ℓ-Isogenous Curve for Isogeny-Based Cryptography
Information Processing Letters, 2022In the paper under review, the authors propose a method that can serve as a useful technique for faster implementation of isogeny-based cryptography. Actually, some explicit formulas for evaluating an \(l\)-isogenous curve from three differential points on different curve models are presented: 1.
Fangguo Zhang, Zhi Hu
exaly +4 more sources
A High-Performance and Scalable Hardware Architecture for Isogeny-Based Cryptography
IEEE Transactions on Computers, 2018 In this work, we present a high-performance and scalable architecture for isogeny-based cryptosystems. In particular, we use the architecture in a fast, constant-time FPGA implementation of the quantum-resistant supersingular isogeny Diffie-Hellman (SIDH) key exchange protocol.
Brian Koziel +2 more
exaly +2 more sources
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
Jianhua Chen +2 more
exaly +2 more sources
Isogeny-based cryptography in Julia/Nemo
ACM Communications in Computer Algebra, 2019The Couveignes-Rostovtsev-Stolbunov key-exchange protocol based on isogenies of elliptic curves is of interest because it may resist quantum attacks, but its efficient implementation remains a challenge. We briefly present the computations involved, and efficient algorithms to achieve the critical steps, with timing results for our implementations in ...
Jean Kieffer, Luca De Feo
openaire +2 more sources
A Study on Isogeny Based Cryptography
2024 International Conference on Electronics, Computing, Communication and Control Technology (ICECCC)Angayarkanni S A
exaly +2 more sources
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