𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On using primes for public key encryption systems

✍ Scribed by E.Dennis Huthnance; Joe Warndof


Publisher
Elsevier Science
Year
1988
Tongue
English
Weight
221 KB
Volume
1
Category
Article
ISSN
0893-9659

No coin nor oath required. For personal study only.

✦ Synopsis


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.


πŸ“œ SIMILAR VOLUMES


Key management of the double random-phas
✍ Nirmala Saini; Aloka Sinha πŸ“‚ Article πŸ“… 2010 πŸ› Elsevier Science 🌐 English βš– 603 KB

Public-key encryption has been used to encode the key of the encryption process. In the proposed technique, an input image has been encrypted by using the double random-phase-encoding method using extended fractional Fourier transform. The key of the encryption process have been encoded by using the

On the concealability of messages by the
✍ S. Kothari; S. Lakshmivarahan πŸ“‚ Article πŸ“… 1984 πŸ› Elsevier Science 🌐 English βš– 665 KB

A (plaintext) message is said to be unconcealable if the encrypted message is the same as the original plaintext message. An analysis of the Williams public-key encryption scheme from the point of view of (un) concealability of messages is presented.