Pages that link to "Item:Q1168369"
From MaRDI portal
The following pages link to On computing logarithms over GF(2**p) (Q1168369):
Displaying 4 items.
- Analysis of the Herlestam and Johannesson discrete logarithm scheme in \(GF(2^ N)\) for large N (Q1059674) (← links)
- Probabilistic Analysis and Performance Modelling of the ‘Swedish’ Algorithm and Modifications (Q5019337) (← links)
- Improving the Security of Exponential Key Exchange (Q5019342) (← links)
- A polynomial representation for logarithms in GF(q) (Q5187374) (← links)