Kummer versus Montgomery Face-off over Prime Order Fields
From MaRDI portal
Publication:5883706
Cites work
- scientific article; zbMATH DE number 3948147 (Why is no real title available?)
- scientific article; zbMATH DE number 1936525 (Why is no real title available?)
- Connecting Legendre with Kummer and Edwards
- Efficient 4-Way Vectorizations of the Montgomery Ladder
- Efficient arithmetic in (pseudo-)Mersenne prime order fields
- Elliptic Curve Cryptosystems
- Fast genus 2 arithmetic based on Theta functions
- High-performance implementation of elliptic curve cryptography using vector instructions
- High-speed high-security signatures
- How to (pre-)compute a ladder -- improving the performance of X25519 and X448
- Kummer for genus one over prime-order fields
- Lefschetz's principle
- Montgomery Curves and the Montgomery Ladder
- New directions in cryptography
- Public Key Cryptography - PKC 2006
- Sandy2x: new Curve25519 speed records
- Speeding the Pollard and Elliptic Curve Methods of Factorization
- The arithmetic of characteristic 2 Kummer surfaces and of elliptic Kummer lines
- The strong Lefschetz principle in algebraic geometry
- Twisted Edwards Curves
This page was built for publication: Kummer versus Montgomery Face-off over Prime Order Fields
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5883706)