Results 161 to 170 of about 2,168 (195)
Some of the next articles are maybe not open access.
Fast Modular Multipliers for Supersingular Isogeny-Based Post-Quantum Cryptography
IEEE Transactions on Very Large Scale Integration (VLSI) Systems, 2021As 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, Jun Lin, Zhongfeng Wang
openaire +3 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
openalex +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
openalex +2 more sources
Ultra-Fast Modular Multiplication Implementation for Isogeny-Based Post-Quantum Cryptography
2019 IEEE International Workshop on Signal Processing Systems (SiPS), 2019 Supersingular 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
openalex +2 more sources
On Fast Calculation of Addition Chains for Isogeny-Based Cryptography
, 2017 Addition 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
openalex +2 more sources
A post-quantum signcryption scheme using isogeny based cryptography
Journal of Information Security and Applications, 2022Kunal Dey +3 more
openaire +3 more sources
Throughput-Optimized Implementation of Isogeny-based Cryptography on Vectorized ARM SVE Processor
2022 Tenth International Symposium on Computing and Networking (CANDAR), 2022 Pengchang Ren +2 more
openalex +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
openaire +3 more sources
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
Advancements in Isogeny-Based Cryptography: A Mathematical Approach to Post-Quantum Security
2025 IEEE International Students' Conference on Electrical, Electronics and Computer Science (SCEECS)Abhay Soni +2 more
openaire +3 more sources