Abstract
From the Publisher: A comprehensive account of recent algorithms developed in computational number theory and primality testing. Provides a general framework for the theoretical study of public key cryptography and pseudorandom generators. Unique in its approach, the book will be a valuable addition to computer literature.
Keywords
Primality testMathematicsCryptographyArithmeticDiscrete mathematicsAlgorithmPrime number
Affiliated Institutions
Related Publications
Efficient and portable combined random number generators
In this paper we present an efficient way to combine two or more Multiplicative Linear Congruential Generators (MLCGs) and propose several new generators. The individual MLCGs, ...
SOME PUBLIC-KEY CRYPTO-FUNCTIONS AS INTRACTABLE AS FACTORIZATION
In the RSA public-key crypto system a message M (<R) is encrypted by calculating K≡me (mod R), where 0<K<R and R, e are integers which are made public. The recipient of K can de...
Theorems on factorization and primality testing
1. Introduction . This paper is concerned with the problem of obtaining theoretical estimates for the number of arithmetical operations required to factorize a large integer n o...
Handbook of applied cryptography
From the Publisher: A valuable reference for the novice as well as for the expert who needs a wider scope of coverage within the area of cryptography, this book provides easy a...
Publication Info
- Year
- 1988
- Type
- article
- Volume
- 50
- Issue
- 181
- Pages
- 354-354
- Citations
- 76
- Access
- Closed
External Links
Social Impact
Altmetric
PlumX Metrics
Social media, news, blog, policy document mentions
Citation Metrics
76
OpenAlex
Cite This
H. W. Lenstra,
Evangelos Kranakis
(1988).
Primality and Cryptography..
Mathematics of Computation
, 50
(181)
, 354-354.
https://doi.org/10.2307/2007943
Identifiers
- DOI
- 10.2307/2007943