Optimal strong primes

DOI10.1016/j.ipl.2004.09.015zbMath1170.94328MaRDI QIDQ834990

N. E. Zubov

Publication date: 27 August 2009

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2004.09.015

zbMATH Keywords

computational complexity; cryptography; public key cryptosystem; strong prime

Mathematics Subject Classification ID

11T71: Algebraic coding theory; cryptography (number-theoretic aspects)

94A60: Cryptography

11A41: Primes

Cites Work

• Waring's problem for algebraic number fields and primes of the form \((p^ r -1)/(p^ d-1)\)
• Factoring polynomials modulo special primes
• Factoring integers with elliptic curves
• On the distribution of the power generator
• Evaluation of Artin's Constant and the Twin-Prime Constant
• A Heuristic Asymptotic Formula Concerning the Distribution of Prime Numbers
• Efficient method for generating strong primes with constraint of bit length
• An FFT Extension to the P - 1 Factoring Algorithm
• Strong Primes are Easy to Find
• Factoring with Cyclotomic Polynomials
• A p + 1 Method of Factoring
• Proportion of primes generated by strong prime methods
• A method for obtaining digital signatures and public-key cryptosystems
• Counting the Integers Factorable via Cyclotomic Methods
• Maximally equidistributed combined Tausworthe generators
• Random Numbers Generated by Linear Recurrence Modulo Two
• Coding the Lehmer pseudo-random number generator
• A Remark on a Paper of Bateman and Horn
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item