A Fast Stream Cipher with Huge State Space and Quasigroup Filter for Software
Recent personal computers have high-spec CPUs and plenty of memory. The motivation of this study is to take these advantages in designing a tough and fast key-stream generator. Natural controversies on using a large state space for a generator are (1) effectiveness is unclear, (2) slower generation speed, (3) expensive initialization, and (4) costs in a hardware implementation.
Our proposal is to combine a linear feedback shift register (LFSR) and a uniform quasigroup filter with memory of wordsize. We prove theorems which assure the period and the distribution property of such generators, answering to (1). As for (2), the generation speed of a LFSR is independent of the state size. In addition, we propose a filter based on integer multiplication, which is rather fast in modern CPUs. We analyze the algebraic degree of such filters. We answer to (3) by a simple trick to use another small generator to initialize LFSR while outputting. We have no answer to (4), but comment that recent hardwares tend to have larger memory and sophisticated instructions.
As a concrete example, we propose CryptMT stream generator with period (no less than) 219937− 1, 1241-dimensional equidistribution property, which is sometimes faster than SNOW2.0 in modern CPUs.
Keywordsstream cipher combined generator filter with memory quasigroup filter multiplicative filter CryptMT eSTREAM period distribution
- 1.Bernstein, D.J.: Cache-timing attack on AES http://cr.yp.to/antiforgery/cachetiming-20050414.pdf
- 2.Bernstein, D.J.: Software timings. http://cr.yp.to/streamciphers/timings.html
- 3.Courtois, N.: Cryptanalysis of Sfinks, http://eprint.iacr.org/2005/243
- 4.Courtois, N.: Fast algebraic attacks on stream ciphers with linear feedback. In: Boneh, D. (ed.) CRYPTO 2003. LNCS, vol. 2729, pp. 176–194. Springer, Heidelberg (2003)Google Scholar
- 5.Ekdahl, P., Johansson, T.: SNOW-a new stream cipher. In: Proceedings of First Open NESSIE Workshop, KU-Leuven (2000)Google Scholar
- 7.eSTREAM – The ECRYPT Stream Cipher Project – Phase 3. http://www.ecrypt.eu.org/stream/index.html
- 8.Golomb, S.: Shift Register Sequences. Aegean Park Press (1982)Google Scholar
- 9.Knuth, D.E.: The Art of Computer Programming. In: Seminumerical Algorithms, 3rd edn., vol. 2, Addison-Wesley, Reading, Mass. (1997)Google Scholar
- 11.Matsumoto, M., Saito, M., Nishimura, T., Hagita, M.: Cryptanalysis of CryptMT: Effect of Huge Prime Period and Multiplicative Filter, http://www.ecrypt.eu.org/stream/cryptmtfubuki.html
- 12.Matsumoto, M., Saito, M., Nishimura, T., Hagita, M.: CryptMT Version 2.0: a large state generator with faster initialization, http://www.ecrypt.eu.org/stream/cryptmtfubuki.html
- 13.Matsumoto, M., Saito, M., Nishimura, T., Hagita, M.: CryptMT Stream Cipher Version 3. eSTREAM stream cipher proposals (submitted), http://www.ecrypt.eu.org/stream/cryptmtp3.html
- 14.Saito, M., Matsumoto, M.: SIMD-oriented Fast Mersenne Twister: a 128-bit Pseudorandom Number Generator. In: The proceedings of MCQMC 2006 (to appear)Google Scholar