Multiple Discrete Logarithm Problems with Auxiliary Inputs

DOI10.1007/978-3-662-48797-6_8zbMATH Open1396.11142OpenAlexW2294710605MaRDI QIDQ2811130FDOQ2811130

Taechan Kim

Publication date: 10 June 2016

Published in: Advances in Cryptology -- ASIACRYPT 2015 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-662-48797-6_8

zbMATH Keywords

discrete logarithm problemcryptanalysisbirthday problemmultiple discrete logarithm

Mathematics Subject Classification ID

Cryptography (94A60) Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Number-theoretic algorithms; complexity (11Y16)

Cited In (6)

• Generic Hardness of the Multiple Discrete Logarithm Problem
• Bootstrapping for approximate homomorphic encryption
• Bounds in Various Generalized Settings of the Discrete Logarithm Problem
• Discrete logarithm problems with auxiliary inputs
• How to Solve Multiple Short-Exponent Discrete Logarithm Problem
• Finding elliptic curves with a subgroup of prescribed size

Recommendations

• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Some soluble cases of the discrete logarithm problem 👍 👎
• On the discrete logarithm problem 👍 👎
• The Discrete Logarithm Problem 👍 👎
• Discrete logarithm problems with auxiliary inputs 👍 👎
• Generic Hardness of the Multiple Discrete Logarithm Problem 👍 👎
• A new approach to the discrete logarithm problem with auxiliary inputs 👍 👎
• Analysis on a generalized algorithm for the strong discrete logarithm problem with auxiliary inputs 👍 👎
• The Discrete Logarithm problem with preprocessing 👍 👎

This page was built for publication: Multiple Discrete Logarithm Problems with Auxiliary Inputs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2811130)