Design and Implementation of Maxi-Linear Deviation Search Algorithm Based on Improved ICP

Abstract:

To solve the problem of calculating the maximum linear deviation in block cipher algorithm linear analysis, the paper has proposed a search method and improved algorithm based on iterative closest point (ICP) of the maximum deviation. The ciphertext and its coefficient matrix is initialized as range image matrix, using ICP algorithm to calculate the best match state of adjacent range image, and the linear deviation value of round function transformation of this time was proved to be the maximum linear deviation by applying generalized Walsh spectrum; by proposing the initial rule corresponding distance, determined the initial corresponding relation of iterative algorithm, each round of transformation matrix would be assigned to the next round as the initial transformation matrix which has improved the matching speed of the ICP algorithm; the rationality and effectiveness of this new search algorithm can be proved by comparing with the maximum linear deviation search algorithm put forward by M.Matsui.

• Periodical: Advanced Materials Research (Volumes 143-144)
• Pages: 293-297
• DOI: https://doi.org/10.4028/www.scientific.net/AMR.143-144.293
• Online since: October 2010
• Authors: Li Zhao Liu, Yu Feng Chen, Tian Hua Zhang, Ying Wang, Mao Qing Li
• Keywords: Crypt-Analysis, Generalized Walsh Spectrum, ICP, Linear Approximation, Maximum Linear Deviation, Range Image

References

[1] American National Standards Institute. ANSI X3, 1983, American National Standard for Information Systems. Data Encryption Algorithm-Modes of Operation: 106-(1983).

[2] Paul Kocher, Joshua Jaffe, Benjamin Jun. Differential Power Analysis [C], 1999, Proceeding of Advances in Cryptography (CRYPTO99): 386-397.

[3] National Institute of Standards and Technology (NIST). Federal Information Processing Standards Publication 46-3 (FIPS PUB 46-3): Data Encryption Standard, October (1999).

DOI: 10.6028/nbs.fips.43

[4] C. Giraud. DFA on AES Cryptology ePrint Archive. http: /eprint. iacr. org 10, (2005).

[5] M. Matsui , On Correlation Between the Order of S-boxes and the Strength of DES, Advances in Cryptology Eurocrypto'94, 1994: 157-170.

[6] Luo Lan, block cipher design pre-assessment application, PhD thesis, University of Electronic Science and Technology, (2009).

[7] Boissonnat, Jean-Daniel, Geometric Structures for Three-Dimensional Shape Representation, ACM Transactions on Graphics, Vol. 3, No. 4 (October 1984), pp.266-286.

DOI: 10.1145/357346.357349

[8] Gux., Gortler S. J., Hoppe H.: Geometry images. ACM Trans. Graph. 21, 3 (2002), 355-361.

DOI: 10.1145/566654.566589

[9] Agarwalr., De BergM., Gudmundsson J., Hammar M., Haverkorth.: Box-trees and r-trees with near optimal query time. Discr. Comp. Geom. 28, 3 (2002), 291-312.

DOI: 10.1007/s00454-002-2817-1

[10] Besl, Paul J. and Neil D. McKay, A Method of Registration of 3-D Shapes, IEEE Transactions on Pattern Analysis and Machine Intelligence, Vol. 14, No. 2 (February 1992), pp.239-256.

DOI: 10.1109/34.121791

[11] F. Lu and E. Milios. Globally consistent range scan alignment for environment mapping. Autonomous Robots, 4(4): 333-349, (1997).

[12] P. Neugebauer. Geometrical cloning of 3d objects via simultaneous registration of multiple range images.

DOI: 10.1109/sma.1997.634890

[13] Greg Turk, Marc LevoyZippered Polygon Meshes from range images. In Computer Graphics Proceedings, Annual Conference Series, 1994, ACM SIGGRAPH, pp.311-318.

DOI: 10.1145/192161.192241