Reducing the elliptic curve cryptosystem of Meyer-Müller to the cryptosystem of Rabin-Williams

DOI10.1023/A:1008256404676MaRDI QIDQ1379660zbMATH OpenOpenAlexFDO

Authors Marc Joye, Jean-Jacques Quisquater

Publication date 10 January 1999

Published in Designs, Codes and Cryptography (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1023/a:1008256404676

zbMATH Keywords

elliptic curvescryptographyRabin-type cryptosystems

Mathematics Subject Classification ID

Cryptography (94A60) Applications to coding theory and cryptography of arithmetic geometry (14G50)

Recommendations

• On the mod \(p\) reductions of an elliptic curve
• Reducing Key Length of the McEliece Cryptosystem
• An elliptic curve analogue of McCurley's key agreement scheme
• scientific article; zbMATH DE number 1088230
• Reducing elliptic curve logarithms to logarithms in a finite field
• Comparing the MOV and FR Reductions in Elliptic Curve Cryptography
• On the embedding degree of reductions of an elliptic curve
• Lattice basis reduction, Jacobi sums and hyperelliptic cryptosystems
• Reductions of an elliptic curve with almost prime orders
• Constructing Pairing-Friendly Elliptic Curves Using Gröbner Basis Reduction

Describes a project that uses

Uses Software

• PARI/GP

This page was built for publication: Reducing the elliptic curve cryptosystem of Meyer-Müller to the cryptosystem of Rabin-Williams

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1379660)