Recursive Solution to a Type of Finite Field Matrix Equation and its Application in Information Security

Article Preview

Abstract:

On the question of solving lower triangular matrices or symmetric matrix by a type of matrix equation, we obtain the necessary and sufficient conditions for its only solution and design a recursive algorithm to compute the solution. With finite domain multiplicative inverse technology and Differ-Hellman protocol, a new cryptosystem is designed based on finite fields matrix equations. Numerical experiments demonstrate the correctness of the new cryptosystem and feasibility.

You might also be interested in these eBooks

Info:

Periodical:

Advanced Materials Research (Volumes 846-847)

Pages:

934-938

Citation:

Online since:

November 2013

Export:

Price:

Permissions CCC:

Permissions PLS:

Сopyright:

© 2014 Trans Tech Publications Ltd. All Rights Reserved

Share:

Citation:

* - Corresponding Author

[1] Zhaozhi Zhang: The Foundation Of Modern Cryptography. Beijing, China: Beijing University Of Posts And Telecommunications Press. 2005, pp.11-13.

Google Scholar

[2] PaulGarrett, Shizhong Wu, Xiaolong Song, Tao Guo et al: An Introduction To Cryptology. Beijing, China: China Machine Press. 2008, pp.111-117.

Google Scholar

[3] Xin Wang, Chen Sun , Xinmei Wang: Journal Of Xidian University(Natural Science Edition), Xi'an, China. 2009, 36(3 ), pp.428-432.

Google Scholar

[4] Houzhen Wang, Huanguo Zhang, Zhangyi Wang, Ming Tang: Scientia Sinica Informationis, Beijing, China. 2011, 41(11), pp.1297-1309.

Google Scholar

[5] Shenhai Yan: Journal Of Jiangxi University Of Science And Technology, Ganzhou, China. 2012, (03), pp.76-80.

Google Scholar

[6] Xiaofeng Yang, Zhong Xu, Quan Lu, Yufeng Nie: Numerical Mathematics A Journal Of Chinese Universities, Nanjing, China. 2012, (02), pp.119-125.

Google Scholar