Safer parameters for the Chor-Rivest cryptosystem

Authors:
L. Hernández Encinas;J. Muñoz Masqué;A. Queiruga Dios
Affiliations:
Department of Information Processing and Coding, Applied Physics Institute, CSIC, C/ Serrano 144, 28006-Madrid, Spain;Department of Information Processing and Coding, Applied Physics Institute, CSIC, C/ Serrano 144, 28006-Madrid, Spain;Department of Applied Mathematics, E.T.S.I.I., University of Salamanca, Avda. Fernández Ballesteros 2, 37700-Béjar, Salamanca, Spain
Venue:
Computers & Mathematics with Applications
Year:
2008

Citing 7
Cited 1

Solving low-density subset sum problems

Journal of the ACM (JACM)
Two issues in public key cryptography: RSA bit security and a new knapsack type system

Two issues in public key cryptography: RSA bit security and a new knapsack type system
On the Lagarias-Odlyzko algorithm for the subset sum problem

SIAM Journal on Computing
A course in number theory and cryptography

A course in number theory and cryptography
Improved low-density subset sum algorithms

Computational Complexity
Algorithmic number theory

Algorithmic number theory
Handbook of Applied Cryptography

Handbook of Applied Cryptography

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

Information Sciences: an International Journal

Quantified Score

Hi-index	0.09

Visualization

Abstract

Vaudenay's cryptanalysis against Chor-Rivest cryptosystem is applicable when the parameters, p and h, originally proposed by the authors are used. Nevertheless, if p and h are both prime integers, then Vaudenay's attack is not applicable. In this work, a choice of these parameters resistant to the existing cryptanalytic attacks, is presented. The parameters are determined in a suitable range guaranteeing its security and the computational feasibility of implementation. Regrettably, the obtained parameters are scarce in practice.