Rivest-Shamir-Adleman public key crytosystems do not always conceal messages

DOI10.1016/0898-1221(79)90039-7zbMath0411.94010OpenAlexW2054708534MaRDI QIDQ1259539

Itshak Borosh, G. R. Blakley

Publication date: 1979

Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0898-1221(79)90039-7

zbMATH Keywords

primespublic key cryptosystemresidue classesconcealing power

Mathematics Subject Classification ID

Communication, information (94A99) Information storage and retrieval of data (68P20) Elementary number theory (11A99) Theory of computing (68Q99)

Related Items (8)

An effective and fast image encryption algorithm based on chaos and interweaving of ranks ⋮ Fixed points of the subset sum pseudorandom number generators ⋮ A note on the average number of RSA fixed points ⋮ Triggering parametric-down conversion-based quantum key distribution via radiation field ⋮ A cubic RSA code equivalent to factorization ⋮ Unnamed Item ⋮ On the concealability of messages by the Williams public-key encryption scheme ⋮ Fixed points of the RSA encryption algorithm

Cites Work

• SECURITY OF NUMBER THEORETIC PUBLIC KEY CRYPTOSYSTEMS AGAINST RANDOM ATTACK, III
• A method for obtaining digital signatures and public-key cryptosystems

This page was built for publication: Rivest-Shamir-Adleman public key crytosystems do not always conceal messages