Computing low-weight discrete logarithms

DOI10.1007/978-3-319-72565-9_6zbMATH Open1384.94074OpenAlexW2751174500MaRDI QIDQ1746959FDOQ1746959

Bailey Kacsmar, Sarah Plosker, Ryan Henry

Publication date: 26 April 2018

Full work available at URL: https://doi.org/10.1007/978-3-319-72565-9_6

zbMATH Keywords

cryptanalysismeet-in-the-middlediscrete logarithmsbaby-step giant-stepverifier-based password authenticated key exchange (VPAKE)

Mathematics Subject Classification ID

Cryptography (94A60) Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Authentication, digital signatures and secret sharing (94A62)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• An improved algorithm for computing logarithms over<tex>GF(p)</tex>and its cryptographic significance (Corresp.)
• Parallel collision search with cryptanalytic applications
• An implementation for a fast public-key cryptosystem
• Kangaroos, monopoly and discrete logarithms
• Some baby-step giant-step algorithms for the low Hamming weight discrete logarithm problem
• On Diffie-Hellman Key Agreement with Short Exponents
• Random small Hamming weight products with applications to cryptography
• On the minimum distance of some quadratic residue codes (Corresp.)
• Square-root algorithms for the discrete logarithm problem (a survey)
• A Generic Algorithm for Small Weight Discrete Logarithms in Composite Groups
• How long does it take to catch a wild kangaroo?
• On the low Hamming weight discrete logarithm problem for nonadjacent representations
• Cryptographic Hardware and Embedded Systems - CHES 2004
• Analysis of low Hamming weight products
• Computing low-weight discrete logarithms
• Blind password registration for two-server password authenticated key exchange and secret sharing protocols
• Parameterized Splitting Systems for the Discrete Logarithm
• A Parameterized Splitting System and Its Application to the Discrete Logarithm Problem with Low Hamming Weight Product Exponents

Cited In (4)

• Computing discrete logarithms in an interval
• Computing low-weight discrete logarithms
• Low weight discrete logarithm and subset sum in \(2^{0.65n}\) with polynomial memory
• A Kilobit Hidden SNFS Discrete Logarithm Computation

This page was built for publication: Computing low-weight discrete logarithms

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