scientific article; zbMATH DE number 503358
From MaRDI portal
Publication:4279697
Cited in
(7)- Some baby-step giant-step algorithms for the low Hamming weight discrete logarithm problem
- Improving implementable meet-in-the-middle attacks by orders of magnitude
- Computing low-weight discrete logarithms
- On the low Hamming weight discrete logarithm problem for nonadjacent representations
- Fast Exponentiation Using Data Compression
- Analysis of low Hamming weight products
- A Parameterized Splitting System and Its Application to the Discrete Logarithm Problem with Low Hamming Weight Product Exponents
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4279697)