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):
Displaying 11 items.
- A general construction for monoid-based knapsack protocols (Q476358) (← links)
- Search of primitive polynomials over finite fields (Q749611) (← links)
- A short proof for explicit formulas for discrete logarithms in finite fields (Q802668) (← links)
- On algorithms to find \(p\)-ordering (Q831740) (← links)
- Low complexity normal bases (Q923627) (← links)
- Low weight discrete logarithm and subset sum in \(2^{0.65n}\) with polynomial memory (Q2055649) (← links)
- On a knapsack based cryptosystem using real quadratic and cubic fields (Q2843140) (← links)
- Improvement of key generation for a number field based knapsack cryptosystem (Q3121200) (← links)
- New Definition of Density on Knapsack Cryptosystems (Q3506377) (← links)
- A verification of brickell's fast modular multiplication algorithm (Q4009756) (← links)
- ABOUT THE CONP-COMPLETE “INJECTIVE KNAPSACK” PROBLEM (Q5150749) (← links)
