On the computational power of the light: A plan for breaking data encryption standard

Abstract The successful of the light-based solutions for some NP-complete problems, such as Hamiltonian path problem, have demonstrated the power of light-based computing. The capabilities of the light-based computing such as massive parallelism of light, allow it to solve hard computational problems in polynomial time, while the conventional computers require exponential time. In this study we show how the light-based solution can be applied to break the Data Encryption Standard (DES). Under the assumption of having one given (plain-text, cipher-text) pair, our method recovers the DES key in a efficient time. We describe how to implement XOR gates, circular shifts, P-boxes, and S-boxes of DES in a light-based approach. The proposed solution encrypts the given plain-text with all possible keys and afterwards pair (Key; cipher-text) is extracted from them. We demonstrate that under chosen plain-text attack, it is possible to recover the DES key by providing all DES components in a reasonable time.

[1]  Saeed Jalili,et al.  An optical solution to the 3-SAT problem using wavelength based selectors , 2010, The Journal of Supercomputing.

[2]  Eli Biham,et al.  Differential Cryptanalysis of the Full 16-Round DES , 1992, CRYPTO.

[3]  H. John Caulfield,et al.  Why future supercomputing requires optics , 2010 .

[4]  Sama Goliaei,et al.  Computational Complexity of Wavelength-Based Machine with Slightly Interacting Sets , 2017, Int. J. Unconv. Comput..

[5]  Mitsuru Matsui,et al.  The First Experimental Cryptanalysis of the Data Encryption Standard , 1994, CRYPTO.

[6]  Joseph W. Goodman,et al.  Architectural development of optical data processing systems , 1982 .

[7]  Saeed Jalili,et al.  An Optical Wavelength-Based Solution to the 3-SAT Problem , 2009, OSC.

[8]  Natan T. Shaked,et al.  Optical processor for solving the traveling salesman problem (TSP) , 2006, SPIE Optics + Photonics.

[9]  William Stallings,et al.  Cryptography and Network Security: Principles and Practice , 1998 .

[10]  Wolfgang Osten,et al.  An optical solution for the traveling salesman problem. , 2007, Optics express.

[11]  Jerome Faist.  Optoelectronics: Silicon shines on , 2005, Nature.

[12]  Saeed Jalili,et al.  A new light-based solution to the Hamiltonian path problem , 2013, Future Gener. Comput. Syst..

[13]  Shlomi Dolev,et al.  Optical Solver of Combinatorial Problems: Nano-Technological Approach , 2012, Journal of the Optical Society of America. A, Optics, image science, and vision.

[14]  J H Reif,et al.  Efficient parallel algorithms for optical computing with the discrete Fourier transform (DFT) primitive. , 1997, Applied optics.

[15]  Shlomi Dolev,et al.  Masking traveling beams: Optical solutions for NP-complete problems, trading space for time , 2010, Theor. Comput. Sci..

[16]  Henry S. Tropp,et al.  Charles Babbage: Pioneer of the Computer , 1984 .

[17]  J. Paul Gibson,et al.  Lower bounds on the computational power of an optical model of computation , 2007, Natural Computing.

[18]  Mihai Oltean,et al.  Solving the subset-sum problem with a light-based device , 2007, Natural Computing.

[19]  P. Shum,et al.  Computing matrix inversion with optical networks. , 2013, Optics express.

[20]  Mohammad Sohel Rahman,et al.  Solving the generalized Subset Sum problem with a light based device , 2010, Natural Computing.

[21]  Thomas J. Naughton,et al.  An optical model of computation , 2005, Theor. Comput. Sci..

[22]  Mihai Oltean,et al.  Solving NP-Complete Problems with Delayed Signals: An Overview of Current Research Directions , 2008, OSC.

[23]  S. S. Kumar,et al.  Optical character recognition: An overview and an insight , 2014, 2014 International Conference on Control, Instrumentation, Communication and Computational Technologies (ICCICCT).

[24]  Mihai Oltean,et al.  Exact Cover with Light , 2007, New Generation Computing.

[25]  Richard J. Lipton,et al.  Breaking DES using a molecular computer , 1995, DNA Based Computers.

[26]  Natan T. Shaked,et al.  Parallel decomposition of combinatorial optimization problems using electro-optical vector by matrix multiplication architecture , 2010, The Journal of Supercomputing.

[27]  Natan T. Shaked,et al.  Combinatorial Optimization Using Electro-Optical Vector by Matrix Multiplication Architecture , 2009, OSC.

[28]  Dominik Schultes.  Rainbow Sort: Sorting at the Speed of Light , 2004, Natural Computing.

[29]  Saeed Jalili,et al.  Light-based solution for the dominating set problem. , 2012, Applied optics.

[30]  Nikolay I. Zheludev,et al.  An optical fiber network oracle for NP-complete problems , 2014, Light: Science & Applications.

[31]  Thomas J. Naughton,et al.  Parallel and Sequential Optical Computing , 2008, OSC.