Breaking Littlewood's Cipher - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Article Dans Une Revue Cryptologia Année : 2004

Breaking Littlewood's Cipher

Résumé

In 1953, the celebrated mathematician John Edensor Littlewood proposed a stream cipher based on logarithm tables. Fifty years later, we propose the first analysis of his scheme. Littlewood suggests the idea of using real functions as tools to build cryptographic primitives. Even when considering modern security parameters, the original scheme can be broken by a simple attack based on differentiation. We generalise the scheme such that it resists this attack based on differentiation. We generalise the scheme such that it resists this attacks, but describe another attack which is derived from both polynomial approximation and Coppersmith's technique to find the small roots of modular multivariate polynomials. In contrast with these negative results we describe a candidate for a very efficient one-way function and present an open problem based on this work.
Fichier non déposé

Dates et versions

inria-00100174 , version 1 (26-09-2006)

Identifiants

  • HAL Id : inria-00100174 , version 1

Citer

Damien Stehlé. Breaking Littlewood's Cipher. Cryptologia, 2004, XXVIII (4), 17 p. ⟨inria-00100174⟩
43 Consultations
0 Téléchargements

Partager

Gmail Facebook X LinkedIn More