Application of LFSRs for Parallel Sequence Generation in Cryptologic Algorithms

  • Sourav Mukhopadhyay
  • Palash Sarkar
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3982)


We consider the problem of efficiently generating sequences in hardware for use in certain cryptographic algorithms. The conventional method of doing this is to use a counter. We show that sequences generated by linear feedback shift registers (LFSRs) can be tailored to suit the appropriate algorithms. For hardware implementation, this reduces both time and chip area. As a result, we are able to suggest improvements to the design of DES Cracker built by the Electronic Frontier Foundation in 1998; provide an efficient strategy for generating start points in time-memory trade/off attacks; and present an improved parallel hardware implementation of a variant of the counter mode of operation of a block cipher.


DES Cracker TMTO Counter Mode of Operation LFSR 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Electronics Frontier Foundation, Cracking DES, O’Reilly and Associates (1998)Google Scholar
  2. 2.
    Bernstein, D.J.: Salsa20 specification, ecrypt submission (2005),
  3. 3.
    Burman, S., Sarkar, P.: An Efficient Algorithm for Software Generation of Binary Linear Recurrences. Appl. Algebra Eng. Commun. Comput. 15(3-4), 201–203 (2004)zbMATHCrossRefMathSciNetGoogle Scholar
  4. 4.
    Diffie, W., Hellman, M.: Privacy and Authentication: An Introduction to Cryptography. Proceedings of the IEEE 67, 397–427 (1979)CrossRefGoogle Scholar
  5. 5.
    Hellman, M.: A cryptanalytic Time-Memory Trade-off. IEEE Transactions on Information Theory 26, 401–406 (1980)zbMATHCrossRefMathSciNetGoogle Scholar
  6. 6.
    Lidl, R., Niederreriter, H.: Introduction to Finite Fields and their applications, pp. 189–249. Cambridge University Press, Cambridge (1994) (revised edition)zbMATHGoogle Scholar
  7. 7.
    Menezes, A.J., van Oorschot, P.C., Vanstone, S.A.: Handbook of Applied Cryptography, pp. 195–201. CRC, Boca Raton (2001)Google Scholar
  8. 8.
    Mentens, N., Batina, L., Preneel, B., Verbauwhede, I.: Cracking Unix passwords using FPGA platforms. Presented at SHARCS 2005 (2005)Google Scholar
  9. 9.
    Mukhopadhyay, S., Sarkar, P.: Application of LFSRs in Time/Memory Trade-Off Cryptanalysis. In: Song, J.-S., Kwon, T., Yung, M. (eds.) WISA 2005. LNCS, vol. 3786, pp. 25–37. Springer, Heidelberg (2006)CrossRefGoogle Scholar
  10. 10.
    Mukhopadhyay, S., Sarkar, P.: Application of LFSRs for Parallel Sequence Generation in Cryptologic Algorithms, Cryptology ePrint Technical report 2006/042 (February 6, 2006),
  11. 11.
    Oechslin, P.: Making a faster cryptanalytic time-memory trade-off. In: Boneh, D. (ed.) CRYPTO 2003. LNCS, vol. 2729, pp. 617–630. Springer, Heidelberg (2003)CrossRefGoogle Scholar
  12. 12.
    Quisquater, J.J., Standaert, F.X.: Exhaustive Key Search of the DES: Updates and Refinements. Presented at SHARCS 2005 (2005)Google Scholar
  13. 13.
    Wiener, M.J.: Efficient DES Key Search. In: Stallings, W. (ed.) presented at the rump session of CRYTO 1993, reprented in Practical Cryptography for Data Internetworks, pp. 31–79. IEEE Computer Society Press, Los Alamitos (1996)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Sourav Mukhopadhyay
    • 1
  • Palash Sarkar
    • 1
  1. 1.Cryptology Research Group, Applied Statistics UnitIndian Statistical InstituteKolkataIndia

Personalised recommendations