On the concealability of messages by the Williams public-key encryption scheme

DOI10.1016/0898-1221(84)90082-8zbMath0554.94011OpenAlexW2024157151WikidataQ126536404 ScholiaQ126536404MaRDI QIDQ760408

D. Kharzeev

Publication date: 1984

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

Full work available at URL: https://doi.org/10.1016/0898-1221(84)90082-8

Mathematics Subject Classification ID

Communication, information (94A99)

Related Items (1)

A cubic RSA code equivalent to factorization

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Rivest-Shamir-Adleman public key crytosystems do not always conceal messages
• Some remarks concerning the M.I.T. public-key cryptosystem
• Critical remarks on “Critical Remarks on Some Public-Key Cryptosystems” by T. Herlestam
• SECURITY OF NUMBER THEORETIC PUBLIC KEY CRYPTOSYSTEMS AGAINST RANDOM ATTACK, III
• New directions in cryptography
• A modification of the RSA public-key encryption procedure (Corresp.)
• A method for obtaining digital signatures and public-key cryptosystems
• Critical remarks on some public-key cryptosystems

This page was built for publication: On the concealability of messages by the Williams public-key encryption scheme