Vulnerability of Nonlinear Filter Generators Based on Linear Finite State Machines

We present a realization of an LFSM that utilizes an LFSR. This is based on a well-known fact from linear algebra. This structure is used to show that a previous attempt at using a CA in place of an LFSR in constructing a stream cipher did not necessarily increase its security. We also give a general method for checking whether or not a nonlinear filter generator based on an LFSM allows reduction to one that is based on an LFSR and which is vulnerable to Anderson information leakage.

[1]  Sanjit Chatterjee,et al.  New Constructions of Constant Size Ciphertext HIBE Without Random Oracle , 2006, ICISC.

[2]  Sourav Mukhopadhyay,et al.  On the Effectiveness of TMTO and Exhaustive Search Attacks , 2006, IWSEC.

[3]  Palash Sarkar,et al.  A Parallel Algorithm for Extending Cryptographic Hash Functions , 2001, INDOCRYPT.

[4]  Donghoon Chang,et al.  A Generalization of PGV-Hash Functions and Security Analysis in Black-Box Model , 2004, IACR Cryptol. ePrint Arch..

[5]  Sanjit Chatterjee,et al.  Trading Time for Space: Towards an Efficient IBE Scheme with Short(er) Public Parameters in the Standard Model , 2005, ICISC.

[6]  Palash Sarkar,et al.  Efficient Representation and Software Implementation of Resilient Maiorana-McFarland S-boxes , 2004, WISA.

[7]  Palash Sarkar,et al.  Nonlinearity Bounds and Constructions of Resilient Boolean Functions , 2000, CRYPTO.

[8]  Palash Sarkar,et al.  Efficient Implementation of "Large" Stream Cipher Systems , 2001, CHES.

[9]  Jovan Dj. Golic.  On the Security of Nonlinear Filter Generators , 1996, FSE.

[10]  Willi Meier,et al.  Fast correlation attacks on certain stream ciphers , 1989, Journal of Cryptology.

[11]  Palash Sarkar,et al.  New Applications of Time Memory Data Tradeoffs , 2005, ASIACRYPT.

[12]  Sourav Mukhopadhyay,et al.  Application of LFSRs for Parallel Sequence Generation in Cryptologic Algorithms , 2006, ICCSA.

[13]  Sanjit Chatterjee,et al.  Generalization of the Selective-ID Security Model for HIBE Protocols , 2006, Public Key Cryptography.

[14]  Palash Sarkar,et al.  PARSHA-256- - A New Parallelizable Hash Function and a Multithreaded Implementation , 2003, FSE.

[15]  Palash Sarkar,et al.  Parallelizing Explicit Formula for Arithmetic in the Jacobian of Hyperelliptic Curves , 2003, ASIACRYPT.

[16]  P. Sarkar,et al.  Improved construction of nonlinear resilient S-boxes , 2002, IEEE Transactions on Information Theory.

[17]  Sourav Mukhopadhyay,et al.  Hardware architecture and trade-offs for generic inversion of one-way functions , 2006, 2006 IEEE International Symposium on Circuits and Systems.

[18]  Sanjit Chatterjee,et al.  Efficient Computation of Tate Pairing in Projective Coordinate over General Characteristic Fields , 2004, ICISC.

[19]  Palash Sarkar.  Masking-based domain extenders for UOWHFs: bounds and constructions , 2005, IEEE Transactions on Information Theory.

[20]  Palash Sarkar.  The Filter-Combiner Model for Memoryless Synchronous Stream Ciphers , 2002, CRYPTO.

[21]  Sanjeev Kumar Mishra.  On Symmetrically Private Information Retrieval , 2000, IACR Cryptol. ePrint Arch..

[22]  Alex Biryukov,et al.  Improved Time-Memory Trade-Offs with Multiple Data , 2005, Selected Areas in Cryptography.

[23]  Palash Sarkar,et al.  Application of Montgomery's Trick to Scalar Multiplication for Elliptic and Hyperelliptic Curves Using a Fixed Base Point , 2004, Public Key Cryptography.

