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)
knapsack problem; public key cryptosystems; discrete logarithms in large finite fields; powerline system
94A60: Cryptography
Related Items
Factoring polynomials over finite fields: A survey, Univariate polynomial factorization over finite fields, Factoring polynomials of the form \(f(x^n) \in \mathbb{F}_q [x\)], Balanced Integer Solutions of Linear Equations
Cites Work