基于商密算法二维码的研究与应用
[Abstract]:At present, the application of all kinds of QR codes is increasing gradually, which brings about the puzzlement of information security of QR codes. How to ensure the security of two-dimensional code data has become a key problem. In the past, online data verification by writing commodity numbers into the QR code could no longer guarantee data security. Anyone could easily copy the commercial code label by falsifying the data information of the QR code. Therefore, it is necessary to consider the anti-counterfeiting of information technology in order to achieve the requirement that it is difficult to be easily deciphered and forged. In this paper, a method of encrypting commodity information based on commercial cipher technology is proposed, which can not be recognized by common reader by using quotient encryption algorithm. Prevent others from generating encrypted anti-counterfeiting QR codes by falsifying data. The security of the two dimensional code information is improved, and the integrity and reliability of the two dimensional code data information are guaranteed. Based on the analysis of the phenomenon that the QR code is prone to incline and deformation in the photographed image, the image preprocessing technology is adopted to make the corrected QR code be read better. The main contents and work of this paper are as follows: 1. Based on the analysis of geometric deformation of two-dimensional code caused by illumination and shooting angle, morphological top hat transform is used to remove image shadow, and wavelet transform and ray enhancement are used to improve image contrast. According to the shape characteristics of the QR code, the irrelevant region in the image is deleted. Based on similarity matching, four vertices of two-dimensional code are located, and perspective transformation equation is established to correct the two dimensional code according to the vertex of two dimensional code. Increase the probability of code recognition. 2. The national commercial cipher algorithm is used to encrypt and calculate the two-dimension code information. The data encryption is used to ensure the security of the two-dimension code information, and the digital signature is used to ensure that the source of the two-dimensional code information can not be forged. The method of generating random number numbers is used to ensure the uniqueness of the encryption key and the security one at a time. Difficult to easily decipher and read. 3. According to the proposed method of encryption and processing of two-dimensional code information, a special quotient two-dimension code generation and recognition software is designed and compared with that of common reader. The experiments show that the QR code generated by the encryption method in this paper is difficult to be read correctly by the common reader, which ensures the security of information and the ability of anti-forgery. It shows the practicability of the anti-counterfeiting application of two-dimensional code.
【学位授予单位】:吉林大学
【学位级别】:硕士
【学位授予年份】:2016
【分类号】:TP391.44
【参考文献】
相关期刊论文 前10条
1 于学东;王恒义;;D9ing防伪码与二维码的介绍和比较[J];中国品牌与防伪;2015年11期
2 杨丽娟;孙红艳;李瑛;;RSA算法在QR码防伪技术中的应用[J];北华航天工业学院学报;2014年02期
3 伍娟;;基于国密SM4和SM2的混合密码算法研究与实现[J];软件导刊;2013年08期
4 黄珂;薛月菊;陈瑶;陈汉鸣;李鸿生;;QR码图像几何校正算法的研究[J];计算机工程与应用;2014年20期
5 马超;;数字图像处理算法在QR码识别中的应用[J];电子设计工程;2013年05期
6 孙荣燕;蔡昌曙;周洲;赵燕杰;杨金铭;;国密SM2数字签名算法与ECDSA算法对比分析研究[J];网络安全技术与应用;2013年02期
7 杨佳丽;高美凤;;一种QR码的预处理方法[J];计算机工程;2011年02期
8 孙丙;高美凤;;QR码在防伪技术中的应用[J];计算机安全;2010年09期
9 樊旭川;;“神奇的”GM码[J];中国自动识别技术;2009年01期
10 刘慧娟;;一种快速响应码图像的分割和校正方法[J];电子测量与仪器学报;2006年01期
相关硕士学位论文 前10条
1 袁淑芳;QR码识别技术研究及应用[D];东北石油大学;2014年
2 李陈伟;基于二维码的图书防伪技术研究[D];南京师范大学;2014年
3 欧福超;基于图像处理的QR码图像预处理的研究[D];山东大学;2014年
4 解龙;基于加密QR码的商品流通管理应用研究[D];北京印刷学院;2014年
5 李鹏;基于商密二维码和数字水印的防伪图码的研究与设计[D];吉林大学;2013年
6 刘辉武;基于Android的QR码识别及应用研究[D];吉林大学;2013年
7 谢仁康;非对称加密二维码防伪系统的设计[D];电子科技大学;2013年
8 卢镔;QR码识别方法研究及应用[D];南京理工大学;2013年
9 王伟玮;基于移动二维码技术的商品防伪系统的研究与应用[D];北京邮电大学;2013年
10 曾子剑;基于QR二维码编解码技术的研究与实现[D];电子科技大学;2010年
,本文编号:2343333
本文链接:https://www.wllwen.com/kejilunwen/ruanjiangongchenglunwen/2343333.html