Results 131 to 140 of about 22,173,063 (167)
Some of the next articles are maybe not open access.

Isogeny-Based Cryptography: A Promising Post-Quantum Technique

IT Professional, 2019
Recent 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

Lattice based and isogeny based post-quantum cryptography [PDF]

open access: yes, 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   +2 more sources

Constructing Canonical Strategies for Parallel Implementation of Isogeny Based Cryptography

Lecture Notes in Computer Science, 2018
Isogeny 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

Isogeny-Based Post-Quantum Cryptography

open access: yes, 2019
The present thesis focus on one of the post-quantum cryptosystems, in particular, the isogenybased cryptography. Because of its certain properties like the hard problem of computing isogenies between two elliptic curves, it makes it to be one of the few candidates for post-quantum cryptography.
Khandpur Singh, Ashneet
core   +3 more sources

Exploring RNS for Isogeny-based Cryptography. [PDF]

open access: yesIACR 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
core   +3 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), 2022
Vorapong Suppakitpaisarn
exaly   +2 more sources

Isogeny-based cryptography in Julia/Nemo

ACM Communications in Computer Algebra, 2019
The 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 Novel Modular Multiplier for Isogeny-Based Post-Quantum Cryptography

2020 IEEE Computer Society Annual Symposium on VLSI (ISVLSI), 2020
Supersingular 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

Fast Modular Multipliers for Supersingular Isogeny-Based Post-Quantum Cryptography

IEEE Transactions on Very Large Scale Integration (VLSI) Systems, 2021
As one of the postquantum protocol candidates, the supersingular isogeny key encapsulation (SIKE) protocol delivers promising public and secret key sizes over other candidates. Nevertheless, the considerable computations form the bottleneck and limit its practical applications.
Jing Tian 0004   +2 more
openaire   +2 more sources

Home - About - Disclaimer - Privacy