Results 11 to 20 of about 18,462 (179)
Pairing Optimizations for Isogeny-Based Cryptosystems [PDF]
IET Information SecurityIn isogeny-based cryptography, bilinear pairings are regarded as a powerful tool in various applications, including key compression, public key validation, and torsion basis generation. However, in most isogeny-based protocols, the performance of pairing
Shiping Cai, Kaizhan Lin, Chang-An Zhao
doaj +4 more sources
Torsion point attacks on ‘SIDH‐like’ cryptosystems
IET Information Security, 2023 Isogeny‐based cryptography is a promising approach for post‐quantum cryptography. The best‐known protocol following that approach is the supersingular isogeny Diffie–Hellman protocol (SIDH); this protocol was turned into the CCA‐secure key encapsulation ...
Péter Kutas, Christophe Petit
doaj +2 more sources
Effective Pairings in Isogeny-Based Cryptography [PDF]
, 2023 LATINCRYPT ...
Krijn Reijnders
openaire +4 more sources
Efficient Finite Field Multiplication for Isogeny Based Post Quantum Cryptography [PDF]
, 2016 Isogeny based post-quantum cryptography is one of the most recent addition to the family of quantum resistant cryptosystems. In this paper we propose an efficient modular multiplication algorithm for primes of the form \(p=2\cdot {2^a}3^b-1\) with b even, typically used in such cryptosystem.
Karmakar, Angshuman +3 more
openaire +3 more sources
Finding Practical Parameters for Isogeny-based Cryptography [PDF]
IACR Communications in CryptologyIsogeny-based schemes often come with special requirements on the field of definition of the involved elliptic curves. For instance, the efficiency of SQIsign, a promising candidate in the NIST signature standardisation process, requires a large power of two and a large smooth integer
Maria Corte-Real Santos +3 more
core +5 more sources
Isogeny-Based Post-Quantum Cryptography
, 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
An Algorithmic Approach to (2, 2)-Isogenies in the Theta Model and Applications to Isogeny-Based Cryptography [PDF]
In this paper, we describe an algorithm to compute chains of (2, 2)-isogenies between products of elliptic curves in the theta model. The description of the algorithm is split into various subroutines to allow for a precise field operation counting. We present a constant time implementation of our algorithm in Rust and an alternative implementation in ...
Pierrick Dartois +3 more
core +6 more sources
Supersingular Isogeny-based Cryptography: A Survey
Interdisciplinary Information Sciences, 2021 Summary: With the advent of quantum computers that showed the viability of Shor's Algorithm to factor integers, it became apparent that asymmetric cryptographic algorithms might soon become insecure. Since then, a large number of new algorithms that are conjectured to be quantum-secure have been proposed, many of which come with non-negligible trade ...
STRATIL, Philipp +2 more
openaire +3 more sources
Arithmetic Considerations for Isogeny-Based Cryptography [PDF]
IEEE Transactions on Computers, 2019 In this paper we investigate various arithmetic techniques which can be used to potentially enhance the performance in the supersingular isogeny Diffie-Hellman (SIDH) key-exchange protocol which is one of the more recent contenders in the post-quantum public-key arena.
Joppe W. Bos, Simon Friedberger
openaire +2 more sources
Post-quantum cryptography Algorithm's standardization and performance analysis
Array, 2022 -Quantum computer is no longer a hypothetical idea. It is the world's most important technology and there is a race among countries to get supremacy in quantum technology.
Manish Kumar
doaj +1 more source