A knapsack-type public key cryptosystem based on arithmetic in finite fields
From MaRDI portal
Publication:3816016
DOI10.1109/18.21214zbMath0664.94011OpenAlexW2142247058MaRDI 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
Related Items
Lattice basis reduction: Improved practical algorithms and solving subset sum problems, Factors of low individual degree polynomials, Solving 0 - 1 knapsack problem by artificial chemical reaction optimization algorithm with a greedy strategy, Low-density attack revisited, A knapsack-based probabilistic encryption scheme, Chosen ciphertext attacks on lattice-based public key encryption and modern (non-quantum) cryptography in a quantum environment, Safer parameters for the Chor-Rivest cryptosystem, On the lattice isomorphism problem, quadratic forms, remarkable lattices, and cryptography, Binary accelerated particle swarm algorithm (BAPSA) for discrete optimization problems, Univariate polynomial factorization over finite fields, Unnamed Item, Irreducible compositions of polynomials over finite fields of even characteristic, Improved broadcast attacks against subset sum problems via lattice oracle, Characterization of irreducible polynomials over a special principal ideal ring, Efficient Finite Fields in the Maxima Computer Algebra System, Preimage selective trapdoor function: how to repair an easy problem, Polynomial time bounded distance decoding near Minkowski's bound in discrete logarithm lattices, Factoring polynomials over finite fields: A survey, Improved low-density subset sum algorithms, Non-injective knapsack public-key cryptosystems, Quadratic compact knapsack public-key cryptosystem, On the Chor-Rivest knapsack cryptosystem, The multiple multidimensional knapsack with family-split penalties, An efficient multi-round anonymous auction protocol, A short proof for explicit formulas for discrete logarithms in finite fields, High generalization performance structured self-attention model for knapsack problem, Recurrent methods for constructing irreducible polynomials over \(\mathbb F_{q}\) of odd characteristics.
