Abstract
In recent years, attacks involving polynomial cryptanalysis have become an important tool in evaluating encryption algorithms involving stream ciphers. Stream cipher designs are difficult to implement since they are prone to weaknesses based on usage, with properties being similar to one-time pad key-stream are subjected to very strict requirements. Contemporary stream cipher designs are highly vulnerable to Algebraic cryptanalysis based on linear algebra, in which the inputs and outputs are formulated as multivariate polynomial equations. Solving a nonlinear system of multivariate equations will reduce complexity, which in turn yields the targeted secret information. Recently, Addition Modulo \(2^n\) has been suggested over logic XOR as a mixing operator to guard against such attacks. However, it has been observed that the complexity of Modulo Addition can be drastically decreased with the appropriate formulation of polynomial equations and probabilistic conditions. A new model for enhanced Addition Modulo is proposed. The framework for the new design is characterized by user-defined expandable security for stronger encryption and does not impose changes in the existing layout for stream ciphers such as SNOW 2.0, BIVIUM, CryptMT, Grain Family, etc. The structure of the proposed design is highly scalable, boosts the Algebraic degree and thwarts the probabilistic conditions by maintaining the original hardware complexity without changing the integrity of the Addition Modulo \(2^n\).
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsReferences
Adams, C.M.: Constructing symmetric ciphers using the cast design procedure. Des. Codes Crypt. 12(3), 283–316 (1997)
Armknecht, F.: On the existence of low-degree equations for algebraic attacks. IACR Cryptology ePrint Archive 2004, 185 (2004)
Billet, O., Gilbert, H.: Resistance of SNOW 2.0 against algebraic attacks. In: Menezes, A. (ed.) CT-RSA 2005. LNCS, vol. 3376, pp. 19–28. Springer, Heidelberg (2005)
Burwick, C., Coppersmith, D., D’Avignon, E., Gennaro, R., Halevi, S., Jutla, C., Matyas Jr., S.M., O’Connor, L., Peyravian, M., Luke, J., Peyravian, O.M., Stafford, D., Zunic, N.: Mars - a candidate cipher for aes. In: NIST AES Proposal (1999)
Carlet, C., Feng, K.: An infinite class of balanced functions with optimal algebraic immunity, good immunity to fast algebraic attacks and good nonlinearity. In: Pieprzyk, J. (ed.) ASIACRYPT 2008. LNCS, vol. 5350, pp. 425–440. Springer, Heidelberg (2008). doi:10.1007/978-3-540-89255-7_26
Courtois, N., Klimov, A., Patarin, J., Shamir, A.: Efficient algorithms for solving overdefined systems of multivariate polynomial equations. In: Preneel, B. (ed.) EUROCRYPT 2000. LNCS, vol. 1807, pp. 392–407. Springer, Heidelberg (2000). doi:10.1007/3-540-45539-6_27
Courtois, N.T., Debraize, B.: Algebraic description and simultaneous linear approximations of addition in SNOW 2.0. In: Chen, L., Ryan, M.D., Wang, G. (eds.) ICICS 2008. LNCS, vol. 5308, pp. 328–344. Springer, Heidelberg (2008)
Courtois, N.T., Meier, W.: Algebraic attacks on stream ciphers with linear feedback. In: Biham, E. (ed.) EUROCRYPT 2003. LNCS, vol. 2656, pp. 345–359. Springer, Heidelberg (2003). doi:10.1007/3-540-39200-9_21
Courtois, N.T., Patarin, J.: About the XL algorithm over \(GF(2)\). In: Joye, M. (ed.) CT-RSA 2003. LNCS, vol. 2612, pp. 141–157. Springer, Heidelberg (2003)
Ekdahl, P., Johansson, T.: A new version of the stream cipher SNOW. In: Nyberg, K., Heys, H. (eds.) SAC 2002. LNCS, vol. 2595, pp. 47–61. Springer, Heidelberg (2003). doi:10.1007/3-540-36492-7_5
Fischer, S., Meier, W.: Algebraic immunity of S-Boxes and augmented functions. In: Biryukov, A. (ed.) FSE 2007. LNCS, vol. 4593, pp. 366–381. Springer, Heidelberg (2007)
Hawkes, P., Rose, G.: Primitive specification and support documentation for SOBER-t32 submission to NESSIE. In: Proceedings of the First Open NESSIE Workshop (2000)
Meier, W., Pasalic, E., Carlet, C.: Algebraic attacks and decomposition of boolean functions. In: Cachin, C., Camenisch, J.L. (eds.) EUROCRYPT 2004. LNCS, vol. 3027, pp. 474–491. Springer, Heidelberg (2004). doi:10.1007/978-3-540-24676-3_28
Weste, N.H., Harris, D.: Datapath subsystems. In: CMOS VLSI Design: A Circuits and Systems Perspective, pp. 637–711. Addison Wesley, Heidelberg (2004)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2016 Springer International Publishing AG
About this paper
Cite this paper
Cheng, M.H., Sedaghat, R., Siddavaatam, P. (2016). A New Adaptable Construction of Modulo Addition with Scalable Security for Stream Ciphers. In: Chen, J., Piuri, V., Su, C., Yung, M. (eds) Network and System Security. NSS 2016. Lecture Notes in Computer Science(), vol 9955. Springer, Cham. https://doi.org/10.1007/978-3-319-46298-1_25
Download citation
DOI: https://doi.org/10.1007/978-3-319-46298-1_25
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-46297-4
Online ISBN: 978-3-319-46298-1
eBook Packages: Computer ScienceComputer Science (R0)