Abstract
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.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Klein, A.: Attacks on the RC4 stream cipher. Design. Code. Cryptogr. 48(3), 269–286 (2008)
Goldberg, I., Wagner, I.: Randomness and the Netscape browser. Dr. Dobb’s Journal, 66–70 (1996)
Gutterman, Z., Pinkas, B., Reinman, T.: Analysis of the Linux Random Number Generator. In: Proceedings of the 2006 IEEE Symposium on Security and Privacy, pp. 371–385 (2006)
Dorrendorf, L., Gutterman, Z., Pinkas, B.: Cryptanalysis of the random number generator of the Windows operating system. ACM T. Inform. System 13(1), 10:1–10:32 (2009)
Blum, L., Blum, M., Shub, M.: A simple unpredictable pseudo-random number generator. SIAM J. Comput. 15, 364–383 (1986)
Alvarez, G., Montoya, F., Romera, M., Pastor, G.: Cryptanalysis of a chaotic encryption system. Phys. Lett. A 276(1-4), 191–196 (2000)
Alvarez, G., Li, S.: Some basic cryptographic requirements for chaos-based cryptosystems. Int. J. Bifurcat. Chaos 16(8), 2129–2151 (2006)
Orue, A.B., et al.: Determination of the parameters for a Lorenz system and application to break the security of two-channel chaotic cryptosystems. Phys. Lett. A 372, 5588–5592 (2008)
Knuth, D.E.: The Art of Computer Programming, 3rd edn. Seminumerical Algorithms, vol. 2. Addison-Wesley, Reading (1997)
Bellare, M., Goldwasser, S., Micciancio, D.: Pseudo-random number generation within cryptographic algorithms: The dds case. In: Kaliski Jr., B.S. (ed.) CRYPTO 1997. LNCS, vol. 1294, pp. 277–291. Springer, Heidelberg (1997)
Rukhin, A., et al.: A Statistical Test Suite for Random and Pseudorandom Number Generators for Cryptographic Applications revision, 1st edn. National Institute of Standards and Technology (NIST), U.S. Department of Commerce (2008)
Marsaglia, G., Tsang, W.W.: Some difficult-to-pass tests of randomness. J. Stat. Softw. 7(3), 1–9 (2002)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
López, A.B.O., Marañon, G.Á., Estévez, A.G., Dégano, G.P., García, M.R., Vitini, F.M. (2010). Trident, a New Pseudo Random Number Generator Based on Coupled Chaotic Maps. In: Herrero, Á., Corchado, E., Redondo, C., Alonso, Á. (eds) Computational Intelligence in Security for Information Systems 2010. Advances in Intelligent and Soft Computing, vol 85. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-16626-6_20
Download citation
DOI: https://doi.org/10.1007/978-3-642-16626-6_20
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-16625-9
Online ISBN: 978-3-642-16626-6
eBook Packages: EngineeringEngineering (R0)