Extended Hidden Number Problem and Its Cryptanalytic Applications

DOI10.1007/978-3-540-74462-7_9MaRDI QIDQ5429155zbMATH OpenOpenAlexFDO

Authors Martin Hlaváč, Tomáš Rosa

Publication date 29 November 2007

Published in Selected Areas in Cryptography (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-74462-7_9

zbMATH Keywords

cache analysisDSA implementationhyper-threadinglatticeside channel analysissliding window

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• Playing ``hide-and-seek with numbers: the hidden number problem, lattices and exponential sums
• scientific article; zbMATH DE number 1588483
• scientific article; zbMATH DE number 1088240
• The insecurity of the digital signature algorithm with partially known nonces
• scientific article; zbMATH DE number 2086222

Cited in

(19)

• Analysis of hidden number problem with hidden multiplier
• On bounded distance decoding with predicate: breaking the ``lattice barrier for the hidden number problem
• Attacking ECDSA leaking discrete bits with a more efficient lattice
• Cryptanalysis of elliptic curve hidden number problem from PKC 2017
• Close values of shifted modular inversions and the decisional modular inversion hidden number problem
• The alternating greedy expansion and applications to computing digit expansions from left-to-right in cryptography
• scientific article; zbMATH DE number 2086222 (Why is no real title available?)
• scientific article; zbMATH DE number 7259160 (Why is no real title available?)
• Evaluating the cache side channel attacks against ECDSA
• A tale of three signatures: practical attack of ECDSA with wNAF
• Generalized attack on ECDSA: known bits in arbitrary positions
• The hidden number problem with small unknown multipliers: cryptanalyzing MEGA in six queries and other applications
• EHNP strikes back: analyzing SM2 implementations
• Handle the traces: revisiting the attack on ECDSA with EHNP
• Attacking (EC)DSA with partially known multiples of nonces
• One bit to rule them all -- imperfect randomness harms lattice signatures
• Survey: recovering cryptographic keys from partial information, by example
• One (noisy) bit to rule them all: key recovery from randomness leakage in ML-DSA
• Formalizing the hidden number problem in Isabelle/HOL

Describes a project that uses

Uses Software

• OpenSSL

This page was built for publication: Extended Hidden Number Problem and Its Cryptanalytic Applications

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