An exhaustive search method to find all small solutions of a multivariate modular linear equation
暂无分享,去创建一个
[1] László Babai,et al. On Lovász’ lattice reduction and the nearest lattice point problem , 1986, Comb..
[2] Kaoru Kurosawa,et al. A Complete and Explicit Security Reduction Algorithm for RSA-Based Cryptosystems , 2003, ASIACRYPT.
[3] Jacques Stern,et al. RSA-OAEP Is Secure under the RSA Assumption , 2001, Journal of Cryptology.
[4] Alexander May,et al. New Attacks on RSA with Small Secret CRT-Exponents , 2006, Public Key Cryptography.
[5] László Lovász,et al. Factoring polynomials with rational coefficients , 1982 .
[6] Jean-François Misarsky,et al. A Multiplicative Attack Using LLL Algorithm on RSA Signatures with Redundancy , 1997, CRYPTO.
[7] Antoine Joux,et al. Improvements to the general number field sieve for discrete logarithms in prime fields. A comparison with the gaussian integer method , 2003, Math. Comput..
[8] Ravi Kannan,et al. Improved algorithms for integer programming and related lattice problems , 1983, STOC.