It is shown that the popular RSA public key encryption scheme does not require two primes but that probable primes may be used instead. A method for finding probable primes is given and the security of systems based on probable primes is discussed.
Supersingular primes for points on
โ Scribed by David Jao
- Publisher
- Elsevier Science
- Year
- 2005
- Tongue
- English
- Weight
- 271 KB
- Volume
- 113
- Category
- Article
- ISSN
- 0022-314X
No coin nor oath required. For personal study only.
โฆ Synopsis
For small odd primes p, we prove that most of the rational points on the modular curve X 0 (p)/w p parametrize pairs of elliptic curves having infinitely many supersingular primes. This result extends the class of elliptic curves for which the infinitude of supersingular primes is known. We give concrete examples illustrating how these techniques can be explicitly used to construct supersingular primes for such elliptic curves. Finally, we discuss generalizations to points defined over larger number fields and indicate the types of obstructions that arise for higher level modular curves.
๐ SIMILAR VOLUMES
## Abstract We provide a sharp, sufficient condition to decide if a point __y__ on a convex surface __S__ is a farthest point (i.e., is at maximal intrinsic distance from some point) on __S__, involving a lower bound __ฯ__ on the total curvature __ฯ~y~__ at __y__, __ฯ~y~__ โฅ __ฯ__. Further conseque