A Note on the Lattice Factoring Method (<Special Section>Cryptography and Information Security)
スポンサーリンク
概要
- 論文の詳細を見る
In 1999, Boneh et al. proposed the Lattice Factoring Method (LFM) for the integer factoring problem for a composite of the form N = p^rq by employing the LLL-algorithm. Time complexity of LFM is measured by the number of calls of the LLL-algorithm. In the worst case, the number is 2^<(1+c)/(r+c)log p> for a certain constant c. In 2001, Uchiyama and Kanayama introduced a novel criterion and provided an improved algorithm which runs (2^k-p)/|p-N_r+1| times faster (for certain constants k, N_<r+1>). In this letter, we note another practical improvement applicable to the original and the improved LFM, which enables to provide about 2 times speed-up.
- 社団法人電子情報通信学会の論文
- 2004-01-01
著者
関連論文
- Extending Bleichenbachers Forgery Attack
- Small Secret CRT-Exponent Attacks on Takagis RSA
- Reduction Optimal Trinomials for Efficient Software Implementation of the ηT Pairing
- A Practical Countermeasure against Address-bit Differential Power Analysis (特集:プライバシを保護するコンピュータセキュリティ技術)
- A Note on the Lattice Factoring Method (Cryptography and Information Security)
- Small Secret CRT-Exponent Attacks on Takagi's RSA
- A Note on the Lattice Factoring Method
- Side Channel Cryptanalysis on XTR Public Key Cryptosystem(Discrete Mathematics and Its Applications)
- Detailed Cost Estimation of CNTW Forgery Attack against EMV Signature Scheme
- Experimental Analysis of Cheon's Algorithm against Pairing-friendly Curves
- Extending Bleichenbacher's Forgery Attack