A Knapsack Type Public Key Cryptosystem Based On Arithmetic in Finite Fields (preliminary draft)

DOI10.1007/3-540-39568-7_6zbMath0571.94013OpenAlexW1512282321MaRDI QIDQ3689091

Ronald L. Rivest, Benny Chor

Publication date: 1985

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

Full work available at URL: https://doi.org/10.1007/3-540-39568-7_6

zbMATH Keywords

arithmetic in finite fieldsknapsack type public key cryptosystem

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Cryptography (94A60)

Related Items (8)

On algorithms to find \(p\)-ordering ⋮ A verification of brickell's fast modular multiplication algorithm ⋮ New Definition of Density on Knapsack Cryptosystems ⋮ Low complexity normal bases ⋮ ABOUT THE CONP-COMPLETE “INJECTIVE KNAPSACK” PROBLEM ⋮ Search of primitive polynomials over finite fields ⋮ Low weight discrete logarithm and subset sum in \(2^{0.65n}\) with polynomial memory ⋮ A short proof for explicit formulas for discrete logarithms in finite fields

This page was built for publication: A Knapsack Type Public Key Cryptosystem Based On Arithmetic in Finite Fields (preliminary draft)