Abstract
In this paper method of generating keys for a stream-cipher on the base of non-linear pseudo-noise sequences is presented. The most important task, ensuring suitable security of the cryptographic system, is an appropriate key selection. There exist many key generation systems but they usually posses properties, which do not allow to design a safe system. In the paper, a method of performance analysis of sequences for cryptographic application is shown. To verification of this methods of keys generation is applied by statistical tests DIEHARD and linearity test, proposed by NIST.
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
Dénes J., Keedwell A. D. 1974. ‘Latin Squares and Their Applications’. Akadémiai Kiadó, Budapest.
Gutmann P. 1998. ‘Software Generation of Practically Strong Random Numbers’. Proceedings of the 7 th USENIX Security Symposium.
Jackiewicz M., Kuriata E., Hebisz T. 2003. ‘Safety of Key Generators’. Proceedings off 1 st International Conference on Computer Information Systems and Industrial Management Application CISIM’03., Elk
Jacobson M. T., Matthews P. 1996. ‘Generating Uniformly Distributed Random Latin Squares’. Jornal of Combinatorial Designs, 4(6): pp. 405–137
Kościelny Cz. 1996. ‘A Method of Constructing Quasigroup-Based Stream-Ciphers’. Applied Mathematics and Computer Science, vol. 6: pp. 109–121.
Kościelny Cz. 1997. ‘NLPN sequences over GF(q)’. Applied Mathematics and Computer Science, Quasigroup and Related Systems, vol. 4: pp. 89–102.
Kuriata E. 2001. ‘Teoria informacji i kodowania’. Oficyna Wydawnicza Politechniki Zielonogórskiej
Kutyłowski M., Strothmann W. B. 1998. ‘Kryptografia. Teoria i praktyka zabezpieczania systemów komputerowych’. Oficyna Wydawnicza Read ME, Warszawa.
Lidl R., Niederreiter H. 1986. ‘Introduction to finite fields and their applications’. Cambridhe University Press
McKay B. D., Rogoyski E. 1995. ‘Latin Squares of Order 10’. The Electronic Journal of Combinatorics, vol. 2, no. 3: pp. 1–4
MacWilliams F. J., Sloane N. J. A. 1976. ‘Pseudo-Random Sequences and Arrays’. Proceedings of the IEEE, vol. 64(12): pp. 1715–1729
Marsagha G. Statistical tests DIEHARD. http://stat.fsu.edu/~geo/diehard.html
Menezes A. J., van Oorschot P. C., Vanstone S.~A. 1996. ‘Handbook of Applied Cryptography’. CRCPress
Ritter T. Cryptography home page, http: //www. ciphersbyritter.com
Robling Denning D. E. 1983. ‘Cryptography and Data Security’. Addison-Wesley Publishing Company, Inc
Rukhin A. et al. 2001. ‘A Statistical Test Suite for Random and Pseudorandom Number Generators for Crypographic Applications‘. National Institute of Standards and Technology Special Publication 800–22 (with revisions dated May 15, 2001)
Schneier B. 1994. ‘Applied Cryptography. Protocols, Algorithms, and Source Code in C’. John Wiley & Sons
Shannon C. E. 1949. ‘Communication Theory of Secret Systems’. Bell System Technical Journal, 28(4): pp. 656–715.
Stokłosa J., Bilski T., Pankowski T. 2001. ‘Bezpieczeństwo danych w systemach informatycznych’. Wydawnictwo Naukowe PWN, Warszawa.
Wieczorkowski R., Ziehński R. 1997. ‘Komputerowe generatory liczb losowych’. Wydawnictwa Naukowo-Techniczne, Warszawa.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer Science+Business Media, Inc.
About this paper
Cite this paper
Jackiewicz, M., Kuriata, E. (2005). Analysis of non-linear pseudo-noise sequences. In: Pejaś, J., Piegat, A. (eds) Enhanced Methods in Computer Security, Biometric and Artificial Intelligence Systems. Springer, Boston, MA. https://doi.org/10.1007/0-387-23484-5_9
Download citation
DOI: https://doi.org/10.1007/0-387-23484-5_9
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4020-7776-0
Online ISBN: 978-0-387-23484-7
eBook Packages: Computer ScienceComputer Science (R0)