Uniform complexity and digital signatures

DOI10.1016/0304-3975(81)90034-7MaRDI QIDQ1154262zbMATH OpenOpenAlexFDO

Authors 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

cryptologysecurity

Mathematics Subject Classification ID

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

Cites work

• A method for obtaining digital signatures and public-key cryptosystems
• A modification of the RSA public-key encryption procedure (Corresp.)
• Complexity of computations
• Factoring Polynomials Over Large Finite Fields
• Hiding information and signatures in trapdoor knapsacks
• scientific article; zbMATH DE number 3685395 (Why is no real title available?)
• scientific article; zbMATH DE number 3693147 (Why is no real title available?)
• scientific article; zbMATH DE number 3480679 (Why is no real title available?)
• scientific article; zbMATH DE number 3557236 (Why is no real title available?)
• scientific article; zbMATH DE number 3303654 (Why is no real title available?)
• scientific article; zbMATH DE number 3341170 (Why is no real title available?)
• New directions in cryptography
• Probabilistic Algorithms in Finite Fields
• Some remarks concerning the M.I.T. public-key cryptosystem

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1154262)