Journal of Communications and Networks

  • 제13권3호
  • /
  • Pages.211-213
  • /
  • 2011
  • /
  • 1229-2370(pISSN)
  • /
  • 1976-5541(eISSN)
한국통신학회 (The Korean Institute of Commucations and Information Sciences)
권호 표지

Key Agreement Protocol Using Sylvester Hadamard Matrices

  • Choe, Chang-Hui (Department of Electronic Engineering, Chonbuk National University) ;
  • Lee, Moon-Ho (Department of Electronic Engineering, Chonbuk National University)
  • 투고 : 2010.02.05
  • 심사 : 2010.10.05
  • 발행 : 2011.06.30
PDF 다운로드
⟨ 이전 논문 다음 논문 ⟩

초록

In this paper, we propose a key agreement protocol using Sylvester Hadamard matrices. Users obtain their common key by using a matrix shared in advance. Matrix construction is very simple, and the computation is quite fast. The proposal will be useful for communication between two users, especially for those having low computing power.

키워드

과제정보

연구 과제 주관 기관 : National Research Foundation of Korea

참고문헌

  1. C.H. Choe, G. Y. Hwang, S. H. Kim, H. S. Yoo, and M. H. Lee, "Key agreement protocols based on the center weighted jacket matrix as a symmetric co-cyclic matrix," Lecture Notes in Computer Science 4105, pp. 121-127, Sept. 2006.
  2. C.-h. Choe, J. Hou, S. J. Choi, S. Y. Kim, and M. H. Lee, "Co-cyclic jacket matrices for secure communication," in Proc. IWSDA, Shimonoseki, Japan, Oct. 2005, pp. 103-105.
  3. K. J. Horadam, Hadamard Matrices, Princeton University Press, 2007.
  4. K. J. Horadam and P. Udaya, "Cocyclic Hadamard codes," IEEE Trans. Inf. Theory, vol. 46, no. 4, pp. 1545-1550, July 2000. https://doi.org/10.1109/18.850692
  5. W. Diffie and M. Hellman, "New directions in cryptography," IEEE Trans. Inf. Theory. vol. 22, no. 6, pp. 644-654, Nov. 1976. https://doi.org/10.1109/TIT.1976.1055638