On the Chor-Rivest knapsack cryptosystem

DOI10.1007/BF00196908zbMath0725.94003OpenAlexW2028838608MaRDI QIDQ2277428

Hendrik W. jun. Lenstra

Publication date: 1991

Published in: Journal of Cryptology (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf00196908

zbMATH Keywords

knapsack problempublic key cryptosystemsdiscrete logarithms in large finite fieldspowerline system

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (10)

On algorithms to find \(p\)-ordering ⋮ Balanced Integer Solutions of Linear Equations ⋮ On the lattice isomorphism problem, quadratic forms, remarkable lattices, and cryptography ⋮ Univariate polynomial factorization over finite fields ⋮ Factoring polynomials of the form \(f(x^n) \in \mathbb{F}_q [x\)] ⋮ Factorization of a class of composed polynomials ⋮ Polynomial time bounded distance decoding near Minkowski's bound in discrete logarithm lattices ⋮ Factoring polynomials over finite fields: A survey ⋮ On polynomials \(x^n-1\) over binary fields whose irreducible factors are binomials and trinomials ⋮ Factorization of composed polynomials and applications

Cites Work

• Unnamed Item
• A knapsack-type public key cryptosystem based on arithmetic in finite fields
• Cryptanalysis: a survey of recent results

This page was built for publication: On the Chor-Rivest knapsack cryptosystem