Results 11 to 20 of about 23,538,535 (168)
Effective Pairings in Isogeny-Based Cryptography [PDF]
, 2023 LATINCRYPT ...
Krijn Reijnders
core +6 more sources
Lattice based and isogeny based post-quantum cryptography [PDF]
, 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
Exploring RNS for Isogeny-based Cryptography. [PDF]
IACR 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
Pairing Optimizations for Isogeny-Based Cryptosystems
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 +2 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
core +7 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 +7 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
openaire +2 more sources
A New Isogeny Representation and Applications to Cryptography [PDF]
, 2022 International audienceThis paper focuses on isogeny representations, defined as ways to evaluate isogenies and verify membership to the language of isogenous supersingular curves (the set of triples D, E1, E2 with a cyclic isogeny of degree D between E1 ...
Leroux, Antonin, Antonin Leroux
core +5 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
Optimized CSIDH Implementation Using a 2-Torsion Point
Cryptography, 2020 The implementation of isogeny-based cryptography mainly use Montgomery curves, as they offer fast elliptic curve arithmetic and isogeny computation. However, although Montgomery curves have efficient 3- and 4-isogeny formula, it becomes inefficient when ...
Donghoe Heo +4 more
doaj +1 more source