The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.03 - March (2011 vol.60)
pp: 375-385
Debdeep Mukhopadhyay , Indian Institute of Technology, Kharagpur
Dipanwita RoyChowdhury , Indian Institute of Technology, Kharagpur
ABSTRACT
We present a scalable, modular, memoryless, and reconfigurable parallel architecture to generate cryptographically robust mappings, which are useful in the construction of stream and block ciphers. It has been theoretically proved that the proposed architecture can be reconfigured to generate a large number of mappings, all of which have high nonlinearity, satisfies Strict Avalanche Criterion (SAC) and is robust against linear and differential cryptanalysis. The architecture can be also used to optimize the resiliency and algebraic degree. The architecture has been found to scale easily to handle large number of input variables, which is an important criterion in realizing nonlinear combiners for stream ciphers using Boolean functions.
INDEX TERMS
Boolean functions, S-Box, stream cipher, cryptographic robustness, scalable architecture.
CITATION
Debdeep Mukhopadhyay, Dipanwita RoyChowdhury, "A Parallel Efficient Architecture for Large Cryptographically Robust n × k (k>n/2) Mappings", IEEE Transactions on Computers, vol.60, no. 3, pp. 375-385, March 2011, doi:10.1109/TC.2010.136
REFERENCES
[1] K. Khoo, G. Gong, and H.-K. Lee, "The Rainbow Attack on Stream Ciphers Based on Maiorana McFarland Functions," Revised Version, Cryptology ePrint Archive, Report 2007/242, 2007.
[2] K. Nyberg, "Perfect Non-Linear S-Boxes," Advances in Cryptology— EUROCRYPT '91, pp. 378-386, Springer, 1991.
[3] H. Dobbertin, "Almost Perfect Nonlinear Power Functions on $GF(2^n)$ : The Welch Case," IEEE Trans. Information Theory, vol. 45, no. 4, pp. 1271-1275, May 1999.
[4] J. Seberry, X.M. Zhang, and Y. Zheng, "On Construction and Nonlinearity of Correlation Immune Boolean Functions," Proc. Eurocrypt, pp. 181-199, 1993.
[5] X.M. Zhang and Y. Zheng, "On Cryptographically Resilient Functions," IEEE Trans. Information Theory, vol. 43, no. 5, pp. 1740-1747, Sept. 1997.
[6] E. Pasalic and S. Maitra, "Linear Codes in Generalized Construction of Resilient Functions with Very Highly Nonlinearity," IEEE Trans. Information Theory, vol. 48, no. 8, pp. 2182-2191, Aug. 2002.
[7] K.C. Gupta and P. Sarkar, "Improved Construction of Non-Linear Resilient S-boxes," IEEE Trans. Information Theory, vol. 51, no. 1, pp. 339-348, Jan. 2005.
[8] S. Chee, S. Lee, D. Lee, and S.H. Sung, "On the Correlation Immune Functions and Their Nonlinearity," Proc. Int'l Conf. Theory and Applications of Cryptology and Information Security, pp. 232-243, 1996.
[9] J.H. Cheon et al., "Improved Impossible Differential Cryptanalysis of Rijndael and Crypton," Proc. Fourth Int'l Conf. Information Security and Cryptology (ICISC '01), pp. 39-49, 2001.
[10] W. Meier, E. Pasalic, and C. Carlet, "Algebraic Attacks and Decomposition of Boolean Functions," Advances in Cryptology— EUROCRYPT 2004, pp. 474-491, Springer, 2004.
[11] N.T. Curtois and W. Meier, "Algebraic Attacks on Stream Ciphers with Linear Feedback," Proc. 22nd Int'l Conf. Theory and Applications of Cryptographic Techniques, pp. 345-359, 2003.
[12] A. Canteaut and M. Videau, "Degree of Composition of Highly Nonlinear Functions and Applications to Higher Order Differential Cryptanalysis," Proc. Int'l Conf. Theory and Applications of Cryptographic Techniques: Advances in Cryptology, pp. 518-533, 2002.
[13] V. Chepyzhov, T. Johansson, and B. Smeets, "A Simple Algorithm for Fast Correlation Attacks on Stream Ciphers," Proc. Seventh Int'l Workshop Fast Software Encryption, pp. 181-195, 2000.
[14] M.H. Dawson and S.E. Tavares, "An Expanded Set of S-Box Design criteria Based on Information Theory and Its Relation to Differential-Like Attacks," Proc. 10th Ann. Int'l Conf. Theory and Application of Cryptographic Techniques, pp. 352-367, 1991.
[15] J. Tetombe and S.E. Tavares, "Constructing Large Cryptographically Strong S-Boxes," Advances in Cryptology—AUSCRYPT '92, pp. 165-181, Springer, 1992.
[16] J. Detombe and S.E. Tavares, "Constructing Large Cryptographically Strong S-Boxes," Proc. Workshop Theory and Application of Cryptographic Techniques: Advances in Cryptology, pp. 165-181, 1992.
[17] A. Webster and S. Tavares, "On the Design of S-Boxes," Advances in Cryptology—CRYPTO '85, pp. 523-534, Springer, 1985.
[18] A. Youssef and S. Tavares, "Resistance of Balanced S-Boxes to Linear and Differential Cryptanalysis," Information Processing Letters, vol. 56, pp. 249-252, 1995.
[19] A. Youssef and S. Tavares, "Number of Non-Linear Regular S-boxes," IET Electronic Letters, vol. 31, no. 19, pp. 1643-1644, Sept. 1995.
[20] C. Adams and S. Tavares, "Good S-Boxes are Easy to Find," Proc. Ninth Ann. Int'l Cryptology Conf. Advances in Cryptology, pp. 612-615, 1989.
[21] J. Seberry, X.-M. Zhang, and Y. Zheng, "Systematic Generation of Cryptographically Robust S-Boxes," Proc. First ACM Conf. Computer and Comm. Security, pp. 171-182, 1993.
[22] K.C. Gupta and P. Sarkar, "Improved Construction of Non-Linear Resilient S-Boxes," Proc. Eighth Int'l Conf. Theory and Application of Cryptology and Information Security: Advances in Cryptology, pp. 466-483, 2002.
[23] P. Sarkar and S. Mitra, "Efficient Implementation of Cryptographically Useful 'Large' Boolean Functions," IEEE Trans. Computers, vol. 52, no. 4, pp. 410-417, Apr. 2003.
[24] K.C. Gupta and P. Sarkar, "Efficient Representation and Software Implementation of Resilient Maiorana-McFarland and S-Boxes," Proc. Workshop Information Security Applications (WISA '04), pp. 317-331, 2004.
[25] S. Mister and C. Adams, "Practical S-Box Design," Proc. Workshop Selected Areas in Cryptography (SAC '96) Workshop Record, pp. 61-76, 1996.
[26] S. Maitra and P. Sarkar, "Highly Nonlinear Resilient Functions Optimizing Sigenthaler's Inequality," Advances in Cryptlogy—CRYPTO '99, pp. 198-215, Springer, 1999.
[27] D. Osvik, A. Shamir, and E. Tromer, "Cache Attacks and Countermeasures: The Case of AES," Proc. Cryptographers Track at the RSA Conf., 2005.
[28] S. Wolfram, "Statistical Mechanics of Cellular Automata," Rev. of Modern Physics, vol. 55, no. 3 pp. 601-644, July 1983.
[29] P.P. Chaudhuri, D.R. Chowdhury, S. Nandi, and S. Chattopadhyay, Additive Cellular Automata Theory and Its Application, vol. 1, IEEE CS Press, 1997.
[30] J.M. Rabaey, A. Chandrakasan, and B. Nicolic, Digital Integrated Circuits, A Design Perspective. Prentice Hall, 2003.
[31] P. Sarkar and S. Maitra, "Non-Linearity Bounds and Constructions of Resilient Boolean Functions," Proc. 20th Ann. Int'l Cryptology Conf. Advances in Cryptology, pp. 515-532, 2000.
[32] Y. Xian, "Correlation-Immunity of Boolean Functions," Electronics Letters, vol. 23, pp. 1335-1336, 1987.
[33] T. Siegenthaler, "Correlation-Immunity of Nonlinear Combining Functions for Cryptographic Applications," IEEE Trans. Information Theory, vol. IT-30, no. 5, pp. 776-780, Sept. 1984.
[34] D.R. Stinson, Cryptography : Theory and Practice, chapter 3, pp. 79-88, CRC Press, 2002.
[35] J. Seberry, X.-M. Zhang, and Y. Zhang, "Cryptographic Boolean Functions via Group Hadamard Matrices," Australasian J. Combinatorics, vol. 10, pp. 131-145, 1994.
[36] J. Patarin, "Hidden Field Equations (HFE) and Isomporphism of Polynomials (IP): Two New Families of Asymmetric Algorithms," Proc. 15th Ann. Int'l Conf. Theory and Application of Cryptographic Techniques, pp. 33-48, 1996.
[37] N.T. Curtois, "The Security of Hidden Field Equations (HFE)," Proc. Conf. Topics in Cryptology: The Cryptographer's Track at RSA, pp. 266-281, 2001.
[38] N.T. Curtois, M. Daum, and P. Felke, "On the Security of HFE, HFEv- and Quartz," Proc. Sixth Int'l Workshop Theory and Practice in Public Key Cryptography: Public Key Cryptography (PKC '03), pp. 337-350, 2003.
[39] N.T. Curtois, "Higher Order Correlation Attacks, XL Algorithm and Cryptanalysis of Toyocrypt," Proc. Fifth Int'l Conf. Information Security and Cryptology (ICISC '02), pp. 182-199, 2002.
[40] F. Armknecht and M. Krause, "Algebraic Attacks on Combiners with Memory," Advances in Cryptology—CRYPTO 2003, pp. 162-175, Springer, 2003.
[41] N.T. Curtois, "Algebraic Attacks on Combiners with Memory and Several Outputs," Cryptology ePrint Archive, Report 2003/125, 2003.
[42] W. de Launey, "Generalised Hadamard Matrices Whose Rows and Columns Form a Group," Combinatorial Mathematics X, pp. 154-176, Springer, 1983.
22 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool