Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

Montgomery Curves and the Montgomery Ladder

From MaRDI portal
Publication:5888178
Jump to:navigation, search

DOI10.1017/9781316271575.005OpenAlexW2612824548MaRDI QIDQ5888178

Tanja Lange, Daniel J. Bernstein

Publication date: 21 April 2023

Published in: Topics in Computational Number Theory Inspired by Peter L. Montgomery (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1017/9781316271575.005



Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Number-theoretic algorithms; complexity (11Y16) Applications to coding theory and cryptography of arithmetic geometry (14G50) Factorization (11Y05)


Related Items (5)

Kummer versus Montgomery Face-off over Prime Order Fields ⋮ CSIDH on the Surface ⋮ Efficient Software Implementation of Laddering Algorithms Over Binary Elliptic Curves ⋮ Radical isogenies ⋮ How to (pre-)compute a ladder -- improving the performance of X25519 and X448






This page was built for publication: Montgomery Curves and the Montgomery Ladder

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:5888178&oldid=30753597"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 7 March 2024, at 06:04.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki