Results 141 to 150 of about 18,462 (179)
Some of the next articles are maybe not open access.
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.
Zhi Hu, Fangguo Zhang
exaly +3 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
Cong Peng +2 more
exaly +2 more sources
Lattice based and isogeny based post-quantum cryptography
, 2023 Modern 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.
David, Rachelle H.
openaire +3 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, Zhongfeng Wang
exaly +2 more sources
Constructing Canonical Strategies for Parallel Implementation of Isogeny Based Cryptography
Lecture Notes in Computer Science, 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
Koray Karabina
exaly +2 more sources
Exploring RNS for Isogeny-based Cryptography. [PDF]
IACR Cryptol. ePrint Arch., 2022 Isogeny-based cryptography suffers from a long-running time due to its requirement of a great amount of large integer arithmetic. The Residue Number System (RNS) can compensate for that drawback by making computation more efficient via parallelism ...
David Jacquemin +2 more
openaire +2 more sources
A Study on Isogeny Based Cryptography
2024 International Conference on Electronics, Computing, Communication and Control Technology (ICECCC)Lakkavaram S M Shriya Varnita +4 more
exaly +2 more sources
Throughput-Optimized Implementation of Isogeny-based Cryptography on Vectorized ARM SVE Processor
2022 Tenth International Symposium on Computing and Networking (CANDAR), 2022Vorapong Suppakitpaisarn
exaly +2 more sources
Supersingular isogeny graphs in cryptography
, 2019 We describe recent applications of expander graphs in cryptography, particularly supersingular isogeny graphs. The security of these cryptographic constructions relies on the assumption that computing paths in these graphs is practically infeasible, even
Kristin E Lauter +2 more
exaly +2 more sources