Layering quantum-resistance into classical digital signature algorithms
From MaRDI portal
Publication:2154036
Recommendations
Cites work
- A method for obtaining digital signatures and public-key cryptosystems
- Collapse-binding quantum commitments without random oracles
- Diophantine Representation of the Set of Prime Numbers
- How To Prove Yourself: Practical Solutions to Identification and Signature Problems
- How to Time-Stamp a Digital Document
- scientific article; zbMATH DE number 5320241 (Why is no real title available?)
- scientific article; zbMATH DE number 5485433 (Why is no real title available?)
- scientific article; zbMATH DE number 826064 (Why is no real title available?)
- New directions in cryptography
- One Way Hash Functions and DES
- Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
- Scalable zero knowledge with no trusted setup
- Security comparisons and performance analyses of post-quantum signature algorithms
- Strengths and Weaknesses of Quantum Computing
- The Knowledge Complexity of Interactive Proof Systems
- Timed signatures and zero-knowledge proofs -- timestamping in the blockchain era
- Timing attacks on implementations of Diffie-Hellman, RSA, DSS, and other systems
- TurboIKOS: improved non-interactive zero knowledge and post-quantum signatures
- W-OTS\textsuperscript{+} up my sleeve! A hidden secure fallback for cryptocurrency wallets
Cited in
(2)
This page was built for publication: Layering quantum-resistance into classical digital signature algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2154036)