A new approach to the discrete logarithm problem with auxiliary inputs

DOI10.1112/S1461157015000303zbMath1352.68097OpenAlexW2401424261MaRDI QIDQ3467665

Jung Hee Cheon, Taechan Kim

Publication date: 4 February 2016

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

Full work available at URL: https://doi.org/10.1112/s1461157015000303

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Cryptography (94A60) Number-theoretic algorithms; complexity (11Y16)

Related Items (3)

Finding elliptic curves with a subgroup of prescribed size ⋮ Recent progress on the elliptic curve discrete logarithm problem ⋮ Still wrong use of pairings in cryptography

Cites Work

• A non-uniform birthday problem with applications to discrete logarithms
• Polynomials with small value set over finite fields
• Occupancy with two types of balls
• The third-order factorable core of polynomials over finite fields
• On the cardinality of value set of polynomials with coefficients in a finite field
• A geometric approach to permutation polynomials over a finite field
• Note on the mean value of $V \left( f \right)$
• Security Analysis of the Strong Diffie-Hellman Problem
• Analysis on a generalized algorithm for the strong discrete logarithm problem with auxiliary inputs
• Collusion Resistant Broadcast Encryption with Short Ciphertexts and Private Keys
• Discrete logarithm problems with auxiliary inputs

This page was built for publication: A new approach to the discrete logarithm problem with auxiliary inputs