姜楠, 杨日璟, 袁克杰, 刘向东. 基于置乱排序的身份认证协议研究[J]. 微电子学与计算机, 2010, 27(6): 1-4.
引用本文: 姜楠, 杨日璟, 袁克杰, 刘向东. 基于置乱排序的身份认证协议研究[J]. 微电子学与计算机, 2010, 27(6): 1-4.
JIANG Nan, YANG Ri-jing, YUAN Ke-jie, LIU Xiang-dong. Study of Identity Authentication Protocol Based on Scramble Sort[J]. Microelectronics & Computer, 2010, 27(6): 1-4.
Citation: JIANG Nan, YANG Ri-jing, YUAN Ke-jie, LIU Xiang-dong. Study of Identity Authentication Protocol Based on Scramble Sort[J]. Microelectronics & Computer, 2010, 27(6): 1-4.

基于置乱排序的身份认证协议研究

Study of Identity Authentication Protocol Based on Scramble Sort

  • 摘要: 在分析经典的身份认证方案,特别是一次性口令认证方案中S/KEY方案存在问题的基础上,提出了一种新的身份认证协议COTP.在本协议中,采用了基于混沌置乱排序表的设计算法,在用户登录过程中用置乱排序后的次数代替真正的迭代次数,对协议中用到的种子进行了加密处理.理论分析与仿真实验表明,COTP认证协议能抵御小数攻击、重放攻击及内部人员攻击,能对传输的种子和迭代次数进行加密,并实现了客户和服务器的双向认证.

     

    Abstract: By analyzing typical authentication schemes, especially S/KEY schemes in one time password, a new authentication protocol COTP is proposed.Different from other one time password protocols, it gives the algorithm of chaotic scramble sort table and applies the scramble sort algorithm instead of real iteration times in the log on process.Gives the idea of encrypting to the seeds of protocol, theoretical analysis and computer simulation demonstrate that the COTP can resist little numbers attack, replay attack, internal attack and encryption seed and the times of iteration for transform, that realizes authentication between client and server.

     

/

返回文章
返回