[24]  Palash Sarkar,et al.  Construction of Perfect Nonlinear and Maximally Nonlinear Multi-output Boolean Functions Satisfying Higher Order Strict Avalanche Criteria (Extended Abstract) , 2003, INDOCRYPT.

[25]  Hideki Imai,et al.  A Family of Fast Dedicated One-Way Hash Functions Based on Linear Cellular Automata Over GF (q) , 1999 .

[26]  Palash Sarkar,et al.  Highly Nonlinear Resilient Functions Optimizing Siegenthaler's Inequality , 1999, CRYPTO.

[27]  Ed Dawson,et al.  Generalized Inversion Attack on Nonlinear Filter Generators , 2000, IEEE Trans. Computers.

[28]  Palash Sarkar,et al.  Construction of Nonlinear Boolean Functions with Important Cryptographic Properties , 2000, EUROCRYPT.

[29]  Palash Sarkar,et al.  Enumeration of Correlation Immune Boolean Functions , 1999, ACISP.

[30]  Sridhar Srinivasan.  Journal Papers , 1999 .

[31]  Palash Sarkar,et al.  HCH: A New Tweakable Enciphering Scheme Using the Hash-Encrypt-Hash Approach , 2006, INDOCRYPT.

[32]  Sangjin Lee,et al.  Conditional Correlation Attack on Nonlinear Filter Generators , 1996, ASIACRYPT.

[33]  Palash Sarkar.  HEAD: Hybrid Encryption with Delegated Decryption Capability , 2004, INDOCRYPT.

[34]  Palash Sarkar,et al.  Hiji-bij-bij: A New Stream Cipher with a Self-synchronizing Mode of Operation , 2003, INDOCRYPT.

[35]  Palash Sarkar.  Pushdown Automaton with the Ability to Flip its Stack , 2001, Electron. Colloquium Comput. Complex..

[36]  Ross J. Anderson.  Searching for the Optimum Correlation Attack , 1994, FSE.

[37]  Harald Niederreiter,et al.  Introduction to finite fields and their applications: List of Symbols , 1986 .

[38]  Sanjit Chatterjee,et al.  Construction of a Hybrid (Hierarchical) Identity-Based Encryption Protocol Secure Against Adaptive Attacks , 2006, IACR Cryptol. ePrint Arch..

[39]  Palash Sarkar,et al.  VLSI implementation of modulo multiplication using carry free addition , 1997, Proceedings Tenth International Conference on VLSI Design.

[40]  Sourav Mukhopadhyay,et al.  Application of LFSRs in Time/Memory Trade-Off Cryptanalysis , 2005, WISA.

[41]  Douglas R. Stinson,et al.  Frameproof and IPP Codes , 2001, INDOCRYPT.

[42]  Sanjit Chatterjee,et al.  Multi-receiver Identity-Based Key Encapsulation with Shortened Ciphertext , 2006, INDOCRYPT.

[43]  P.K. Mishra,et al.  A parallel algorithm for computing simultaneous inversions with application to elliptic curve scalar multiplication , 2003, 2003 46th Midwest Symposium on Circuits and Systems.

[44]  Ratna Dutta,et al.  Provably Secure Authenticated Tree Based Group Key Agreement , 2004, ICICS.

[45]  Palash Sarkar,et al.  New Table Look-Up Methods for Faster Frobenius Map Based Scalar Multiplication Over GF(pn) , 2004, ACNS.

[46]  Palash Sarkar.  Computing Shifts in 90/150 cellular automata sequences , 2003 .

[47]  Palash Sarkar,et al.  A brief history of cellular automata , 2000, CSUR.

[48]  Jovan Dj. Golic,et al.  Correlation via Linear Sequential Circuit Approximation of Combiners with memory , 1992, EUROCRYPT.

[49]  Palash Sarkar,et al.  Time-Memory Trade-Off Attacks on Multiplications and T-Functions , 2004, ASIACRYPT.

[50]  Palash Sarkar,et al.  A New Mode of Encryption Providing a Tweakable Strong Pseudo-random Permutation , 2006, FSE.

[51]  Sanjit Chatterjee,et al.  HIBE With Short Public Parameters Without Random Oracle , 2006, ASIACRYPT.