Fast Point Decompression for Standard Elliptic Curves

DOI10.1007/978-3-540-69485-4_10zbMath1300.94042OpenAlexW1567835710MaRDI QIDQ3506353

Billy Bob Brumley, Kimmo Järvinen

Publication date: 12 June 2008

Published in: Public Key Infrastructure (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-69485-4_10

zbMATH Keywords

exponentiationelliptic curve cryptographyaddition chainssquare roots modulo \(p\)

Mathematics Subject Classification ID

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

Cites Work

• A fast algorithm for computing multiplicative inverses in \(\text{GF}(2^ m)\) using normal bases
• Modular Multiplication Without Trial Division
• New directions in cryptography
• A method for obtaining digital signatures and public-key cryptosystems
• A Survey of Fast Exponentiation Methods
• Computing special powers in finite fields
• On addition chains
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Fast Point Decompression for Standard Elliptic Curves