Computing low-weight discrete logarithms

DOI10.1007/978-3-319-72565-9_6MaRDI QIDQ1746959zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• Some baby-step giant-step algorithms for the low Hamming weight discrete logarithm problem
• A discrete logarithm-based approach to compute low-weight multiples of binary polynomials
• The number field sieve for integers of low weight
• Computing discrete logarithms in an interval
• Low weight discrete logarithm and subset sum in \(2^{0.65n}\) with polynomial memory

Cites work

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

Cited in

(6)

• Some baby-step giant-step algorithms for the low Hamming weight discrete logarithm problem
• A Kilobit Hidden SNFS Discrete Logarithm Computation
• Computing discrete logarithms in an interval
• Computing low-weight discrete logarithms
• Topics in Cryptology – CT-RSA 2005
• Low weight discrete logarithm and subset sum in \(2^{0.65n}\) with polynomial memory

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)