Results 71 to 80 of about 18,462 (179)
CLEI Electronic JournalCryptography based on elliptic curves is endowed with efficient methods for public-key cryptography. Recent research has shown the superiority of the Montgomery and Edwards curves over the Weierstrass curves as they require fewer arithmetic operations ...
Armando Faz Hernandez, Julio López
doaj +1 more source
Let us walk on the 3-isogeny graph: efficient, fast, and simple
Transactions on Cryptographic Hardware and Embedded SystemsConstructing and implementing isogeny-based cryptographic primitives is an active research. In particular, performing length-n isogenies walks over quadratic field extensions of Fp plays an exciting role in some constructions, including Hash functions ...
Jesús-Javier Chi-Domínguez +2 more
doaj +1 more source
Quaternion Algrebras and isogeny-based cryptography
, 2022 L'avènement de l'ordinateur quantique est une menace pour la cryptographie en permettant de résoudre les problèmes sur lesquels reposent la sécurité de nombreux protocoles. La cryptographie à base d'isogénies est une famille de protocoles reposant sur la difficulté de trouver une isogénie entre deux courbes elliptiques supersingulières, un problème ...
openaire +1 more source
Classical and Quantum Algorithms for Isogeny-based Cryptography
, 2015 Isogeny-based cryptography using supersingular elliptic curves --- most prominently, the constructions of De Feo-Jao-Plut --- is one of the few practical candidates for post-quantum public key cryptography. Its formidable security claim is earned through
Sankar, Anirudh
core
Genus two isogeny cryptography
, 2019 We study (ℓ,ℓ) -isogeny graphs of principally polarised supersingular abelian surfaces (PPSSAS). The (ℓ,ℓ) -isogeny graph has cycles of small length that can be used to break the collision resistance assumption of the genus two isogeny hash function ...
Ti, YB +4 more
core +1 more source
Simpler and Faster Pairings from the Montgomery Ladder [PDF]
International audienceWe show that Montgomery ladders compute pairings as a by-product, and explain how a small adjustment to the ladder results in simple and efficient algorithms for the Weil and Tate pairing on elliptic curves using cubical arithmetic.
Pope, Giacomo +9 more
core +1 more source
Faster Key Compression for Isogeny-Based Cryptosystems [PDF]
, 2018 Supersingular isogeny-based cryptography is one of the more recent families of post-quantum proposals. An interesting feature is the comparatively low bandwidth occupation in key agreement protocols, which stems from the possibility of key compression ...
Paulo S. L. M. Barreto +9 more
core +1 more source
TinyIBE: identity-based encryption for heterogeneous sensor networks [PDF]
, 2009 The area of security for heterogeneous sensor networks (HSNs) is still an open research field that requires new cryptographic solutions. Recent results have demonstrated that elliptic curve cryptography (ECC) and pairing-based cryptography (PBC) are ...
Martin Collier +3 more
core +1 more source
Dual Isogenies and Their Application to Public-Key Compression for Isogeny-Based Cryptography
, 2019 The isogeny-based protocols SIDH and SIKE have received much attention for being post-quantum key agreement candidates that retain relatively small keys. A recent line of work has proposed and further improved compression of public keys, leading to the inclusion of public-key compression in the SIKE proposal for Round 2 of the NIST Post-Quantum ...
Naehrig, M., Renes, J.
openaire +3 more sources
Comparison between the RSA cryptosystem and elliptic curve cryptography
, 2010 In the globalization era, cryptography becomes more popular and powerful; in fact it is very important in many areas (i.e. mathematics, computer science, networks, etc).
Abdullah, Kamilah
core