A knapsack-type public key cryptosystem based on arithmetic in finite fields
From MaRDI portal
Publication:3816016
DOI10.1109/18.21214zbMath0664.94011MaRDI QIDQ3816016
Publication date: 1989
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/18.21214
94A60: Cryptography
Related Items
An efficient multi-round anonymous auction protocol, Factoring polynomials over finite fields: A survey, Non-injective knapsack public-key cryptosystems, A short proof for explicit formulas for discrete logarithms in finite fields, Chosen ciphertext attacks on lattice-based public key encryption and modern (non-quantum) cryptography in a quantum environment, Quadratic compact knapsack public-key cryptosystem, Univariate polynomial factorization over finite fields, Improved low-density subset sum algorithms, Lattice basis reduction: Improved practical algorithms and solving subset sum problems, Recurrent methods for constructing irreducible polynomials over \(\mathbb F_{q}\) of odd characteristics., On the Chor-Rivest knapsack cryptosystem, Low-density attack revisited, A knapsack-based probabilistic encryption scheme, Safer parameters for the Chor-Rivest cryptosystem, Efficient Finite Fields in the Maxima Computer Algebra System