Some remarks concerning the M.I.T. public-key cryptosystem

DOI10.1007/BF01931269zbMath0418.94010MaRDI QIDQ3852104

B. K. Schmid, Hugh C. Williams

Publication date: 1979

Published in: BIT (Search for Journal in Brave)

zbMATH Keywords

securityencryptionpublic-key cryptosystem

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (7)

New weak keys in RSA ⋮ Fast generation of prime numbers and secure public-key cryptographic parameters. ⋮ Uniform complexity and digital signatures ⋮ Cryptanalysis of Rédei- and Dickson permutations on arbitrary finite rings ⋮ Prime-number algorithm for public-key systems ⋮ On the concealability of messages by the Williams public-key encryption scheme ⋮ An Overview of Factoring

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Riemann's hypothesis and tests for primality
• Approximate formulas for some functions of prime numbers
• Critical remarks on “Critical Remarks on Some Public-Key Cryptosystems” by T. Herlestam
• New directions in cryptography
• A Method of Factoring and the Factorization of F 7
• New Primality Criteria and Factorizations of 2 m ± 1
• A monte carlo method for factorization
• A Fast Monte-Carlo Test for Primality
• A method for obtaining digital signatures and public-key cryptosystems
• Critical remarks on some public-key cryptosystems
• A design for a number theory package with an optimized trial division routine

This page was built for publication: Some remarks concerning the M.I.T. public-key cryptosystem