Results 101 to 110 of about 159 (153)
Raw QPP-RNG randomness via system jitter across platforms: a NIST SP 800-90B evaluation. [PDF]
Vrana G, Lou D, Kuang R.
europepmc +1 more source
A failure in decryption process for bivariate polynomial reconstruction problem cryptosystem. [PDF]
Yusof SN +6 more
europepmc +1 more source
Cryptography Standards in Quantum Time: New wine in old wineskin? [PDF]
Chen L.
europepmc +1 more source
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.
Huang, Yan +3 more
openaire +2 more sources
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 +1 more source
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 +1 more source

