Cryptology ePrint Archive: Report 2005/068
N-adic Summation-Shrinking Generator. Basic properties and empirical evidences.
Zhaneta Tasheva and Borislav Bedzhev and Borislav Stoyanov
Abstract: The need of software-flexible stream ciphers has led to several alternative proposals in the last few years. One of them is a new Pseudo Random Number Generator (PRNG), named N-adic Summation-Shrinking (NSumSG), which architecture is described in this paper. It uses N-1 parallel working slave summation generators and one N-adic summation generator, controlling the nonlinearity in the generator. The implementation, some properties and statistical tests of NSumSG are given.
The results from statistical analysis show that the sequence generated by NSumSG is uniform, scalable, uncompressible, whit large period; consistent and unpredictable. This gives the reason consider the NSumSG as suitable for a particular cryptographic application.
Category / Keywords: secret-key cryptography / stream ciphers, pseudo-randomness
Date: received 1 Mar 2005
Contact author: tashevi86 at yahoo com
Available format(s): Postscript (PS) | Compressed Postscript (PS.GZ) | PDF | BibTeX Citation
Version: 20050302:195528 (All versions of this report)
Short URL: ia.cr/2005/068
Discussion forum: Show discussion | Start new discussion
[ Cryptology ePrint archive ]