Analysis on a generalized algorithm for the strong discrete logarithm problem with auxiliary inputs

DOI10.1090/S0025-5718-2014-02813-5zbMath1298.68115MaRDI QIDQ5418497

Jung Hee Cheon, Minkyu Kim, In-Sok Lee

Publication date: 4 June 2014

Published in: Mathematics of Computation (Search for Journal in Brave)

zbMATH Keywords

discrete logarithm problem; sum of digits; (strong) Diffie-Hellman problem

Mathematics Subject Classification ID

68Q25: Analysis of algorithms and problem complexity

11Y16: Number-theoretic algorithms; complexity

Related Items

Recent progress on the elliptic curve discrete logarithm problem, Research on attacking a special elliptic curve discrete logarithm problem, Finding elliptic curves with a subgroup of prescribed size, A new approach to the discrete logarithm problem with auxiliary inputs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Factoring polynomials with rational coefficients
• Short signatures without random oracles and the SDH assumption in bilinear groups
• Fast multiplication of large numbers
• Security Analysis of the Strong Diffie-Hellman Problem
• Pairing Lattices
• The Uber-Assumption Family
• New directions in cryptography
• The Relationship Between Breaking the Diffie--Hellman Protocol and Computing Discrete Logarithms
• Advances in Cryptology - EUROCRYPT 2004
• Advances in Cryptology – CRYPTO 2004
• Hierarchical Identity Based Encryption with Constant Size Ciphertext
• Collusion Resistant Broadcast Encryption with Short Ciphertexts and Private Keys
• Theory of Cryptography
• Discrete logarithm problems with auxiliary inputs