搜索结果: 1-7 共查到“军事学 Hidden Number Problem”相关记录7条 . 查询时间(0.089 秒)
New Results on Modular Inversion Hidden Number Problem and Inversive Congruential Generator
Modular inversion hidden number problem inversive congruential generator lattice
2019/6/3
The Modular Inversion Hidden Number Problem (MIHNP), introduced by Boneh, Halevi and Howgrave-Graham in Asiacrypt 2001, is briefly described as follows: Let MSBδ(z)MSBδ(z) refer to the δδ most signifi...
Finding Small Solutions of a Class of Simultaneous Modular Equations and Applications to Modular Inversion Hidden Number Problem and Inversive Congruential Generator
Modular Inversion Hidden Number Problem Inversive Congruential Generator
2016/1/6
In this paper we revisit the modular inversion hidden number
problem and the inversive congruential pseudo random number generator
and consider how to more efficiently attack them in terms of fewer
...
This work extends the line of research on the hidden number problem. Motivated
by studying bit security in finite fields, we define the multivariate hidden number problem.
Here, the secret and the m...
Modular Inversion Hidden Number Problem -- Correction and Improvements
Correction Improvements
2015/12/24
The Modular Inversion Hidden Number Problem (MIHNP) was introduced by Boneh, Halevi and Howgrave-Graham in Asiacrypt 2001 (BHH'01). They provided two heuristics - in Method I, two-third of the output ...
Modular Inversion Hidden Number Problem- A Lattice Approach
Coppersmith’s techniques Hidden Number Problem LLL algorithm
2015/12/21
The Modular Inversion Hidden Number Problem (MIHNP) was introduced by
Boneh, Halevi and Howgrave-Graham in Asiacrypt 2001 (BHH’01). They provided
two heuristics - in Method I, two-third of the outpu...
Using Bleichenbacher's Solution to the Hidden Number Problem to Attack Nonce Leaks in 384-Bit ECDSA
cryptanalysis digital signatures lattice techniques
2014/3/12
In this paper we describe an attack against nonce leaks in 384-bit ECDSA using an FFT-based attack due to Bleichenbacher. The signatures were computed by a modern smart card. We extracted the low-orde...
Hidden Number Problem in Small Subgroups
Hidden number problem Diffie-Hellman key exchange Lattice reduction
2009/4/8
Boneh and Venkatesan have proposed a polynomial time algorithm
for recovering a "hidden" element ® 2 IFp, where p is prime, from
rather short strings of the most significant bits of the residue ...