期刊文献+

基于云平台计算授权码的单片机程序保护方案

MCU Program Protection Method for Calculating License Code Based on Cloud Platforms
下载PDF
导出
摘要 反向工程技术会对单片机程序的知识产权构成重大威胁。在应对的保护方案中,由于经济成本、PCB布板面积小的原因,难以推广加密芯片的硬件保护方案。为此,本文通过分析攻击者可能采用的攻击方式,设计了一种经济有效且在关键点上采用更严密防范措施的保护方案。该方案使用具有唯一不可改写的硬件序列号的单片机,采用公开密钥密码体制RSA算法在私有云平台生成授权码,再烧录到单片机中,并通过单片机的程序检验授权码与硬件序列号的匹配关系。商业实践证明,该方案可有效防范反向工程技术的威胁,且经济、可靠、易推广。 Reverse engineering techniques can pose a significant threat to the intellectual property rights of microcontroller programs.Among the protection schemes to deal with it,the hardware protection scheme of the encryption chip is dificult to promote due to the economic cost and small PCB layout area.For this reason,this paper designs a protection scheme that is cost-effective and uses tighter precautions at key points by analyzing the possible attack methods used by attackers.The scheme uses a microcontroller with a unique hardware serial number that cannot be rewritten,generates an authorization code in the private cloud platform using the public key cryptosystem RSA algorithm,and then burns it into the microcontroller,and verifies the matching relationship between the authorization code and the hardware serial number through the microcontroller's program.Commercial practice has proved that this program can effectively prevent the threat of reverse engineering techniques,and is economical,reliable and easy to promote.
作者 李攀 LI Pan(Xiamen Huaxia University,Xiamen,Fujian 361024,China;Information Communication Technology and Smart Education of Fujian Engineering Research Center,Xiamen,Fujian 361024,China)
出处 《自动化应用》 2023年第22期236-238,共3页 Automation Application
关键词 单片机程序保护方案 授权码 云平台 公开密钥密码体制 RSA MCU program protection method license code cloud platform public key cryptosystem RSA
  • 相关文献

参考文献2

二级参考文献23

  • 1Euclid. The thirteen books of Euclid's elements[M].Kent:Dover Publications,1956.
  • 2Gauss C F. Disquisitiones arithmeticae[M].Waterhouse W C,New York:Springer-Verlag,1975.
  • 3Agrawal M,Kayal N,Saxena N. Primes is in P[J].Annals of Mathematics,2004,(02):781-793.doi:10.4007/annals.2004.160.781.
  • 4Granville A. It is easy to determine whether a given integer is prime[J].Bulletin of the American Mathematical Society(New Series),2004,(01):3-38.
  • 5Atkin A O L,Morain F. Elliptic curves and primality proving[J].Mathematics of Computation,1993.29-68.
  • 6Rivest R L,Shamir A,Adleman L. A method for obtaining digital signatures and public key cryptosystems[J].Communications of the ACM,1978,(02):120-126.
  • 7Lehman R S. Factoring large integers[J].Mathematics of Computation,1974,(126):637-646.
  • 8McKee J F. Turning Euler's factoring methods into a factoring algorithm[J].Bulletin of London Mathematical Society,1996,(04):351-355.doi:10.1112/blms/28.4.351.
  • 9Pollard J M. Theorems on factorization and primality testing[J].Proc of Cambridge Philosophy Society,1974,(03):521-528.
  • 10Strassen V. Einige resultate über berechnungskomplexit(a)t[J].Jahresbericht der Deutschen Mathematiker-Vereinigung,1997.1-84.

共引文献3

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部