Generalised Mersenne numbers revisited
From MaRDI portal
Publication:5326517
DOI10.1090/S0025-5718-2013-02704-4zbMath1276.11201arXiv1108.3054OpenAlexW1984315215MaRDI QIDQ5326517
Publication date: 6 August 2013
Published in: Mathematics of Computation (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1108.3054
elliptic curve cryptographyprime fieldscyclotomic primesgeneralised repunit primeshigh-speed arithmeticgeneralised Mersenne numbers
Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Number-theoretic algorithms; complexity (11Y16)
Related Items
Faster integer multiplication using short lattice vectors, Unnamed Item, Missing a trick: Karatsuba variations
Uses Software
Cites Work
- Endomorphisms for faster elliptic curve cryptography on a large class of curves
- Factoring integers with elliptic curves
- Structure of parallel multipliers for a class of fields \(GF(2^ m)\)
- Distribution of generalized Fermat prime numbers
- Elliptic Curves and Primality Proving
- High-Speed High-Security Signatures
- Some Primes of the Form (a n - 1)/(a - 1)
- Sur certaines hypothèses concernant les nombres premiers
- A Heuristic Asymptotic Formula Concerning the Distribution of Prime Numbers
- Modular Multiplication Without Trial Division
- Timing Attacks on Implementations of Diffie-Hellman, RSA, DSS, and Other Systems
- Efficient Techniques for High-Speed Elliptic Curve Cryptography
- Factoring Repunits
- A method for obtaining digital signatures and public-key cryptosystems
- Generalized Repunit Primes
- Discrete Weighted Transforms and Large-Integer Arithmetic
- A Refined Power-Analysis Attack on Elliptic Curve Cryptosystems
- Algorithms and Computation
- Advances in Cryptology - EUROCRYPT 2004
- Cryptographic Hardware and Embedded Systems - CHES 2004
- Faster Addition and Doubling on Elliptic Curves
- Advances in Elliptic Curve Cryptography
- Selected Areas in Cryptography
- Public Key Cryptography - PKC 2006
- Topics in Cryptology – CT-RSA 2004
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
