Cryptology ePrint Archive: Report 2013/249

Available versions in chronological order

20130503:083047 (posted 03-May-2013 08:30:47 UTC): How to Factor N_1 and N_2 When p_1=p_2 mod 2^t; Kaoru Kurosawa and Takuma Ueda
20130510:054309 (posted 10-May-2013 05:43:09 UTC): How to Factor N_1 and N_2 When p_1=p_2 mod 2^t; Kaoru Kurosawa and Takuma Ueda
20130510:054437 (posted 10-May-2013 05:44:37 UTC): How to Factor N_1 and N_2 When p_1=p_2 mod 2^t; Kaoru Kurosawa and Takuma Ueda

[ Cryptology ePrint archive ]