CryptoDB
N-adic Summation-Shrinking Generator. Basic properties and empirical evidences
Authors: | |
---|---|
Download: | |
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. |
BibTeX
@misc{eprint-2005-12405, title={N-adic Summation-Shrinking Generator. Basic properties and empirical evidences}, booktitle={IACR Eprint archive}, keywords={secret-key cryptography / stream ciphers, pseudo-randomness}, url={http://eprint.iacr.org/2005/068}, note={ tashevi86@yahoo.com 12843 received 1 Mar 2005}, author={Zhaneta Tasheva and Borislav Bedzhev and Borislav Stoyanov}, year=2005 }