Art

J-GLOBAL ID：201702232882874014   Reference number：17A1942942

Lattice Attacks on Elliptic Curve Diffie-Hellman key exchange

楕円曲線Diffie-Hellman鍵共有に対する格子簡約攻撃

Author (4)： ONOZAWA SOTA (東大) ,  TAKAYASU ATSUSHI (東大) ,  TAKAYASU ATSUSHI (産業技術総合研) ,  KUNIHIRO NOBORU (東大)
Material： 電子情報通信学会技術研究報告  (IEICE Technical Report (Institute of Electronics, Information and Communication Engineers))
Volume： 117  Issue： 285(ISEC2017 49-71)  Page： 115-122  Publication year： Nov. 02, 2017 
JST Material Number： S0532B  ISSN： 0913-5685  Document type： Proceedings
Article type： 原著論文  Country of issue： Japan (JPN)  Language： JAPANESE (JA)

Thesaurus term： computer network ,  *cryptography key ,  *information sharing ,  information ,  *restoration ,  approximation method ,  scale down ,  algorithm ,  public key cryptography ,  *aggressive behavior ,  *cyberattack
Semi thesaurus term： Lenstra, Lenstra, Lovasz algorithm ,  *key recovery ,  *key sharing ,  polynomial time algorithm ,  elliptic curve cryptogram ,  secret key ,  imperfect information ,  *information attack

JST classification (1)： Computer networks  (JC03000K)

Reference (25)：

• Don Coppersmith. Finding small solutions to small degree polynomials. In Proc. of EUROCRYPT, pp. 155-165, 1996.
• Nicholas Howgrave-Graham. Finding small roots of univariate modular equations revisited. In Proc. of Cryptography and Coding, pp. 131-142, 1997.
• Dan Boneh, Ramarathnam Venkatesan. Hardness of computing the most significant bits of secret keys in Diffie-Hellman and related schemes. In Proc. of CRYPTO, pp. 129-142, 1996.
• Barak Shani. On the bit security of elliptic curve Diffie-Hellman. In Proc. of PKC, pp. 361-387, 2017.
• Arjen K. Lenstra, Hendrick W. Lenstra Jr and L?szl? Lov?sz. Factoring polynomials with rational coefficients. Math. Ann., Vol. 261, pp. 513-534, 1982.

Terms in the title (5)： 楕円曲線 ,  Diffie-Hellman鍵共有 ,  格子 ,  簡約 ,  攻撃