scientific article; zbMATH DE number 1088241

MaRDI QIDQ4364558zbMATH OpenFDO

Authors M. Bellare, Daniele Micciancio, Shafi Goldwasser

Publication date 7 January 1998

zbMATH Keywords

Digital Signature Standardlinear congruential pseudorandom generatormodular linear equationssecret key

Mathematics Subject Classification ID

Random number generation in numerical analysis (65C10) Cryptography (94A60)

Recommendations

• The insecurity of the digital signature algorithm with partially known nonces
• Recovering private keys generated with weak PRNGs
• scientific article; zbMATH DE number 176069

Cited in

(14)

• A variant of digital signature algorithm
• Bitcoin private key locked transactions
• Generic groups, collision resistance, and ECDSA
• Polynomial evaluation and side channel analysis
• Recovering private keys generated with weak PRNGs
• New lattice attacks on DSA schemes
• Application of the lattice theory to the analysis of digital signature schemes
• Some lattice attacks on DSA and ECDSA
• Meta-heuristic approaches to solve shortest lattice vector problem
• A DSA-like digital signature protocol
• Efficient Pseudorandom Generators Based on the DDH Assumption
• On elliptic curve L-functions integrated encryption scheme
• Attacking (EC)DSA scheme with ephemeral keys sharing specific bits
• Attacking (EC)DSA with partially known multiples of nonces

This page was built for publication:

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