Reusing nonces in Schnorr signatures (and keeping it secure...)

DOI10.1007/978-3-319-66402-6_14zbMath1500.94065OpenAlexW2744857319MaRDI QIDQ2167718

Damien Vergnaud, Rémi Géraud, Houda Ferradi, David Naccache, Marc Beunardeau, Aisling Connolly

Publication date: 25 August 2022

Full work available at URL: https://doi.org/10.1007/978-3-319-66402-6_14

zbMATH Keywords

precomputation techniquesresource-constrained signature algorithms

Mathematics Subject Classification ID

Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On Schnorr's preprocessing for digital signature schemes
• Analysis of low Hamming weight products
• Random small Hamming weight products with applications to cryptography
• Security arguments for digital signatures and blind signatures
• An implementation for a fast public-key cryptosystem
• Security Proofs for Signature Schemes
• Mathematics of Public Key Cryptography
• GLV/GLS Decomposition, Power Analysis, and Attacks on ECDSA Signatures with Single-Bit Nonce Bias
• On Computing Logarithms Over Finite Fields
• How To Prove Yourself: Practical Solutions to Identification and Signature Problems
• Theory of Cryptography

This page was built for publication: Reusing nonces in Schnorr signatures (and keeping it secure...)