Pages that link to "Item:Q3816016"
From MaRDI portal
The following pages link to A knapsack-type public key cryptosystem based on arithmetic in finite fields (Q3816016):
Displayed 13 items.
- A short proof for explicit formulas for discrete logarithms in finite fields (Q802668) (← links)
- Chosen ciphertext attacks on lattice-based public key encryption and modern (non-quantum) cryptography in a quantum environment (Q857394) (← links)
- Univariate polynomial factorization over finite fields (Q1127311) (← links)
- Improved low-density subset sum algorithms (Q1207335) (← links)
- Lattice basis reduction: Improved practical algorithms and solving subset sum problems (Q1340057) (← links)
- Recurrent methods for constructing irreducible polynomials over \(\mathbb F_{q}\) of odd characteristics. (Q1867478) (← links)
- On the Chor-Rivest knapsack cryptosystem (Q2277428) (← links)
- Low-density attack revisited (Q2384011) (← links)
- A knapsack-based probabilistic encryption scheme (Q2384519) (← links)
- Efficient Finite Fields in the Maxima Computer Algebra System (Q3519552) (← links)
- An efficient multi-round anonymous auction protocol (Q5446259) (← links)
- Factoring polynomials over finite fields: A survey (Q5928877) (← links)
- Non-injective knapsack public-key cryptosystems (Q5941079) (← links)