On the Chor-Rivest knapsack cryptosystem
From MaRDI portal
Publication:2277428
DOI10.1007/BF00196908zbMath0725.94003MaRDI QIDQ2277428
Publication date: 1991
Published in: Journal of Cryptology (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf00196908
knapsack problem; public key cryptosystems; discrete logarithms in large finite fields; powerline system
94A60: Cryptography
Related Items
Factoring polynomials over finite fields: A survey, On algorithms to find \(p\)-ordering, Univariate polynomial factorization over finite fields, Factoring polynomials of the form \(f(x^n) \in \mathbb{F}_q [x\)], Polynomial time bounded distance decoding near Minkowski's bound in discrete logarithm lattices, On polynomials \(x^n-1\) over binary fields whose irreducible factors are binomials and trinomials, On the lattice isomorphism problem, quadratic forms, remarkable lattices, and cryptography, Factorization of composed polynomials and applications, Factorization of a class of composed polynomials, Balanced Integer Solutions of Linear Equations
Cites Work