An Artificial Immune System Heuristic for Generating Short Addition Chains

This paper deals with the optimal computation of finite field exponentiation, which is a well-studied problem with many important applications in the areas of error-correcting codes and cryptography. It has been shown that the optimal computation of finite field exponentiation is a problem which is closely related to finding a suitable addition chain with the shortest possible length. However, it is also known that obtaining the shortest addition chain for a given arbitrary exponent is an NP-hard problem. As a consequence, heuristics are an obvious choice to compute field exponentiation with a semi-optimal number of underlying arithmetic operations. In this paper, we propose the use of an artificial immune system to tackle this problem. Particularly, we study the problem of finding both the shortest addition chains for exponents e with moderate size (i.e., with a length of less than 20 bits), and for the huge exponents typically adopted in cryptographic applications, (i.e., in the range from 128 to 2048 bits).

[1]  D. Wong,et al.  Negative Selection Algorithm for Aircraft Fault Detection , 2004, ICARIS.

[2]  Noboru Kunihiro,et al.  New Methods for Generating Short Addition Chains , 2000 .

[3]  Arnold Schönhage.  A Lower Bound for the Length of Addition Chains , 1975, Theor. Comput. Sci..

[4]  Alfred Menezes,et al.  Handbook of Applied Cryptography , 2018 .

[5]  Gregg H. Gunsch,et al.  An artificial immune system architecture for computer security applications , 2002, IEEE Trans. Evol. Comput..

[6]  Nadia Nedjah,et al.  Efficient Pre-processing for Large Window-Based Modular Exponentiation Using Genetic Algorithms , 2003, IEA/AIE.

[7]  Ç. Koç.  Analysis of sliding window techniques for exponentiation , 1995 .

[8]  Gary B. Lamont,et al.  A distributed architecture for a self-adaptive computer virus immune system , 1999 .

[9]  Jongsoo Lee,et al.  Constrained genetic search via schema adaptation: An immune network solution , 1996 .

[10]  Susan Stepney,et al.  Towards a Conceptual Framework for Artificial Immune Systems , 2004, ICARIS.

[11]  Matthijs J. Coster,et al.  Addition Chain Heuristics , 1989, CRYPTO.

[12]  Francisco Rodríguez-Henríquez,et al.  On the Optimal Computaion of Finite Field Exponentiation , 2004, IBERAMIA.

[13]  Fernando José Von Zuben,et al.  Learning and optimization using the clonal selection principle , 2002, IEEE Trans. Evol. Comput..

[14]  T. Itoh,et al.  A Fast Algorithm for Computing Multiplicative Inverses in GF(2^m) Using Normal Bases , 1988, Inf. Comput..

[15]  Hyunsoo Yoon,et al.  Expansion of Sliding Window Method for Finding Shorter Addition/Subtraction-Chains , 2006, Int. J. Netw. Secur..

[16]  Ernest F. Brickell,et al.  Fast Exponentiation with Precomputation (Extended Abstract) , 1992, EUROCRYPT.

[17]  Joachim von zur Gathen,et al.  Computing special powers in finite fields: extended abstract , 1999, ISSAC '99.

[18]  Peter Ross,et al.  The evolution and analysis of potential antibody library for use in job-shop scheduling , 1999 .

[19]  S. Forrest,et al.  Immunology as Information Processing , 2001 .

[20]  D. Dasgupta,et al.  Immunity-based systems: a survey , 1997, 1997 IEEE International Conference on Systems, Man, and Cybernetics. Computational Cybernetics and Simulation.

[21]  Donald Ervin Knuth,et al.  The Art of Computer Programming , 1968 .

[22]  Jorge Olivos.  On Vectorial Addition Chains , 1981, J. Algorithms.

[23]  J. Berstel,et al.  Efficient computation of addition chains , 1994 .

[24]  Sung-Ming Yen.  IMPROVED NORMAL BASIS INVERSION IN GF(2M) , 1997 .

[25]  Kazuyoshi Takagi,et al.  A Fast Algorithm for Multiplicative Inversion in GF(2m) Using Normal Basis , 2001, IEEE Trans. Computers.

[26]  Steven A. Frank,et al.  The Design of Natural and Artificial Adaptive Systems , 1996 .

[27]  Yacov Yacobi,et al.  Exponentiating Faster with Addition Chains , 1991, EUROCRYPT.

[28]  Hirosuke Yamamoto,et al.  Window and Extended Window Methods for Addition Chain and Addition-Subtraction Chain , 1998 .

[29]  Yukio Tsuruoka,et al.  Fast Computation over Elliptic Curves E (Fqn)Based on Optimal Addition Sequences , 2001 .

[30]  Jonathan Timmis,et al.  Artificial immune systems - a new computational intelligence paradigm , 2002 .

[31]  R. Gershon,et al.  "Clonal selection and after," and after. , 1979, The New England journal of medicine.

[32]  Fabio A. González,et al.  Anomaly Detection Using Real-Valued Negative Selection , 2003, Genetic Programming and Evolvable Machines.

[33]  Vincenzo Cutello,et al.  An Immunological Approach to Combinatorial Optimization Problems , 2002, IBERAMIA.

[34]  Daniel M. Gordon,et al.  A Survey of Fast Exponentiation Methods , 1998, J. Algorithms.

[35]  Julie Greensmith,et al.  Immune System Approaches to Intrusion Detection - A Review , 2004, ICARIS.

[36]  Stephanie Forrest,et al.  A sense of self for Unix processes , 1996, Proceedings 1996 IEEE Symposium on Security and Privacy.

[37]  Jonathan Timmis,et al.  Inspiration for the Next Generation of Artificial Immune Systems , 2005, ICARIS.