Fausto Montoya Vitini

Trident, a New Pseudo Random Number Generator Based on Coupled Chaotic Maps

This article describes a new family of cryptographically secure pseudorandom number generators, based on coupled chaotic maps, that will serve as keystream in a stream cipher. The maps are a modification of a piecewise linear map, by dynamic changing of the coefficient values and perturbing its lesser significant bits.

Maximal Periods of x + c in Fq

The orbits produced by the iterations of the mapping x ? x2 + c, defined over Fq, are studied. Several upper bounds for their periods are obtained, depending on the coefficient c and the number of elements q.

A Lightweight Pseudorandom Number Generator for Securing the Internet of Things

Lightweight cryptography aims to address the security demands in resource-constrained hardware and software environments, such as the Internet of Things (IoT). These constraints severely limit solutions offered by conventional cryptographic primitives, which turn too expensive to achieve. In this paper, a lightweight pseudorandom number generator that fits the IoT demands is presented. It has a good performance on Atmel 8-bit AVR and Intel Curie 32-bit microcontrollers. The analysis of the hardware complexity in terms of gate equivalent confirms that it is suitable for the IoT.

Classes of Nonlinear Filters for Stream Ciphers

Long period, good statistical properties and large linear complexity are necessary conditions that every cryptographic sequence must satisfy. In this work, an algebraic method to compute classes of nonlinear filters with large linear complexity has been proposed. Two filter operations (addition and shifting operations) are performed to give rise to a complete class of nonlinear filters adequate for cryptographic purposes. The procedure here developed is simple, efficient and can be carried out at the price of minimal computational operations. Different filter representations have been systematically addressed.