首页 | 本学科首页   官方微博 | 高级检索  
     

基于自动机理论的密码匹配方法
引用本文:姜克鑫,赵亚慧,崔荣一.基于自动机理论的密码匹配方法[J].延边大学理工学报,2021,0(2):141-145.
作者姓名:姜克鑫  赵亚慧  崔荣一
作者单位:(延边大学 工学院, 吉林 延吉 133002)
摘    要:针对用户安全登录问题,提出了一种基于自动机的密码匹配模型.首先,对于用户任意输入的密码进行同态映射加密; 其次,构造出可接受加密密码的自动机——状态数目可变自动机(VNS - DFA),该自动机不仅能够匹配加密密码,同时还可以输出加密密码的同态原像以及匹配成功的次数; 最后,在状态数目可变的自动机上对用户输入的密码进行实验验证表明,用户建立的密码经过同态映射后可全部被该自动机接受,且该自动机的时间复杂度优于传统的DFA以及改进的DFA.

关 键 词:自动机理论  密码匹配  密码加密  同态映射  同态原像

Password matching method based on automata theory
JIANG Kexin,ZHAO Yahui,CUI Rongyi.Password matching method based on automata theory[J].Journal of Yanbian University (Natural Science),2021,0(2):141-145.
Authors:JIANG Kexin  ZHAO Yahui  CUI Rongyi
Affiliation:(College of Engineering, Yanbian University, Yanji 133002, China)
Abstract:For users to log in safely, a password matching model based on automata was proposed. Firstly, we perform homomorphic mapping encryption for any entered password; Then, we construct an automaton that accepts encrypted passwords, namely variable number of states automata(VNS - DFA), the automat a can not only match the encrypted password, but also can output the homomorphic image of the encrypted password and the number of successful matches. Finally, the experiments on the automata with variable number of states show that the user's password can be accepted by the automata after homomorphic mapping, and the time complexity of the automata is better than that of the traditional DFA and the DFA which was improved.
Keywords:automata theory  password match  password encryption  homomorphic mapping  homomorphic preimage
本文献已被 CNKI 等数据库收录!
点击此处可从《延边大学理工学报》浏览原始摘要信息
点击此处可从《延边大学理工学报》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号