Pages that link to "Item:Q2634391"
From MaRDI portal
The following pages link to A discrete logarithm-based approach to compute low-weight multiples of binary polynomials (Q2634391):
Displaying 6 items.
- Improved algorithms for finding low-weight polynomial multiples in \(\mathbb F_2[x]\) and some cryptographic applications (Q398976) (← links)
- Computing low-weight discrete logarithms (Q1746959) (← links)
- Low weight discrete logarithm and subset sum in \(2^{0.65n}\) with polynomial memory (Q2055649) (← links)
- A new approach for finding low-weight polynomial multiples (Q2151296) (← links)
- Low-Weight Polynomial Form Integers for Efficient Modular Multiplication (Q4564099) (← links)
- Finding low-weight polynomial multiples using the rho method (Q6103104) (← links)
