Word-Based FCSRs with Fast Software Implementations

  • Lee, Dong-Hoon (Electronics and Telecommunications Research Institute) ;
  • Park, Sang-Woo (Electronics and Telecommunications Research Institute)
  • Received : 2009.06.10
  • Accepted : 2010.08.13
  • Published : 2011.02.28

Abstract

Feedback with carry shift registers (FCSRs) over 2-adic number would be suitable in hardware implementation, but the are not efficient in software implementation since their basic unit (the size of register clls) is 1-bit. In order to improve the efficiency we consider FCSRs over $2^{\ell}$-adic number (i.e., FCSRs with register cells of size ${\ell}$-bit) that produce ${\ell}$ bits at every clocking where ${\ell}$ will be taken as the size of normal words in modern CPUs (e.g., ${\ell}$ = 32). But, it is difficult to deal with the carry that happens when the size of summation results exceeds that of normal words. We may use long variables (declared with 'unsigned _int64' or 'unsigned long long') or conditional operators (such as 'if' statement) to handle the carry, but both the arithmetic operators over long variables and the conditional operators are not efficient comparing with simple arithmetic operators (such as shifts, maskings, xors, modular additions, etc.) over variables of size ${\ell}$-hit. In this paper, we propose some conditions for FCSRs over $2^{\ell}$-adic number which admit fast software implementations using only simple operators. Moreover, we give two implementation examples for the FCSRs. Our simulation result shows that the proposed methods are twice more efficient than usual methods using conditional operators.

Keywords

References

  1. F. Armknecht, "Improving fast algebraic attacks," in Proc. FSE, LNCS 3017, Springer-Verlag, 2004, pp. 65-82.
  2. F. Armknecht and M. Krause, "Algebraic attacks on combiners with memory," in Proc. Advances in Cryptology-Crypto, LNCS 2729, Springer-Verlag, 2003, pp. 162-175.
  3. N. Courtois and W. Meier, "Algebraic attacks on stream ciphers with linear feedback," in Proc. Advances in Cryptology-Eurocrypt, LNCS 2656, Springer-Verlag, 2003, pp. 345-359.
  4. A. Klapper and M. Goresky, "2-adic shift registers," in Proc. FSE, LNCS 809, Springer-Verlag, 1994, pp. 174-178.
  5. A. Klapper and M. Goresky, "Feedback shift registers, 2-adic span, and combiners with memory," J. Cryptology, vol. 10, pp. 111-147, 1997. https://doi.org/10.1007/s001459900024
  6. A. Klapper and M. Goresky, "Feedback registers based on ramified extensions of the 2-adic numbers," in Proc. Advances in Cryptology-Eurocrypt, LNCS 950, Springer-Verlag, 1995, pp. 215-222.
  7. A. Klapper, "Feedback with carry shift registers over finite fields," in Proc. FSE, LNCS 1008, 1995, pp. 170-178.
  8. M. Goresky and A. Klapper, "Efficient multiply-with-carry random number generators with maximal period," ACM Trans. Modeling and Computer Simulation, vol. 13, pp. 310-321, Oct. 2003. https://doi.org/10.1145/945511.945514
  9. G. Marsaglia and A. Zaman, "A new class of random number generators," Annals Appli. Probability, vol. 1, pp. 462-480, 1991. https://doi.org/10.1214/aoap/1177005878