Solving a discrete logarithm problem with auxiliary input on a 160-bit elliptic curve

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 7293 LNCS, Issue , 2012, Pages 595-608

  Sakemi, Yumi ^a   Hanaoka, Goichiro ^b   Izu, Tetsuya ^a   Takenaka, Masahiko ^a   Yasuda, Masaya ^a  

^a FUJITSU LABORATORIES LTD   (Japan)

^b NATIONAL INSTITUTE OF ADVANCED INDUSTRIAL SCIENCE AND TECHNOLOGY AIST   (Japan)

Author keywords

Barreto Naehrig pairing friendly elliptic curve; Cheon's algorithm; DLPwAI (DLP with Auxiliary Input)

Indexed keywords

AUXILIARY INPUTS; CRYPTOGRAPHIC SCHEMES; CYCLIC GROUP; DISCRETE LOGARITHM PROBLEMS; ELLIPTIC CURVE; NOVEL ALGORITHM; POSITIVE INTEGER D; PRIME ORDERS;

PUBLIC KEY CRYPTOGRAPHY;

ALGORITHMS;

EID: 84861691788     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-30057-8_35     Document Type: Conference Paper

References (24)

1. Boneh, D., Boyen, X.: Efficient Selective-ID Secure Identity-Based Encryption Without Random Oracles. In: Cachin, C., Camenisch, J.L. (eds.) EUROCRYPT 2004. LNCS, vol. 3027, pp. 223-238. Springer, Heidelberg (2004)
2. Boneh, D., Boyen, X.: Short Signatures Without Random Oracles. In: Cachin, C., Camenisch, J.L. (eds.) EUROCRYPT 2004. LNCS, vol. 3027, pp. 56-73. Springer, Heidelberg (2004)
3. Boneh, D., Boyen, X., Goh, E.-J.: Hierarchical Identity Based Encryption with Constant Size Ciphertext. In: Cramer, R. (ed.) EUROCRYPT 2005. LNCS, vol. 3494, pp. 440-456. Springer, Heidelberg (2005) (Pubitemid 41313968)
4. Boneh, D., Franklin, M.: Identity-Based Encryption from the Weil Pairing. In: Kilian, J. (ed.) CRYPTO 2001. LNCS, vol. 2139, pp. 213-229. Springer, Heidelberg (2001)
5. Boneh, D., Gentry, C., Waters, B.: Collusion Resistant Broadcast Encryption with Short Ciphertexts and Private Keys. In: Shoup, V. (ed.) CRYPTO 2005. LNCS, vol. 3621, pp. 258-275. Springer, Heidelberg (2005) (Pubitemid 43902118)
6. Barreto, P.S.L.M., Naehrig, M.: Pairing-Friendly Elliptic Curves of Prime Order. In: Preneel, B., Tavares, S. (eds.) SAC 2005. LNCS, vol. 3897, pp. 319-331. Springer, Heidelberg (2006) (Pubitemid 43986803)
7. 60 Barrier 112-bit Prime ECDLP Solved (2009), http://lacal.epfl.ch/112bit-prime
8. Cheon, J.H.: Security Analysis of the Strong Diffie-Hellman Problem. In: Vaudenay, S. (ed.) EUROCRYPT 2006. LNCS, vol. 4004, pp. 1-11. Springer, Heidelberg (2006)
9. Cheon, J.H.: Discrete Logarithm Problems with Auxiliary Inputs. Journal of Cryptology 23(3), 457-476 (2010)
10. Distributed.net, http://www.distributed.net/Main-Page/
11. Galbraith, S.D., Ruprai, R.S.: Using Equivalence Classes to Accelerate Solving the Discrete Logarithm Problem in a Short Interval. In: Nguyen, P.Q., Pointcheval, D. (eds.) PKC 2010. LNCS, vol. 6056, pp. 368-383. Springer, Heidelberg (2010)
12. Gallant, R.P., Lambert, R.J., Vanstone, S.A.: Improving the Parallelized Pollard Lambda Search on Binary Anomalous Curves. Math. Comp. 69, 1699-1705 (2000)
13. Gallant, R.P., Lambert, R.J., Vanstone, S.A.: Faster Point Multiplication on Elliptic Curves with Efficient Endomorphisms. In: Kilian, J. (ed.) CRYPTO 2001. LNCS, vol. 2139, pp. 190-200. Springer, Heidelberg (2001) (Pubitemid 33317915)
14. Gentry, C.: Practical Identity-Based Encryption Without Random Oracles. In: Vaudenay, S. (ed.) EUROCRYPT 2006. LNCS, vol. 4004, pp. 445-464. Springer, Heidelberg (2006)
15. Izu, T., Takenaka, M., Yasuda, M.: Experimental Results on Cheon's Algorithm. In: WAIS 2010, Proceedings of ARES 2010, pp. 625-630. IEEE Computer Science (2010)
16. Izu, T., Takenaka, M., Yasuda, M.: Experimental Analysis of Cheon's Algorithm against Pairing-friendly Curves. Journal of Information Processing 19, 441-450 (2011)
17. Jao, D., Yoshida, K.: Boneh-Boyen Signatures and the Strong Diffie-Hellman Problem. In: Shacham, H., Waters, B. (eds.) Pairing 2009. LNCS, vol. 5671, pp. 1-16. Springer, Heidelberg (2009)
18. Kozaki, S., Kutsuma, T., Matsuo, K.: Remarks on Cheon's Algorithms for Pairing- Related Problems. In: Takagi, T., Okamoto, T., Okamoto, E., Okamoto, T. (eds.) Pairing 2007. LNCS, vol. 4575, pp. 302-316. Springer, Heidelberg (2007)
19. Pollard, J.: Monte Carlo Methods for Index Computation (mod p). Math. Comp. 32, 918-924 (1978)
20. Shanks, D.: Class Number, a Theory of Factorization, and Genera. In: Proc. of Symp. Math. Soc., vol. 20, pp. 41-440 (1971)
21. Sakemi, Y., Izu, T., Takenaka, M., Yasuda, M.: Solving DLP with Auxiliary Input over an Elliptic Curve Used in TinyTate Library. In: Ardagna, C.A., Zhou, J. (eds.) WISTP 2011. LNCS, vol. 6633, pp. 116-127. Springer, Heidelberg (2011)
22. Sakemi, Y., Izu, T., Takenaka, M., Yasuda, M.: Solving a DLP with Auxiliary Input with the ρ-Algorithm. In: Jung, S., Yung, M. (eds.) WISA 2011. LNCS, vol. 7115, pp. 98-108. Springer, Heidelberg (2012)
23. Teske, E.: Speeding Up Pollard's Rho Method for Computing Discrete Logarithms. In: Buhler, J.P. (ed.) ANTS III. LNCS, vol. 1423, pp. 541-554. Springer, Heidelberg (1998)
24. Teske, E.: On Random Walks for Pollard's Rho Method. Math. Comp. 70, 809-825 (2001)