Analysis of the efficiency of the Chor-Rivest cryptosystem implementation in a safe-parameter range

Authors:
L. Hernández Encinas;J. Muñoz Masqué;A. Queiruga Dios
Affiliations:
Department of Information Processing and Coding, Applied Physics Institute (IFA), Spanish National Research Council (CSIC), C/Serrano 144, 28006 Madrid, Spain;Department of Information Processing and Coding, Applied Physics Institute (IFA), Spanish National Research Council (CSIC), C/Serrano 144, 28006 Madrid, Spain;Department of Applied Mathematics, ETSII, University of Salamanca, Avda. Fernández Ballesteros 2, 37700 Béjar, Salamanca, Spain
Venue:
Information Sciences: an International Journal
Year:
2009

Citing 14
Cited 0

Solving low-density subset sum problems

Journal of the ACM (JACM)
Breaking iterated knapsacks

Proceedings of CRYPTO 84 on Advances in cryptology
Improved low-density subset sum algorithms

Computational Complexity
An Introduction to Cryptography

An Introduction to Cryptography
Handbook of Applied Cryptography

Handbook of Applied Cryptography
Discrete Logarithms: The Effectiveness of the Index Calculus Method

ANTS-II Proceedings of the Second International Symposium on Algorithmic Number Theory
Improvements to the general number field sieve for discrete logarithms in prime fields: a comparison with the Gaussian integer method

Mathematics of Computation
Low-density attack revisited

Designs, Codes and Cryptography
A knapsack-based probabilistic encryption scheme

Information Sciences: an International Journal
Safer parameters for the Chor-Rivest cryptosystem

Computers & Mathematics with Applications
Cryptanalysis of a knapsack-based probabilistic encryption scheme

Information Sciences: an International Journal
The number field sieve in the medium prime case

CRYPTO'06 Proceedings of the 26th annual international conference on Advances in Cryptology
Maple implementation of the chor-rivest cryptosystem

ICCS'06 Proceedings of the 6th international conference on Computational Science - Volume Part II
An improved algorithm for computing logarithms over and its cryptographic significance (Corresp.)

IEEE Transactions on Information Theory

Quantified Score

Hi-index	0.07

Visualization

Abstract

The Chor-Rivest cryptosystem, based on a high-density knapsack problem on a finite field F"q"^"h, was broken by Vaudenay for q~200,h~24, and h admitting a factor s verifying a certain condition. A new set of parameters q and h, which prevent this cryptosystem against Vaudenay's attack, is presented and the computational aspects of its implementation in the Magma computational algebra system are analyzed.