On the Chor-Rivest knapsack cryptosystem

DOI10.1007/BF00196908MaRDI QIDQ2277428zbMATH OpenOpenAlexFDO

Authors H. 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

discrete logarithms in large finite fieldsknapsack problempowerline systempublic key cryptosystems

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• scientific article; zbMATH DE number 1302850
• On the powerline system
• Cryptanalysis of the Chor-Rivest cryptosystem
• scientific article; zbMATH DE number 3989251
• scientific article; zbMATH DE number 691485

Cites work

• A knapsack-type public key cryptosystem based on arithmetic in finite fields
• Cryptanalysis: a survey of recent results
• scientific article; zbMATH DE number 3803550 (Why is no real title available?)

Cited in

(17)

• 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
• Safer parameters for the Chor-Rivest cryptosystem
• Factorization of a class of composed polynomials
• Balanced integer solutions of linear equations
• scientific article; zbMATH DE number 6622827 (Why is no real title available?)
• Maple Implementation of the Chor-Rivest Cryptosystem
• scientific article; zbMATH DE number 3989251 (Why is no real title available?)
• scientific article; zbMATH DE number 1302850 (Why is no real title available?)
• Factoring polynomials over finite fields: A survey
• Equal-degree factorization of binomials and trinomials over finite fields
• The 3-sparsity of X^n-1 over finite fields of characteristic 2
• On algorithms to find \(p\)-ordering

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2277428)