基于中国剩余定理的NFC安全认证算法
NFC SECURITY AUTHENTICATION ALGORITHM BASED ON CHINESE REMAINDER THEOREM
邹同浩1
作者信息
- 1. 广东司法警官职业学院 广东广州 510006
- 折叠
摘要
针对近场通信技术在应用中出现的安全隐患问题,给出一种基于中国剩余定理的算法.算法利用中国剩余定理实现对传送信息进行加密,中国剩余定理基于数学中大素数分解难题,使得攻击者无法进行破解;所有信息加密过程中混入随机数,用于保证消息的新鲜性;算法在进行信息更新时采用伪随机函数计算,因伪随机函数具备的单向性,使得攻击者无法分析出有用隐私信息.将不同算法对比安全分析,表明该算法能够抵抗重放攻击、异步攻击等多种攻击.通过性能角度及仿真实验对多个算法进行分析,结果表明该算法计算时间复杂度低于其他算法.
Abstract
Aiming at the security problems in the application of near-field communication technology,this paper presents an algorithm based on Chinese remainder theorem(CRT).The algorithm used CRT to encrypt the transmitted information.CRT was based on the decomposition problem of large prime numbers in mathematics,which made it impossible for the attacker to crack.Random numbers were mixed into all information encryption processes to ensure the freshness of the message.When updating the information,the algorithm used pseudo-random function calculation,because of the unidirectionality of the pseudo-random function,it was impossible for the attacker to analyze useful privacy information.The security analysis between different algorithms shows that this algorithm can resist replay attacks,asynchronous attacks and other attacks.The performance and simulation experiments show that this algorithm has lower computational complexity and time complexity than other algorithms.
关键词
近场通信/中国剩余定理/伪随机函数/大素数/安全认证/GNY逻辑形式化分析Key words
Near field communication(NFC)/Chinese remainder theorem(CRT)/Pseudo random function(PRF)/Large prime number/Security authentication/Formal analysis of GNY logic引用本文复制引用
基金项目
广东省省级科技计划项目(2019B110210002)
出版年
2024
国家科技期刊平台
NSTL
维普
万方数据