activity
20102026
most citedOn the Use of Cellular Automata in Symmetric Cryptography

28 citations · 217 across the 44 of their papers we have counts for

collaborators
Showing 2010Show all

14 papers · 1 filter

cs.CR2010★ 1 cited

Using Linear Difference Equations to Model Nonlinear Cryptographic Sequences

P. Caballero-Gil, A. Fúster-Sabater, M. E. Pazo-Robles

A new class of linear sequence generators based on cellular automata is here introduced in order to model several nonlinear keystream generators with practical applications in symm…

cs.CR2010

Self-Organized Authentication Architecture for Mobile Ad-hoc Networks

P. Caballero-Gil, C. Caballero-Gil, J. Molina-Gil +1

This work proposes a new architecture, called Global Authentication Scheme for Mobile Ad-hoc Networks (GASMAN), for fully distributed and self-organized authentication. In this pap…

cs.CR2010★ 10 cited

Flexible Authentication in Vehicular Ad hoc Networks

P. Caballero-Gil, C. Caballero-Gil, J. Molina-Gil +1

A Vehicular Ad-Hoc Network (VANET) is a form of Mobile ad-hoc network, to provide communications among nearby vehicles and between vehicles and nearby fixed roadside equipment. The…

cs.CR2010★ 13 cited

Stimulating Cooperation in Self-Organized Vehicular Networks

P. Caballero-Gil, J. Molina-Gil, C. Hernández-Goya +1

A Vehicular Ad-hoc NETwork (VANET) is a special form of Mobile Ad-hoc Network designed to provide communications among nearby vehicles and between vehicles and nearby fixed roadsid…

cs.CR2010★ 28 cited

On the Use of Cellular Automata in Symmetric Cryptography

Amparo Fuster-Sabater, Pino Caballero-Gil

In this work, pseudorandom sequence generators based on finite fields have been analyzed from the point of view of their cryptographic application. In fact, a class of nonlinear se…

cs.CR2010

Self-Organized Authentication in Mobile Ad-hoc Networks

P. Caballero-Gil, C. Hernández-Goya

This work proposes a new distributed and self-organized authentication scheme for Mobile Ad-hoc NETworks (MANETs). Apart from describing all its components, special emphasis is pla…

cs.CR2010★ 4 cited

A Simple Attack on Some Clock-Controlled Generators

P. Caballero-Gil, A. Fúster-Sabater

We present a new approach to edit distance attacks on certain clock-controlled generators, which applies basic concepts of Graph Theory to simplify the search trees of the original…

cs.CR2010★ 3 cited

New Attack Strategy for the Shrinking Generator

Pino Caballero-Gil, Amparo Fúster-Sabater, M. Eugenia Pazo-Robles

This work shows that the cryptanalysis of the shrinking generator requires fewer intercepted bits than what indicated by the linear complexity. Indeed, whereas the linear complexit…

cs.CR2010★ 1 cited

Linear Cellular Automata as Discrete Models for Generating Cryptographic Sequences

Pino Caballero-Gil, Amparo Fúster-Sabater, Oscar Delgado-Mohatar

In this paper, we develop a new cellular automata-based linear model for several nonlinear pseudorandom number generators with practical applications in symmetric cryptography. Suc…

cs.CR2010★ 6 cited

A Rational Approach to Cryptographic Protocols

P. Caballero-Gil, C. Hernández-Goya, C. Bruno-Castañeda

This work initiates an analysis of several cryptographic protocols from a rational point of view using a game-theoretical approach, which allows us to represent not only the protoc…

cs.CR2010★ 24 cited

Linear solutions for cryptographic nonlinear sequence generators

A. Fúster-Sabater, P. Caballero-Gil

This letter shows that linear Cellular Automata based on rules 90/150 generate all the solutions of linear difference equations with binary constant coefficients. Some of these sol…

cs.CR2010

On the Design of Cryptographic Primitives

Pino Caballero-Gil, Amparo Fúster-Sabater

The main objective of this work is twofold. On the one hand, it gives a brief overview of the area of two-party cryptographic protocols. On the other hand, it proposes new schemes…

cs.CR2010

Secret Sharing Based on a Hard-on-Average Problem

P. Caballero-Gil, C. Hernández-Goya

The main goal of this work is to propose the design of secret sharing schemes based on hard-on-average problems. It includes the description of a new multiparty protocol whose main…

cs.CR2010

Global Linear Complexity Analysis of Filter Keystream Generators

A. Fúster-Sabater, P. Caballero-Gil

An efficient algorithm for computing lower bounds on the global linear complexity of nonlinearly filtered PN-sequences is presented. The technique here developed is based exclusive…