Pages that link to "Item:Q3689091"
From MaRDI portal
The following pages link to A Knapsack Type Public Key Cryptosystem Based On Arithmetic in Finite Fields (preliminary draft) (Q3689091):
Displayed 5 items.
- Search of primitive polynomials over finite fields (Q749611) (← links)
- A short proof for explicit formulas for discrete logarithms in finite fields (Q802668) (← links)
- Low complexity normal bases (Q923627) (← links)
- New Definition of Density on Knapsack Cryptosystems (Q3506377) (← links)
- A verification of brickell's fast modular multiplication algorithm (Q4009756) (← links)
