Results 151 to 160 of about 18,463 (180)
Some of the next articles are maybe not open access.

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
exaly   +2 more sources

Supersingular isogeny graphs in cryptography [PDF]

open access: yes, 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
Allan Lo   +2 more
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   +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   +1 more source

Hybrid Cryptography for Securing IoT: Elliptic Curve and Isogeny-Based

Lecture Notes in Electrical Engineering
Kalyan Banerjee   +3 more
exaly   +2 more sources

Optimized Arithmetic Operations for Isogeny-Based Cryptography on Huff Curves

2020
Up to now, the state-of-the-art implementations of Supersingular Isogeny Diffie-Hellman (SIDH) work with Montgomery curves or Edwards curves, due to the facts that such curve models provide high efficiency for elliptic curve arithmetic operations. In this work, we propose a new w-coordinate method to optimize the arithmetic operations on Huff curves ...
Yan Huang   +3 more
openaire   +1 more source

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
openaire   +2 more sources

The module action for isogeny based cryptography. [PDF]

open access: yesIACR Cryptol. ePrint Arch.
We extend the usual ideal action on oriented elliptic curves to a (Hermitian) module action on oriented (polarised) abelian varieties. Oriented abelian varieties are naturally enriched in $R$-modules, and our module action comes from the canonical power ...
Damien Robert
openaire   +3 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 0004   +2 more
openaire   +2 more sources

Home - About - Disclaimer - Privacy