Safer parameters for the Chor-Rivest cryptosystem

DOI10.1016/j.camwa.2008.09.006zbMath1165.94320OpenAlexW1996346322MaRDI QIDQ2389473

Yanyan Li

Publication date: 17 July 2009

Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.camwa.2008.09.006

zbMATH Keywords

finite fieldsChor-Rivest cryptosystemcryptanalysispublic key cryptographyprime parameters

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (1)

Preimage selective trapdoor function: how to repair an easy problem

Cites Work

• Improved low-density subset sum algorithms
• On the Lagarias-Odlyzko Algorithm for the Subset Sum Problem
• Solving low-density subset sum problems
• A knapsack-type public key cryptosystem based on arithmetic in finite fields
• Extension of Brickell’S Algorithm for Breaking High Density Knapsacks
• Solving Low Density Knapsacks
• Cryptanalysis of the Chor-Rivest cryptosystem
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Safer parameters for the Chor-Rivest cryptosystem