N-adic Summation-Shrinking Generator. Basic properties and empirical evidences.

Zhaneta Tasheva; Borislav Bedzhev; Borislav Stoyanov

Paper 2005/068 Original: eprint.iacr.org/2005/068 ↗

N-adic Summation-Shrinking Generator. Basic properties and empirical evidences.

Zhaneta Tasheva

Borislav Bedzhev

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.

Metadata

Available format(s): PDF
Category: Secret-key cryptography
Publication info: Preprint.
History: 2005-03-02: last updated; 2005-03-02: published
Short URL: https://ia.cr/2005/068
License: https://creativecommons.org/licenses/by/4.0/

BibTeX

@misc{cryptoeprint:2005/068,
      author = {Zhaneta Tasheva and Borislav Bedzhev and Borislav Stoyanov},
      title = {N-adic Summation-Shrinking Generator. Basic properties and empirical evidences.},
      howpublished = {Cryptology {ePrint} Archive, Paper 2005/068},
      year = {2005},
      url = {https://eprint.iacr.org/2005/068}
}