Borislav Stoyanov
Borislav Bedzhev
Svetlana Vasileva
ABSTRACT
The paper describes the software application of a scheme of stream cipher named N-adic Summation-Shrinking Generator (NSumSG). The statistic testing proves the pseudo-randomness of the output bits of the NSumSG and applicability of the NSumSG as a real stream cipher.
- Bedzhev, B., Zh. Tasheva, B. Stoyanov, Summation -- Shrinking Generator, International Conference "Information Technologies and Security" (ITS -- 2004), 22--26 June 2004, Partenit, Crimea, Ukraine, pp.119--127.Google Scholar
- Klapper, A., M. Goresky, "2-adic Shift Register. Fast Software Encryption", Second International Workshop. (Lecture Notes in Computer Science, vol. 950, Springer Verlag, N. Y., 1994.) pp.174--178 Google ScholarDigital Library
- Menezes, A., P. van Oorshot, S. Vastone, Handbook of Applied Cryptography, CRC Press, 1996, www.cacr.math.uwaterloo.ca/hac/. Google ScholarDigital Library
- Rukhin, A., J. Soto, J. Nechvatal, M. Smid, E. Barker, S. Leigh, M. Levenson, M. Vangel, D. Banks, A. Heckert, J. Dray, S. Vo, "A Statistical Test Suite for Random and Pseudo-Random Number Generators for Cryptographic Application", NIST Special Publication 800--22 (with revision May 15, 2001), http://csrc.nist.gov/rng/.Google Scholar
- Seo, Ch., S. Lee, Y. Sung, K. Han, S. Kim, "A Lower Bound on the Linear Span an FCSR", IEEE Transaction on Information Theory, Vol. 46, No 2, March 2000. Google ScholarDigital Library
- Stoyanov, B., B. Bedzhev, Zh. Zhekov, Computation Model of p-adic Arithmetic, XXXIX International Scientific Conference on Information, Communication and Energy Systems and Technologies, ICEST 2004, 16--19 June 2004, Bitola, Macedonia, pp.341--344.Google Scholar
- Tasheva, Zh., B. Bedzhev, B. Stoyanov, N-adic Summation-Shrinking Generator. Basic properties and empirical evidence, http://eprint.iacr.org, 2005/068/.Google Scholar
- Xu, J., Stream Cipher Analysis Based on FCSRs, PhD Dissertation, University of Kentucky, 2000, http://www.cs.engr.uky.edu/etd/theses/uky-cocs-2000-d-002/. Google ScholarDigital Library
Recommendations
Simple extractors for all min-entropies and a new pseudorandom generator
A “randomness extractor” is an algorithm that given a sample from a distribution with sufficiently high min-entropy and a short random seed produces an output that is statistically indistinguishable from uniform. (Min-entropy is a measure of the amount ...
Modified self-shrinking generator
The self-shrinking generator SSG, an elegant keystream generator proposed by Meier and Staffelbach, is built up from a single n-stage primitive linear feedback shift register (LFSR) to produce a keystream of period P>=2^n^2, and linear complexity ...
A Pseudorandom Generator from any One-way Function
Pseudorandom generators are fundamental to many theoretical and applied aspects of computing. We show how to construct a pseudorandom generator from any one-way function. Since it is easy to construct a one-way function from a pseudorandom generator, ...
Comments