Efficient arithmetic in (pseudo-)Mersenne prime order fields
DOI10.3934/amc.2020113zbMath1500.94045OpenAlexW3093596850MaRDI QIDQ2085714
Publication date: 18 October 2022
Published in: Advances in Mathematics of Communications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.3934/amc.2020113
elliptic curve cryptographyMersenne primesscalar multiplicationFermat's little theoremconstant-time computationfield multiplication/squaring/reduction/inversionpseudo-Mersenne primes
Cryptography (94A60) Data encryption (aspects in computer science) (68P25) Finite fields (field-theoretic aspects) (12E20) Arithmetic functions; related numbers; inversion formulas (11A25) Applications to coding theory and cryptography of arithmetic geometry (14G50) Elliptic curves over local fields (11G07)
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Fast cryptography in genus 2
- Genus 2 point counting over prime fields
- Cryptographic hardware and embedded systems - CHES 2012. 14th international workshop, Leuven, Belgium, September 9--12, 2012. Proceedings
- High-speed Curve25519 on 8-bit, 16-bit, and 32-bit microcontrollers
- Hyperelliptic cryptosystems
- How to (pre-)compute a ladder -- improving the performance of X25519 and X448
- Kummer for genus one over prime-order fields
- Sandy2x: New Curve25519 Speed Records
- Four $$\mathbb {Q}$$ : Four-Dimensional Decompositions on a $$\mathbb {Q}$$ -curve over the Mersenne Prime
- Kummer Strikes Back: New DH Speed Records
- Faster ECC over $$\mathbb {F}_{2^{521}-1}$$
- Fast Implementation of Curve25519 Using AVX2
- High-Speed High-Security Signatures
- Elliptic Curve Cryptosystems
- Curve41417: Karatsuba Revisited
- Handbook of Elliptic and Hyperelliptic Curve Cryptography
- Public Key Cryptography - PKC 2006
This page was built for publication: Efficient arithmetic in (pseudo-)Mersenne prime order fields
