The Discrete Logarithm problem with preprocessing

DOI10.1007/978-3-319-78375-8_14MaRDI QIDQ1648845zbMATH OpenOpenAlexFDO

Authors Henry Corrigan-Gibbs, Dmitry Kogan

Publication date 9 July 2018

Full work available at URL https://doi.org/10.1007/978-3-319-78375-8_14

Mathematics Subject Classification ID

Cryptography (94A60) Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Algorithms in computer science (68W99)

Recommendations

• Generic Hardness of the Multiple Discrete Logarithm Problem
• scientific article; zbMATH DE number 1303114
• Multiple Discrete Logarithm Problems with Auxiliary Inputs
• Analysis of possible pre-computation aided DLP solving algorithms
• scientific article; zbMATH DE number 1583798

Cited in

(29)

• Does Fiat-Shamir require a cryptographic hash function?
• Ciphertext expansion in limited-leakage order-preserving encryption: a tight computational lower bound
• Analysis of possible pre-computation aided DLP solving algorithms
• Time-space lower bounds for finding collisions in Merkle-Damgård hash functions
• Everybody's a target: scalability in public-key encryption
• How to Solve Multiple Short-Exponent Discrete Logarithm Problem
• Generic-group lower bounds via reductions between geometric-search problems: with and without preprocessing
• On time-space lower bounds for finding short collisions in sponge hash functions
• The query-complexity of preprocessing attacks
• Multiple Discrete Logarithm Problems with Auxiliary Inputs
• On time-space tradeoffs for bounded-length collisions in Merkle-Damgård hashing
• On time-space tradeoffs for bounded-length collisions in Merkle-Damgård hashing
• scientific article; zbMATH DE number 3863322 (Why is no real title available?)
• On the memory-tightness of hashed ElGamal
• Trapdoor memory-hard functions
• Unbiasable verifiable random functions
• Lower bounds for (batch) PIR with private preprocessing
• To label, or not to label (in generic groups)
• scientific article; zbMATH DE number 4214161 (Why is no real title available?)
• Time-space tradeoffs and short collisions in Merkle-Damgård hash functions
• Time-space tradeoffs for sponge hashing: attacks and limitations for short collisions
• Beyond Uber: instantiating generic groups via PGGs
• Unifying presampling via concentration bounds
• A fully-constructive discrete-logarithm preprocessing algorithm with an optimal time-space tradeoff
• On the distributed discrete logarithm problem with preprocessing
• Bounds in various generalized settings of the discrete logarithm problem
• Time-space lower bounds for finding collisions in Merkle-Damgård Hash functions
• On the multi-user security of short Schnorr signatures with preprocessing
• Discrete logarithm problems with auxiliary inputs

This page was built for publication: The Discrete Logarithm problem with preprocessing

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