A Generic Algorithm for Small Weight Discrete Logarithms in Composite Groups

DOI10.1007/978-3-319-13051-4_17MaRDI QIDQ2798621zbMATH OpenOpenAlexFDO

Authors Alexander May, Ilya Ozerov

Publication date 13 April 2016

Published in Selected Areas in Cryptography -- SAC 2014 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-13051-4_17

zbMATH Keywords

cryptanalysisgeneric discrete logarithmrepresentationssmall Hamming weight

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• scientific article; zbMATH DE number 1795243
• scientific article; zbMATH DE number 503246
• Discrete logarithms for finite groups
• Structure computation and discrete logarithms in finite abelian \(p\)-groups
• The discrete logarithm problem in some groups
• ON THE COMPLEXITY OF DISCRETE LOGARITHM PROBLEM IN AN INTERVAL IN A FINITE CYCLIC GROUP WITH EFFICIENT INVERSION
• A deterministic algorithm for the discrete logarithm problem in a semigroup
• Weak discrete logarithms in non-abelian groups
• Faster individual discrete logarithms in finite fields of composite extension degree

Cited in

(8)

• Computing low-weight discrete logarithms
• Low weight discrete logarithm and subset sum in \(2^{0.65n}\) with polynomial memory
• Some baby-step giant-step algorithms for the low Hamming weight discrete logarithm problem
• О сложности двупараметрической задачи дискретного логарифмирования в конечной циклической группе с эффективным автоморфизмом
• A Parameterized Splitting System and Its Application to the Discrete Logarithm Problem with Low Hamming Weight Product Exponents
• The One-More Discrete Logarithm Assumption in the Generic Group Model
• Low memory attacks on small key CSIDH
• Recent progress on the elliptic curve discrete logarithm problem

This page was built for publication: A Generic Algorithm for Small Weight Discrete Logarithms in Composite Groups

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