Efficient arithmetic in (pseudo-)Mersenne prime order fields

DOI10.3934/amc.2020113zbMath1500.94045MaRDI QIDQ2085714

Palash Sarkar, Kaushik Nath

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

zbMATH Keywords

elliptic curve cryptography; Mersenne primes; scalar multiplication; Fermat's little theorem; constant-time computation; field multiplication/squaring/reduction/inversion; pseudo-Mersenne primes

Mathematics Subject Classification ID

94A60: Cryptography

68P25: Data encryption (aspects in computer science)

12E20: Finite fields (field-theoretic aspects)

11A25: Arithmetic functions; related numbers; inversion formulas

14G50: Applications to coding theory and cryptography of arithmetic geometry

11G07: Elliptic curves over local fields

Uses Software

• GitHub
• Curve25519
• KummerLineV02