Uniform complexity and digital signatures

DOI10.1016/0304-3975(81)90034-7zbMath0464.68049OpenAlexW1977178457MaRDI QIDQ1154262

Karl J. Lieberherr

Publication date: 1981

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(81)90034-7

zbMATH Keywords

securitycryptology

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Communication, information (94A99)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Some remarks concerning the M.I.T. public-key cryptosystem
• New directions in cryptography
• Probabilistic Algorithms in Finite Fields
• A modification of the RSA public-key encryption procedure (Corresp.)
• Complexity of computations
• A method for obtaining digital signatures and public-key cryptosystems
• Factoring Polynomials Over Large Finite Fields
• Hiding information and signatures in trapdoor knapsacks

This page was built for publication: Uniform complexity and digital signatures