TWI783895B - QR code verification system and method of random RS code - Google Patents

QR code verification system and method of random RS code Download PDF

Info

Publication number
TWI783895B
TWI783895B TW111112924A TW111112924A TWI783895B TW I783895 B TWI783895 B TW I783895B TW 111112924 A TW111112924 A TW 111112924A TW 111112924 A TW111112924 A TW 111112924A TW I783895 B TWI783895 B TW I783895B
Authority
TW
Taiwan
Prior art keywords
code
access control
control system
random
server
Prior art date
Application number
TW111112924A
Other languages
Chinese (zh)
Other versions
TW202340987A (en
Inventor
林基源
王俊傑
張錫淵
郭振洋
洪宗尚
林子雁
Original Assignee
國立勤益科技大學
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by 國立勤益科技大學 filed Critical 國立勤益科技大學
Priority to TW111112924A priority Critical patent/TWI783895B/en
Application granted granted Critical
Publication of TWI783895B publication Critical patent/TWI783895B/en
Publication of TW202340987A publication Critical patent/TW202340987A/en

Links

Images

Abstract

本發明係揭露一種隨機式RS碼之QR碼驗証系統及方法，其包括門禁系統、資訊裝置及伺服器端。伺服器端與門禁系統及資訊裝置資訊連結，當資訊裝置位於門禁系統有效距離內時，經伺服器端確認有效距離後，則對資訊裝置發送QR碼驗証碼，門禁系統將所接收到之QR碼驗証碼進行影像擷取後回傳至伺服器端，經伺服器端驗證為正確時，則對門禁系統發出解鎖訊號，經門禁系統解碼確認後進行解鎖；其中，當伺服器端對資訊裝置發送QR碼驗証碼的同時，則將QR碼驗証碼之RS碼的產生多項式進行隨機改變，以產生改變產生多項式g i (x)，並將改變產生多項式g i (x)回傳給門禁系統，使門禁系統做出QR碼驗証碼錯誤更正的步驟，俾能藉由改變產生多項式而產生非標準型式的QR碼，由於非使用一般標準QR碼的解碼方法進行回復明文，所以在QR碼驗証上會有較佳的安全保密效果。 The invention discloses a random RS code QR code verification system and method, which includes an access control system, an information device and a server end. The server side is connected with the access control system and the information device information. When the information device is within the effective distance of the access control system, after the server side confirms the effective distance, it will send a QR code verification code to the information device, and the access control system will receive the QR code The code verification code is sent back to the server after the image is captured. When the server verifies that it is correct, it will send an unlock signal to the access control system, which will be unlocked after being decoded and confirmed by the access control system; While sending the QR code verification code, randomly change the generation polynomial of the RS code of the QR code verification code to generate a change generation polynomial g i ( x ), and send the change generation polynomial g i ( x ) back to the access control system , so that the access control system can make a QR code verification code error correction step, so that a non-standard QR code can be generated by changing the polynomial. Since the decoding method of the general standard QR code is not used to reply to the plain text, so in the QR code verification There will be better security and confidentiality effect.

Description

隨機式RS碼之QR碼驗証系統及方法 QR code verification system and method of random RS code

本發明係有關一種隨機式RS碼之QR碼驗証系統及方法，尤指一種可以藉由改變產生多項式而產生非標準型式QR碼的門禁驗證技術。 The present invention relates to a QR code verification system and method of a random RS code, in particular to an access control verification technology that can generate a non-standard QR code by changing the generating polynomial.

依據所知，一般常見的QR碼係呈正方形，而且為黑白二種顏色。在QR碼三個邊角係為定位區，該三定位區呈現出略呈「回」字的圖案。該三定位區的圖案主要是幫助解碼軟體來定位圖案，使用者不需要對準，無論以任何角度掃描，資料仍然可以正確被讀取，因而使得QR碼已然成為目前最為普遍與接受的一種編碼方式。在QR碼中主要的技術核心是利用Reed-Solomon與BCH更正碼進行叢集錯誤的更正。當QR碼經過資料編碼、更正編碼(包含RS碼與BCH碼)後，因為QR碼上的資料是可以直接觀查到其資料特性，如補齊符號的重覆位置，這樣子會造成QR碼容易被發現內部的資料。其中，RS碼為一線性區塊碼(linear block code)，是非二元BCH碼(nonbinary BCH codes)的一種特例。主要是將每一訊息(message)區塊加入額外資料以達到訊息保護的作用，這些額外資料稱為奇偶查核元/符號元，以方便解碼端利用此訊息來做錯誤更正的動作。 As far as we know, the common QR code is square and has two colors of black and white. The three corners of the QR code are positioning areas, and the three positioning areas present a pattern of the word "Hui". The pattern of the three positioning areas is mainly to help the decoding software to locate the pattern. The user does not need to align. No matter scanning at any angle, the data can still be read correctly, so that the QR code has become the most common and accepted code at present. Way. The main technical core in QR codes is to use Reed-Solomon and BCH correction codes to correct cluster errors. After the QR code has undergone data coding and correction coding (including RS code and BCH code), because the data on the QR code can directly observe its data characteristics, such as filling in the repeated position of the symbol, this will result in a QR code. Easy to find internal information. Wherein, the RS code is a linear block code, which is a special case of nonbinary BCH codes. The main purpose is to add extra data to each message block to achieve the function of message protection. These extra data are called parity check elements/symbol elements, so that the decoder can use this information to perform error correction operations.

再者，驗証系統是目前網路安全非常重要的一環，網路系統中伺服器-使用者型態(Client-server model)的網路服務是一種常態，因此，考 慮如此的驗証方法是非常重要且具實用性的網路安全通訊方式。一般QR碼用於驗証系統中是非常常見的方式，由於QR碼的主要功能是讓使用者簡單且方便的獲得或傳送資料，以致QR碼本身在安全保護上的考量就顯得不是非常完善，一般在傳統的加密系統會利用一些難以破解之暗門進行明文的保護。此外，一般在編碼學中，如果使用一個隨機沒有固定結構的同位查核矩陣時，被証明是具有NP-complete的解碼問題有如下所示： Furthermore, the authentication system is a very important part of the current network security. In the network system, the server-user model (Client-server model) network service is a kind of normality. Therefore, considering Considering such an authentication method is a very important and practical way of network security communication. Generally, QR codes are very common in authentication systems. Since the main function of QR codes is to allow users to obtain or transmit data easily and conveniently, the safety protection considerations of QR codes themselves are not very perfect. In the traditional encryption system, some hard-to-crack secret doors are used to protect the plaintext. In addition, generally in coding, if a random parity check matrix with no fixed structure is used, the decoding problem that is proved to be NP-complete is as follows:

1.最大似然函數解碼問題。 1. Maximum likelihood function decoding problem.

2.徵狀解碼問題。 2. Symptom decoding problem.

上述二個解碼問題在沒有特定碼結構情況下是難以用有效演算法進行求解的。這二個問題的主要求解都與同位查核矩陣H有關。一般而言，可以對同位查核矩陣H進行高斯消去法產生出公鑰矩陣與私鑰矩陣，無法得知私鑰矩陣的情況下是難以進行上述兩問題去暴力求解密秘隱匿資料。在RS碼編碼過程則會產生多項與補齊符號兩項參數，因而產生的圖形化QR碼本身為標準型式，由於使用一般標準QR碼解碼方法即可進行回復明文，所以標準之QR碼在驗証上則會造成保密效果較差的情事產生，因而使得QR碼在驗證安全性不足的資安問題產生。 The above two decoding problems are difficult to solve with effective algorithms without a specific code structure. The main solutions to these two problems are related to the parity check matrix H. Generally speaking, the Gaussian elimination method can be performed on the parity check matrix H to generate the public key matrix and the private key matrix. If the private key matrix is not known, it is difficult to solve the above two problems to brute force the secret hidden information. In the RS code encoding process, two parameters, multiplicity and complement symbol, will be generated. The resulting graphic QR code itself is a standard type. Since the normal standard QR code decoding method can be used to reply plain text, the standard QR code is verified. The above will result in poor confidentiality, thus causing the information security problem of insufficient verification security of the QR code.

有鑑於此，如何開發出一種可以藉由改變產生多項式而產生非標準型式QR碼的QR碼驗證技術，實已成為相關技術領域業者所亟欲挑戰與解決的技術課題，而且基於相關產業的迫切需求之下，本發明人等乃憑藉多年之實務經驗及相關的專業知識，經不斷的努力研發之下，終於研發出一種有別於上述習知技術與前揭專利的本發明。 In view of this, how to develop a QR code verification technology that can generate non-standard QR codes by changing the polynomial has become a technical issue that industry players in related technical fields want to challenge and solve urgently. In response to the need, the inventors, relying on years of practical experience and relevant professional knowledge, and through continuous efforts in research and development, finally developed an invention that is different from the above-mentioned conventional technology and the previously disclosed patent.

本發明第一目的，在於提供一種隨機式RS碼之QR碼驗証系統及方法，主要是藉由改變產生多項式而產生非標準型式的QR碼，由於非使用一般標準QR碼的解碼方式進行回復明文，所以在QR碼驗証上會有較佳的安全保密效果以及安全保護功能上的加強作用。達成本發明第一目的之技術手段，係包括門禁系統、資訊裝置及伺服器端。伺服器端與門禁系統及資訊裝置資訊連結，當資訊裝置位於門禁系統有效距離內時，伺服器端確認有效距離後，則對資訊裝置發送QR碼驗証碼，門禁系統將資訊裝置所接收到之QR碼驗証碼進行影像擷取後回傳至伺服器端，經伺服器端驗證為正確時，則對門禁系統發出解鎖訊號，經門禁系統解碼確認後進行解鎖；其中，當伺服器端對資訊裝置發送QR碼驗証碼的同時，則將QR碼驗証碼之RS碼的產生多項式進行隨機改變，以產生改變產生多項式g i (x)，並將該改變產生多項式g i (x)回傳給門禁系統，使門禁系統做出QR碼驗証碼錯誤更正的步驟。 The first purpose of the present invention is to provide a QR code verification system and method for random RS codes, which mainly generate non-standard QR codes by changing the generator polynomial, and reply plaintext without using the decoding method of general standard QR codes. , so there will be a better security and confidentiality effect and a strengthening effect on the security protection function in the QR code verification. The technical means to achieve the first purpose of the present invention include access control system, information device and server end. The server side is connected with the access control system and the information device. When the information device is within the effective distance of the access control system, the server will send a QR code verification code to the information device after confirming the effective distance, and the access control system will receive the information received by the information device. The QR code verification code is captured and sent back to the server. When the server verifies that it is correct, it will send an unlock signal to the access control system, which will be unlocked after being decoded and confirmed by the access control system. Among them, when the server verifies the information When the device sends the QR code verification code, it randomly changes the generation polynomial of the RS code of the QR code verification code to generate a change generation polynomial g i ( x ), and sends the change generation polynomial g i ( x ) back to The access control system enables the access control system to make a step of correcting the error of the QR code verification code.

本發明第二目的，在於提供一種使RS字碼具備隨機特性的隨機式RS碼之QR碼驗証系統及方法，主要是利用補齊符號的隨機性改變而造成編碼完成後的RS字碼亦具隨機性的特性，以有效提升QR碼的隨機性與安全保密性。達成本發明第二目的之技術手段，係包括門禁系統、資訊裝置及伺服器端。伺服器端與門禁系統及資訊裝置資訊連結，當資訊裝置位於門禁系統有效距離內時，伺服器端確認有效距離後，則對資訊裝置發送QR碼驗証碼，門禁系統將資訊裝置所接收到之QR碼驗証碼進行影像擷取後回傳至伺服器端，經伺服器端驗證為正確時，則對門 禁系統發出解鎖訊號，經門禁系統解碼確認後進行解鎖；其中，當伺服器端對資訊裝置發送QR碼驗証碼的同時，則將QR碼驗証碼之RS碼的產生多項式進行隨機改變，以產生改變產生多項式g i (x)，並將該改變產生多項式g i (x)回傳給門禁系統，使門禁系統做出QR碼驗証碼錯誤更正的步驟。其中，當該伺服器端對該至少一資訊裝置發送該QR碼驗証碼的同時，則將該QR碼驗証碼之RS碼的補齊符號資料進行隨機修改而產生隨機補齊符號，並將該改變補齊符號資料回傳給該門禁系統，使利用該隨機補齊符號編碼完成的RS字碼具備隨機性。 The second purpose of the present invention is to provide a QR code verification system and method of a random RS code that makes the RS code have random characteristics, mainly using the randomness change of the completion symbol to cause the RS code after the encoding is also random. features to effectively improve the randomness and security of QR codes. The technical means to achieve the second objective of the present invention include access control system, information device and server. The server side is connected with the access control system and the information device. When the information device is within the effective distance of the access control system, the server will send a QR code verification code to the information device after confirming the effective distance, and the access control system will receive the information received by the information device. The QR code verification code is captured and sent back to the server. When the server verifies that it is correct, it will send an unlock signal to the access control system, which will be unlocked after being decoded and confirmed by the access control system. Among them, when the server verifies the information When the device sends the QR code verification code, it randomly changes the generation polynomial of the RS code of the QR code verification code to generate a change generation polynomial g i ( x ), and sends the change generation polynomial g i ( x ) back to The access control system enables the access control system to make a step of correcting the error of the QR code verification code. Wherein, when the server sends the QR code verification code to the at least one information device, it randomly modifies the complement symbol data of the RS code of the QR code verification code to generate a random complement symbol, and sends the The changed completion symbol data is sent back to the access control system, so that the RS code completed by the random completion symbol encoding has randomness.

10:門禁系統 10: Access control system

11:影像擷取裝置 11: Image capture device

12:識別模組 12: Identification module

13:磁吸鎖 13:Magnetic lock

20:資訊裝置 20:Information device

30:伺服器端 30: Server side

40:雲端連結系統 40: Cloud connection system

圖1係本發明具體實施的系統架構示意圖。 Fig. 1 is a schematic diagram of the system architecture of the embodiment of the present invention.

圖2係本發明具體應用架構的實施示意圖。 Fig. 2 is an implementation schematic diagram of a specific application framework of the present invention.

為讓 貴審查委員能進一步瞭解本發明整體的技術特徵與達成本發明目的之技術手段，玆以具體實施例並配合圖式加以詳細說明如下：請配合參看圖1~2所示，為達成本發明第一目的之第一具體實施例，係包括一門禁系統10、至少一可供使用者隨身攜帶的資訊裝置20(如智慧型手機)及一伺服器端30(如伺服器)。該伺服器端30係透過一雲端連結系統40(如4G、5G行動通訊系統；或是網際網路通訊系統)分別與門禁系統10及各資訊裝置20資訊連結，當資訊裝置20位於門禁系統10有效距離內時，則向伺服器端30要求傳送QR碼驗証碼，經伺服器端30確認為有效距離後，則對資訊裝置20發送QR碼驗証碼，該門禁系統10透過 影像擷取裝置11將資訊裝置20所接收到之QR碼驗証碼進行影像擷取後回傳至伺服器端30，經伺服器端30驗證QR碼驗証碼為正確時，則對門禁系統10發出解鎖訊號(如解鎖確認；或是金鑰；但不以此為限)，經門禁系統10解碼確認後，則對設於門上的磁吸鎖13進行解鎖的動作；其中，當伺服器端30對資訊裝置20發送QR碼驗証碼的同時，則將QR碼驗証碼之RS碼的產生多項式進行隨機改變，以產生改變產生多項式g i (x)，並將改變產生多項式g i (x)回傳給門禁系統10，使門禁系統10做出QR碼驗証碼錯誤更正的步驟，該改變產生多項式g i (x)表示為：g i (x)=<m i+1(x),m i+2(x),L,m i+2t (x)>，其中，i係g i (x)中相乘多項式之第一項的元素指數值，m為位元數，t為糾正錯誤的數目。 In order to allow your review committee to further understand the overall technical characteristics of the present invention and the technical means to achieve the purpose of the present invention, the specific embodiments are described in detail as follows with reference to the drawings: Please refer to Figures 1-2 for the purpose of achieving The first specific embodiment of the first object of the invention includes an access control system 10, at least one information device 20 (such as a smart phone) that can be carried by the user, and a server terminal 30 (such as a server). The server side 30 is connected to the access control system 10 and each information device 20 through a cloud connection system 40 (such as 4G, 5G mobile communication system; or Internet communication system). When the information device 20 is located in the access control system 10 When within the effective distance, then request the server end 30 to send the QR code verification code, after the server end 30 confirms that it is within the effective distance, then send the QR code verification code to the information device 20, and the access control system 10 passes through the image capture device 11 The QR code verification code received by the information device 20 is image-captured and sent back to the server end 30. When the server end 30 verifies that the QR code verification code is correct, an unlock signal is sent to the access control system 10 (such as unlocking confirmation; or a key; but not limited thereto), after the access control system 10 decodes and confirms, the magnetic suction lock 13 on the door is unlocked; While sending the QR code verification code, randomly change the generation polynomial of the RS code of the QR code verification code to generate a change generation polynomial g i ( x ), and send the change generation polynomial g i ( x ) back to the access control system 10. Make the access control system 10 make a QR code verification code error correction step, the change generates polynomial g i ( x ) expressed as: g i ( x )=< m i +1 ( x ), m i +2 ( x ),L, m i +2 t ( x )>, where, i is the element index value of the first term of the multiplication polynomial in g i ( x ), m is the number of bits, and t is the number of corrected errors.

具體的，當i=0,1,2,L,q m -2t-2，所產生之改變產生多項式g i (x)如下：

Figure 111112924-A0305-02-0007-6
，其中，α i 連續根多項式，L為糾錯等級。 Specifically, when i =0,1,2,L, q m -2 t -2, the generated polynomial g i ( x ) is as follows:
Figure 111112924-A0305-02-0007-6
, where, α i continuous root polynomial, L is the error correction level.

該改變產生多項式g i (x)之個數有N個，個數N則表示為：N=q m -2t-2，其中，q為進制。 The number of polynomials g i ( x ) generated by this change is N, and the number N is expressed as: N = q m -2 t -2, where q is a base.

請參看圖2所示，該門禁系統10包含一識別模組12(如RFID或是NFC讀取器)，每一資訊裝置20內建有一可供識別模組12識別的識別碼(如內建之RFID或NFC標籤所提供的識別碼)，當識別模組12感應到識別碼時，則判定該使用者位於有效距離內，並發送一識別確認訊號至伺服器端30，使伺服器端30得以對該資訊裝置20發送QR碼驗証碼。 2, the access control system 10 includes an identification module 12 (such as RFID or NFC reader), and each information device 20 is built with an identification code that can be recognized by the identification module 12 (such as a built-in The identification code provided by the RFID or NFC tag), when the identification module 12 senses the identification code, it determines that the user is within the effective distance, and sends an identification confirmation signal to the server end 30, so that the server end 30 A QR code verification code can be sent to the information device 20 .

請配合參看圖1~2所示，為達成本發明第二目的之第二具體實施例，本實施例除了包括上述第一具體實施例的整體技術內容之外，當伺服器端30對資訊裝置20發送QR碼驗証碼的同時，則將QR碼驗証碼之RS碼的補齊符號資料進行隨機修改而產生隨機補齊符號，並將隨機補齊符號回傳給門禁系統10，使利用隨機補齊符號編碼完成的RS字碼具備隨機性。 Please refer to Fig. 1 ~ 2, in order to achieve the second specific embodiment of the second purpose of the present invention, in addition to including the overall technical content of the above-mentioned first specific embodiment, when the server end 30 pair information device 20. When sending the QR code verification code, the RS code of the QR code verification code is randomly modified to generate random completion symbols, and the random completion symbols are sent back to the access control system 10, so that the random completion symbols can be used to The RS character code completed by Qi symbol encoding has randomness.

承上所述，上述QR碼中的RS碼是使用編碼縮短(shorting)技術進行調整RS碼的長度以配合各種不同版本之QR碼大小。本實施例係使用隨機補齊符號以增加QR碼的隨機性與安全性，至於進行隨機修改而產生隨機補齊符號的步驟如下列所示： As mentioned above, the RS codes in the above QR codes use code shortening (shorting) technology to adjust the length of the RS codes to match the sizes of various versions of the QR codes. In this embodiment, random padding symbols are used to increase the randomness and security of the QR code. The steps for generating random padding symbols for random modification are as follows:

步驟一，選擇一個長度為n'=2 m -1>n之本原(primitive)長度之RS碼，其中n是欲產生對RS碼的碼長。 Step 1: Select a RS code with a primitive length of n '= 2m -1> n , where n is the code length of the RS code to be generated.

步驟二，擇選欲更正之符號數t=2m，需產生(n',k'=2 m -1-2m)之RS碼，其中k'為RS碼的資料訊息長度。 Step 2, select the number of symbols to be corrected t = 2 m , and an RS code of ( n ', k '=2 m -1-2 m ) needs to be generated, where k ' is the data message length of the RS code.

步驟三，計算l=n'-n，產生QR碼所使用的(n,k=k'-l)RS碼，其中，訊息符號u需補齊l個佈於

Figure 111112924-A0305-02-0008-8
中的隨機符號r，所形成之新的訊息符號向量為：u'=[r k+l ,r k+l-1,L,r k+2,r k+1,u k ,u k-1,L,u 2,u 1]，其中，隨機符號r之產生方法為使用標準之11101100(十進制236)與00010001(十進制17)兩個符號隨機填滿l個位置。 Step 3, calculate l = n '- n to generate the ( n , k = k '- l ) RS code used in the QR code, where the message symbol u needs to be filled with l
Figure 111112924-A0305-02-0008-8
The random symbol r in , the new message symbol vector formed is: u '=[ r k + l , r k + l -1 ,L, r k +2 , r k +1 , u k , u k - 1 , L, u 2 , u 1 ], where the random symbol r is generated by using the standard 11101100 (decimal 236) and 00010001 (decimal 17) to randomly fill l positions.

步驟四，利用改變產生多項式g i (x)對訊息向量u'進行RS編碼後將l隨機符號r刪除後形成長度為n的新字碼。 Step 4: Perform RS encoding on the message vector u ' by changing the generator polynomial g i ( x ), delete l random symbol r , and form a new code word of length n .

簡言之，本發明是利用QR碼的方便性進行一個驗証的機制。由於QR碼內部是由一個RS碼與BCH碼所產生的一種編碼格式，所以本 發明係利用RS碼編碼過程所需產生多項式的改變與產生RS碼過程所需要的補齊符號兩項參數進行修改。其中，RS碼之產生多項式之修改方法是利用RS碼建構各種不同的產生多項式，這些產生多項式並不會改變原有QR碼的特性。至於補齊符號的部分則是利用補齊符號需要補滿RS碼之訊息符號的長度，因此，可以利用補齊符號的隨機性造成編碼完成後的RS字碼亦具隨機性。 In short, the present invention is a verification mechanism utilizing the convenience of QR codes. Since the inside of the QR code is a coding format generated by an RS code and a BCH code, this The invention utilizes the change of the polynomial generated in the coding process of the RS code and the complement symbol required in the process of generating the RS code to modify the two parameters. Among them, the modification method of the generator polynomial of the RS code is to use the RS code to construct various generator polynomials, and these generator polynomials will not change the characteristics of the original QR code. As for the part of the padding symbol, the length of the message symbol of the RS code needs to be filled up by using the padding symbol. Therefore, the randomness of the padding symbol can be used to make the encoded RS code also have randomness.

本發明提出一種使用QR碼圖形化的驗証方法進行安全保護功能上的加強。此方法是改變目前現有的QR碼標準所獲得，新式的QR碼由伺服器產生，其中產生的圖形化QR碼本身並非標準型式，由於無法使用一般標準QR碼解碼方法進行回復明文，所以比起使用標準之QR碼在驗証上會有更佳的保密效果。另外，為求不讓QR碼的驗証過程太過於複雜而影響QR碼使用上的方便性，本發明的保護方式是不影響QR碼解碼程序的方法進行設計，因此在QR碼之解碼複雜度不會因為增加其安全性而增加過多的解碼複雜度。 The invention proposes a QR code graphical verification method to strengthen the safety protection function. This method is obtained by changing the current existing QR code standard. The new QR code is generated by the server. The graphic QR code itself is not a standard type. Since it is impossible to use the general standard QR code decoding method to reply to the plain text, so compared to Using a standard QR code will have a better confidentiality effect in verification. In addition, in order not to make the verification process of the QR code too complicated and affect the convenience of using the QR code, the protection method of the present invention is designed in a way that does not affect the decoding procedure of the QR code, so the decoding complexity of the QR code is not high. It will add too much decoding complexity to increase its security.

本發明具體運作時，首先被分成以下的步驟實施： During concrete operation of the present invention, at first be divided into following steps and implement:

步驟1：使用者如果位於門禁系統10半徑R enable 內時即可向伺服器端30要求欲取得QR碼驗証碼。 Step 1: If the user is within the radius R enable of the access control system 10, he can ask the server 30 to obtain a QR code verification code.

步驟2：伺服器端30確認使用者是否於R enable 距離內，如果條件成立則發送QR碼驗証碼。同時，伺服器端30並送當下之RS碼之隨機產生之產生多項式g i (x)與隨機補齊符號位置至門禁系統10之處理器(MCU)。 Step 2: The server 30 confirms whether the user is within the Enable distance, and sends a QR code verification code if the condition is met. At the same time, the server 30 sends the random generated polynomial g i ( x ) of the current RS code and the position of the random complement symbol to the processor (MCU) of the access control system 10 .

步驟3：門禁系統10端之處理器(MCU)將使用者所接收到之QR碼驗証碼進行照像並回傳伺服器端30。 Step 3: The processor (MCU) at the access control system 10 takes a photo of the QR code verification code received by the user and sends it back to the server 30 .

步驟4：如果伺服器端30接收QR碼驗証碼後，並驗証正確則 回傳訊號給處理器(MCU)開鎖，否則回傳錯誤訊號給使用者。 Step 4: If the server end 30 receives the QR code verification code and verifies it is correct Return a signal to the processor (MCU) to unlock, otherwise return an error signal to the user.

較佳的，一個RS碼的基本建構方法是佈於基場

Figure 111112924-A0305-02-0010-2
的多項式分解如下：
Figure 111112924-A0305-02-0010-3
 Preferably, the basic construction method of an RS code is distributed in the base field
Figure 111112924-A0305-02-0010-2
The polynomial decomposition of is as follows:
Figure 111112924-A0305-02-0010-3

由上述多項式所形成之(n,k=n-2t,2t+1)的RS碼產生多項(generator polynomial)形式如下：g(x)=<m 1(x),m 2(x),L,m 2t (x)> The RS code (generator polynomial) formed by the above polynomial ( n , k = n -2 t , 2 t +1) is as follows: g ( x )=< m 1 ( x ), m 2 ( x ) ,L, m 2 t ( x )>

上述g(x)是由α i 連續根多項式所相乘獲得(本質元素α定義為本質多項式的根)，其RS產生字碼為：c(x)=u(x)g(x) The above-mentioned g ( x ) is obtained by multiplying polynomials with continuous roots of α i (the essential element α is defined as the root of the essential polynomial), and the character code generated by RS is: c ( x ) = u ( x ) g ( x )

上述之u(x)是訊息多項式。本案為求獲得可以更正2t個符號之RS碼且又可以產生不同於QR碼標準之產生多項式，本案定義新的產生多項式如下：g i (x)=<m i+1(x),m i+2(x),L,m i+2t (x)> The above u ( x ) is a message polynomial. In this case, in order to obtain an RS code that can correct 2 t symbols and generate a polynomial different from the standard QR code, this case defines a new polynomial as follows: g i ( x )=< m i +1 ( x ), m i +2 ( x ),L, m i +2 t ( x )>

其中產生多項式g i (x)為求不使用到m o (x)多項式，其中i指的是g i (x)中相乘多項式之第一項的元素指數值，因此，其值為i=0,1,2,L,q m -2t-2，所產生之不同於標準RS之產生多項式如下：g i (x)=(x-α i+1)(x-α i+2)L(x-α i+2t )=m i+1(x)m i+2(x)L m i+2t (x) Among them, the generating polynomial g i ( x ) is the polynomial m o ( x ) not used in the calculation, where i refers to the element index value of the first term of the multiplication polynomial in g i ( x ), so its value is i = 0,1,2,L, q m -2 t -2, the generated polynomial is different from the standard RS as follows: g i ( x )=( x -α i +1 )( x -α i +2 ) L( x -α i +2 t )= m i +1 ( x ) m i +2 ( x )L m i +2 t ( x )

因此，可以獲得不同於標準形成之QR碼之產生多項式g i (x)之個數N有： N=q m -2t-2 Therefore, the number N of polynomials g i ( x ) that can be obtained differently from the QR code formed by the standard is: N = q m -2 t -2

可供選擇。舉例1，在一個佈於場

Figure 111112924-A0305-02-0011-9
且可更正t=2個符號之新式QR碼之產生多項式的種類如下：g 0(x)=(x-α1)(x-α2)(x-α3)(x-α4) available. Example 1, in a distribution field
Figure 111112924-A0305-02-0011-9
And the types of polynomials that can correct the new QR code with t=2 symbols are as follows: g 0 ( x )=( x -α 1 )( x -α 2 )( x -α 3 )( x -α 4 )

g 1(x)=(x-α2)(x-α3)(x-α4)(x-α5) g 1 ( x )=( x -α 2 )( x -α 3 )( x -α 4 )( x -α 5 )

g 2(x)=(x-α3)(x-α4)(x-α5)(x-α6) g 2 ( x )=( x -α 3 )( x -α 4 )( x -α 5 )( x -α 6 )

g 3(x)=(x-α4)(x-α5)(x-α6)(x-α7) g 3 ( x )=( x -α 4 )( x -α 5 )( x -α 6 )( x -α 7 )

g 4(x)=(x-α5)(x-α6)(x-α7)(x-α8) g 4 ( x )=( x -α 5 )( x -α 6 )( x -α 7 )( x -α 8 )

g 5(x)=(x-α6)(x-α7)(x-α8)(x-α9) g 5 ( x )=( x -α 6 )( x -α 7 )( x -α 8 )( x -α 9 )

g 6(x)=(x-α7)(x-α8)(x-α9)(x-α10) g 6 ( x )=( x -α 7 )( x -α 8 )( x -α 9 )( x -α 10 )

g 7(x)=(x-α8)(x-α9)(x-α10)(x-α11) g 7 ( x )=( x -α 8 )( x -α 9 )( x -α 10 )( x -α 11 )

g 8(x)=(x-α9)(x-α10)(x-α11)(x-α12) g 8 ( x )=( x -α 9 )( x -α 10 )( x -α 11 )( x -α 12 )

g 9(x)=(x-α10)(x-α11)(x-α12)(x-α13) g 9 ( x )=( x -α 10 )( x -α 11 )( x -α 12 )( x -α 13 )

g 10(x)=(x-α11)(x-α12)(x-α13)(x-α14) g 10 ( x )=( x -α 11 )( x -α 12 )( x -α 13 )( x -α 14 )

除了上述g 0(x)為標準使用的RS碼產生多項式外，其他的N=10個產生多項式皆為可選擇的新式產生多項式g i (x),i≠0，使用新式的產生多項式可產生新的RS字碼，如果接收端無法獲知發送端之產生多項式g i (x)為何，則接收端無法進行解碼。 In addition to the above-mentioned g 0 ( x ) as the standard RS code generator polynomial, the other N = 10 generator polynomials are optional new generator polynomials g i ( x ), i ≠ 0, using the new generator polynomials can generate For the new RS code, if the receiving end cannot know what the generator polynomial g i ( x ) is at the sending end, the receiving end cannot decode it.

舉例2，如果利用QR碼我們可以得到：

Figure 111112924-A0305-02-0011-4
Example 2, if we use the QR code we can get:
Figure 111112924-A0305-02-0011-4

而形成之(255,255-2t-1,2t+1)RS碼，其中t是更正符號個數 的產生多項式為：<m i+1(x),m i+2(x),L,m i+2t (x)> And form the (255,255-2 t -1,2 t +1) RS code, where t is the generator polynomial of the number of correction symbols: < m i +1 ( x ), m i +2 ( x ),L, m i +2 t ( x )>

上述如果使用QR碼L等級糾錯則會使用到(255,248,7)的RS碼，其中所產生之所有新式的產生多項式(非標準產生多項式)有個數如下：N=256-6-2=248 If the above-mentioned QR code L-level error correction is used, the RS code of (255,248,7) will be used, and the numbers of all new generator polynomials (non-standard generator polynomials) generated in it are as follows: N =256-6-2= 248

簡言之，上述改變產生多項式g i (x)與隨機補齊符號等步驟是欲在使用者端與伺服器端30兩邊經由密秘通道進行協定，其中改變產生多項式g i (x)步驟主要的功能是欲將原始標準的QR碼中的產生多項式進行改變，以增加QR碼的安全性。至於隨機補齊符號步驟中的隨機補齊符號亦是將RS編碼所產生的同位查核符號進行隨機性的產生，因而無法讓破譯者可以得知RS編碼的同位查核符號。 In short, the above steps of changing the generation polynomial g i ( x ) and random padding symbols are intended to be negotiated between the user end and the server end 30 through a secret channel, and the steps of changing the generation polynomial g i ( x ) are mainly The function is to change the generator polynomial in the original standard QR code to increase the security of the QR code. As for the random complement symbol in the random complement symbol step, the parity check symbol generated by the RS code is randomly generated, so the cracker cannot know the parity check symbol of the RS code.

經由上述具體實施例的說明之後，本發明確實具有下列所述的特點： After the description of the above specific embodiments, the present invention does have the following characteristics:

1.本發明確實可以藉由改變產生多項式而產生非標準型式的QR碼，由於非使用一般標準QR碼的解碼方式進行回復明文，所以在QR碼驗証上會有較佳的安全保密效果以及安全保護功能上的加強作用。 1. The present invention can indeed generate a non-standard QR code by changing the polynomial. Since it does not use the decoding method of the general standard QR code to reply plain text, it will have better security and security effects in QR code verification. Enhancement of protective function.

2.本發明確實可使RS字碼具備隨機性，主要是利用補齊符號的隨機性改變而造成編碼完成後的RS字碼亦具隨機性，以有效提升QR碼的隨機性與安全性。 2. The present invention can indeed make the RS codes have randomness, mainly by using the randomness change of the filling symbols to cause the RS codes after coding to also have randomness, so as to effectively improve the randomness and security of the QR code.

以上所述，僅為本發明之可行實施例，並非用以限定本發明之專利範圍，凡舉依據下列請求項所述之內容、特徵以及其精神而為之其他變化的等效實施，皆應包含於本發明之專利範圍內。本發明所具體界定 於請求項之結構特徵，未見於同類物品，且具實用性與進步性，已符合發明專利要件，爰依法具文提出申請，謹請 鈞局依法核予專利，以維護本申請人合法之權益。 The above is only a feasible embodiment of the present invention, and is not intended to limit the patent scope of the present invention. Any equivalent implementation of other changes based on the content, features and spirit of the following claims should be Included in the patent scope of the present invention. Specifically defined by the invention The structural features in the requested item are not found in similar items, and are practical and progressive, and have met the requirements of an invention patent. I am filing an application in accordance with the law. I would like to ask the Jun Bureau to approve the patent in accordance with the law to protect the legitimate rights and interests of the applicant. .

10:門禁系統 10: Access control system

11:影像擷取裝置 11: Image capture device

13:磁吸鎖 13:Magnetic lock

20:資訊裝置 20:Information device

30:伺服器端 30: Server side

40:雲端連結系統 40: Cloud connection system

Claims (9)

一種隨機式RS碼之QR碼驗証系統，其包括：一門禁系統；至少一資訊裝置，其可供使用者攜帶；及一伺服器端，其透過一雲端連結系統分別與該門禁系統及該至少一資訊裝置資訊連結；當該至少一資訊裝置位於該門禁系統有效距離內時，則向該伺服器端要求傳送QR碼驗証碼；經該伺服器端確認為有效距離後，則對該至少一資訊裝置發送該QR碼驗証碼，該門禁系統以一影像擷取裝置將該至少一資訊裝置所接收到之該QR碼驗証碼進行影像擷取後回傳至該伺服器端，經該伺服器端驗證該QR碼驗証碼為正確時，則對該門禁系統發出解鎖訊號，經該門禁系統解碼確認後進行解鎖；其中，當該伺服器端對該至少一資訊裝置發送該QR碼驗証碼的同時，則將該QR碼驗証碼之RS碼的產生多項式進行隨機改變，以產生改變產生多項式g i (x)，並將該改變產生多項式g i (x)回傳給該門禁系統，使該門禁系統做出該QR碼驗証碼錯誤更正的步驟，該改變產生多項式g i (x)表示為：g i (x)=<m i+1(x),m i+2(x),L,m i+2t (x)>，其中，i係g i (x)中相乘多項式之第一項的元素指數值，m為位元數，t為糾正錯誤的數目，L為糾錯等級。 A QR code verification system of a random RS code, which includes: an access control system; at least one information device, which can be carried by a user; and a server, which is connected to the access control system and the at least An information device information link; when the at least one information device is located within the effective distance of the access control system, the server is required to send a QR code verification code; after the server confirms that it is within the effective distance, the at least one The information device sends the QR code verification code, and the access control system uses an image capture device to capture the image of the QR code verification code received by at least one information device and then returns it to the server. When the terminal verifies that the QR code verification code is correct, it sends an unlock signal to the access control system, and unlocks after being decoded and confirmed by the access control system; wherein, when the server sends the QR code verification code to at least one information device At the same time, the generation polynomial of the RS code of the QR code verification code is randomly changed to generate a change generation polynomial g i ( x ), and the change generation polynomial g i ( x ) is sent back to the access control system, so that the The access control system makes the step of correcting the error of the QR code verification code. The change produces a polynomial g i ( x ) expressed as: g i ( x )=< m i +1 ( x ), m i +2 ( x ),L , m i +2 t ( x )>, among them, i is the element index value of the first term of multiplication polynomial in g i ( x ), m is the number of bits, t is the number of correcting errors, and L is the error correction grade. 如請求項1所述之隨機式RS碼之QR碼驗証系統，其中，當i=0,1,2,L,q m -2t-2，所產生之該改變產生多項式g i (x)如下：
Figure 111112924-A0305-02-0014-7
，其中，α i 連續根多項式，L為糾錯等級。 The QR code verification system of the random RS code as described in Claim 1, wherein, when i =0,1,2,L, q m -2 t -2, the generated change generates polynomial g i ( x ) as follows:
Figure 111112924-A0305-02-0014-7
, where, α i continuous root polynomial, L is the error correction level. 如請求項1所述之隨機式RS碼之QR碼驗証系統，其中，該改變產 生多項式g i (x)之個數有N個，個數N表示為：N=q m -2t-2，其中q為進制。 The QR code verification system of the random RS code as described in claim item 1, wherein, the number of polynomials g i ( x ) generated by the change is N, and the number N is expressed as: N = q m -2 t -2 , where q is base. 如請求項1所述之隨機式RS碼之QR碼驗証系統，其中，該門禁系統包含一識別模組，該至少一資訊裝置內建有一可供該識別模組識別的識別碼，當該識別模組感應到該識別碼時，則判定該使用者位於該有效距離內，並發送一識別確認訊號至該伺服器端，使該伺服器端得以對該至少一資訊裝置發送該QR碼驗証碼。 The QR code verification system for random RS codes as described in Claim 1, wherein the access control system includes an identification module, and the at least one information device is built with an identification code that can be identified by the identification module. When the identification When the module senses the identification code, it determines that the user is within the effective distance, and sends an identification confirmation signal to the server, so that the server can send the QR code verification code to at least one information device . 如請求項1所述之隨機式RS碼之QR碼驗証系統，其中，當該伺服器端對該至少一資訊裝置發送該QR碼驗証碼的同時，則將該QR碼驗証碼之RS碼的補齊符號資料進行隨機修改而產生隨機補齊符號，並將該隨機補齊符號回傳給該門禁系統，使利用該隨機補齊符號編碼完成的RS字碼具備隨機性。 The QR code verification system of the random RS code as described in claim 1, wherein when the server sends the QR code verification code to at least one information device, the RS code of the QR code verification code is Randomly modify the supplementary symbol data to generate a random supplementary symbol, and send the random supplementary symbol back to the access control system, so that the RS code completed by using the random supplementary symbol has randomness. 如請求項5所述之隨機式RS碼之QR碼驗証系統，其中，進行隨機修改而產生該隨機補齊符號係包含下列步驟： The QR code verification system for random RS codes as described in Claim 5, wherein performing random modification to generate the random complement symbol includes the following steps: 步驟一，選擇一個長度為n'=2 m -1>n之本原(primitive)長度之RS碼，其中n是欲產生對RS碼的碼長； Step 1, selecting a RS code with a length of n '= 2m -1> n (primitive) length, wherein n is the code length to be generated for the RS code; 步驟二，擇選欲更正之符號數t=2m，需產生(n',k'=2 m -1-2m)之RS碼； Step 2, select the number of symbols to be corrected t = 2 m , and the RS code of ( n ', k '=2 m -1-2 m ) needs to be generated; 步驟三，計算l=n'-n，產生QR碼所使用的(n,k=k'-l)RS碼，其中訊息符號u需補齊l個佈於
Figure 111112924-A0101-13-0002-8
中的隨機符號r，所形成之新的訊息符號向量為：u'=[r k+l ,r k+l-1,L,r k+2,r k+1,u k ,u k-1,L,u 2,u 1]，其中，隨機符號r之產生方法為使用標準之11101100(十進制236)與00010001(十進制17)兩個符號隨機填 滿l個位置；及步驟四，利用該改變產生多項式g i (x)對訊息向量u'進行RS編碼後將l隨機符號r刪除後形成長度為n的新字碼；其中，k'為RS碼的資料訊息長度，
Figure 111112924-A0305-02-0016-10
為一個有限場，L為糾錯等級。 Step 3, calculate l = n '- n to generate the ( n , k = k '- l ) RS code used in the QR code, where the message symbol u needs to be filled with l
Figure 111112924-A0101-13-0002-8
The random symbol r in , the new message symbol vector formed is: u '=[ r k + l , r k + l -1 ,L, r k +2 , r k +1 , u k , u k - 1 , L, u 2 , u 1 ], wherein, the generation method of the random symbol r is to use the standard 11101100 (decimal 236) and 00010001 (decimal 17) to randomly fill up l positions; and step 4, use the Change the generator polynomial g i ( x ) to perform RS coding on the message vector u ', delete the l random symbol r , and form a new word code with a length of n ; where, k ' is the data message length of the RS code,
Figure 111112924-A0305-02-0016-10
is a finite field, and L is the error correction level. 一種隨機式RS碼之QR碼驗証方法，其包括提供一門禁系統、至少一可供使用者攜帶的資訊裝置及一伺服器端；該伺服器端係透過一雲端連結系統分別與該門禁系統及該至少一資訊裝置資訊連結；及該至少一資訊裝置位於該門禁系統有效距離內時，則可向該伺服器端要求傳送QR碼驗証碼；經該伺服器端確認有效距離後，則對該至少一資訊裝置發送該QR碼驗証碼，該門禁系統以一影像擷取裝置將該至少一資訊裝置所接收到之該QR碼驗証碼進行影像擷取後回傳至該伺服器端，經該伺服器端驗證該QR碼驗証碼為正確時，則對該門禁系統發出解鎖訊號，經該門禁系統解碼確認後進行解鎖；其中，當該伺服器端對該至少一資訊裝置發送該QR碼驗証碼的同時，則將該QR碼驗証碼之RS碼的產生多項式進行隨機改變，以產生改變產生多項式g i (x)，並將該改變產生多項式g i (x)回傳給該門禁系統，使該門禁系統做出該QR碼驗証碼錯誤更正的步驟，該改變產生多項式g i (x)表示為：g i (x)=<m i+1(x),m i+2(x),L,m i+2t (x)>，其中，i係g i (x)中相乘多項式之第一項的元素指數值，m為位元數，t為糾正錯誤的數目，L為糾錯等級。 A QR code verification method of a random RS code, which includes providing an access control system, at least one information device that can be carried by the user, and a server end; the server end is respectively connected to the access control system and the access control system through a cloud connection system The information link of the at least one information device; and when the at least one information device is located within the effective distance of the access control system, it can request the server to send a QR code verification code; after the effective distance is confirmed by the server, the At least one information device sends the QR code verification code, and the access control system uses an image capture device to capture the image of the QR code verification code received by the at least one information device and then returns it to the server. When the server side verifies that the QR code verification code is correct, it sends an unlock signal to the access control system, and unlocks after being decoded and confirmed by the access control system; wherein, when the server side sends the QR code verification code to at least one information device At the same time, the generation polynomial of the RS code of the QR code verification code is randomly changed to generate a change generation polynomial g i ( x ), and the change generation polynomial g i ( x ) is sent back to the access control system, Make the access control system make the step of correcting the error of the QR code verification code, the change produces a polynomial g i ( x ) expressed as: g i ( x )=< m i +1 ( x ), m i +2 ( x ) ,L, m i +2 t ( x )>, wherein, i is the element index value of the first term of multiplication polynomial in g i ( x ), m is the number of bits, t is the number of correcting errors, L is error correction level. 如請求項7所述之隨機式RS碼之QR碼驗証方法，其中，當i=0,1,2,L,q m -2t-2，所產生之該改變產生多項式g i (x)如下：
Figure 111112924-A0305-02-0017-5
，其中，α i 連續根多項式，L為糾錯等級。 The QR code verification method of the random RS code as described in Claim 7, wherein, when i =0,1,2,L, q m -2 t -2, the generated change generates polynomial g i ( x ) as follows:
Figure 111112924-A0305-02-0017-5
, where, α i continuous root polynomial, L is the error correction level. 如請求項7所述之隨機式RS碼之QR碼驗証方法，其中，該改變產生多項式g i (x)之個數有N個，個數N表示為：N=q m -2t-2，其中q為進制。 The QR code verification method of the random RS code as described in claim item 7, wherein the number of polynomials g i ( x ) generated by the change is N, and the number N is expressed as: N = q m -2 t -2 , where q is base.
TW111112924A 2022-04-01 2022-04-01 QR code verification system and method of random RS code TWI783895B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
TW111112924A TWI783895B (en) 2022-04-01 2022-04-01 QR code verification system and method of random RS code

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
TW111112924A TWI783895B (en) 2022-04-01 2022-04-01 QR code verification system and method of random RS code

Publications (2)

Publication Number Publication Date
TWI783895B true TWI783895B (en) 2022-11-11
TW202340987A TW202340987A (en) 2023-10-16

Family

ID=85794551

Family Applications (1)

Application Number Title Priority Date Filing Date
TW111112924A TWI783895B (en) 2022-04-01 2022-04-01 QR code verification system and method of random RS code

Country Status (1)

Country Link
TW (1) TWI783895B (en)

Citations (14)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
TW200816212A (en) * 2006-08-07 2008-04-01 Marvell World Trade Ltd System and method for correcting errors in non-volatile memory using product codes
CN102568608A (en) * 2012-02-24 2012-07-11 南京大学 Improved method for strengthening QR (Quick Response) code error correcting capability
TWI397061B (en) * 2010-05-06 2013-05-21 Nat Univ Chin Yi Technology Method of Correcting Errors for Symmetrical Product Codes
CN103595423A (en) * 2013-11-14 2014-02-19 天津大学 Reed-Solomon code error correcting method
TWM490173U (en) * 2014-04-24 2014-11-11 National Chin-Yi Univ Of Technology Encoding and decoding system for repeated accumulation product code
CN104915699A (en) * 2015-05-21 2015-09-16 中山大学 Matrix two-dimensional code RS decoding error correction method based on improved GS algorithm
CN105574572A (en) * 2015-12-24 2016-05-11 上海师范大学 Color quick response code and generation method thereof
CN105811999A (en) * 2016-02-29 2016-07-27 广东顺德中山大学卡内基梅隆大学国际联合研究院 Improved Koetter-Vardy (KV) algorithm based matrix type two-dimension code Reed-Solomon(RS) decoding error correction method
CN107909133A (en) * 2017-11-15 2018-04-13 深圳大学 Two-dimensional code generation method, Quick Response Code coding/decoding method and terminal
CN109313713A (en) * 2015-11-20 2019-02-05 凸版Tdk标签株式会社 Two dimensional code and its generation method, generating means, program, read method, reading device and management system
TW201916602A (en) * 2017-09-21 2019-04-16 大陸商北京三快在線科技有限公司 Method for correcting and decoding two-dimensional code, device, electronic equipment, and computer readable medium
CN109840576A (en) * 2019-01-18 2019-06-04 深圳大学 The generation method and coding/decoding method of anti-copying two dimensional code based on segmentation insertion
US11038530B2 (en) * 2015-11-19 2021-06-15 Westhold Corporation Error correction using cyclic code-based LDPC codes
CN113994626A (en) * 2019-05-22 2022-01-28 妙泰公司 Distributed data storage method and system with enhanced security, resiliency and control

Patent Citations (14)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
TW200816212A (en) * 2006-08-07 2008-04-01 Marvell World Trade Ltd System and method for correcting errors in non-volatile memory using product codes
TWI397061B (en) * 2010-05-06 2013-05-21 Nat Univ Chin Yi Technology Method of Correcting Errors for Symmetrical Product Codes
CN102568608A (en) * 2012-02-24 2012-07-11 南京大学 Improved method for strengthening QR (Quick Response) code error correcting capability
CN103595423A (en) * 2013-11-14 2014-02-19 天津大学 Reed-Solomon code error correcting method
TWM490173U (en) * 2014-04-24 2014-11-11 National Chin-Yi Univ Of Technology Encoding and decoding system for repeated accumulation product code
CN104915699A (en) * 2015-05-21 2015-09-16 中山大学 Matrix two-dimensional code RS decoding error correction method based on improved GS algorithm
US11038530B2 (en) * 2015-11-19 2021-06-15 Westhold Corporation Error correction using cyclic code-based LDPC codes
CN109313713A (en) * 2015-11-20 2019-02-05 凸版Tdk标签株式会社 Two dimensional code and its generation method, generating means, program, read method, reading device and management system
CN105574572A (en) * 2015-12-24 2016-05-11 上海师范大学 Color quick response code and generation method thereof
CN105811999A (en) * 2016-02-29 2016-07-27 广东顺德中山大学卡内基梅隆大学国际联合研究院 Improved Koetter-Vardy (KV) algorithm based matrix type two-dimension code Reed-Solomon(RS) decoding error correction method
TW201916602A (en) * 2017-09-21 2019-04-16 大陸商北京三快在線科技有限公司 Method for correcting and decoding two-dimensional code, device, electronic equipment, and computer readable medium
CN107909133A (en) * 2017-11-15 2018-04-13 深圳大学 Two-dimensional code generation method, Quick Response Code coding/decoding method and terminal
CN109840576A (en) * 2019-01-18 2019-06-04 深圳大学 The generation method and coding/decoding method of anti-copying two dimensional code based on segmentation insertion
CN113994626A (en) * 2019-05-22 2022-01-28 妙泰公司 Distributed data storage method and system with enhanced security, resiliency and control

Non-Patent Citations (2)

* Cited by examiner, † Cited by third party
Title
期刊 Chang, H. Y., Wang, J. J., Lin, C. Y., & Chen, C. H. An efficient matrix embedding technique by using submatrix transform for grayscale images. International Journal of Innovative Computing, Information and Control 15(4), 1565-1580 2019 http://www.ijicic.org/ijicic-150424.pdf; *
期刊 Chen, C. Y., Wang, J. J., Lin, C. Y., Wang, C. M., & Yu, C. Y. Sharing a Verifiable Secret Image using Forward Error Correction Code for Halftone Image. International Conference on Advanced on Information Technologies P. 118-1~P. 118-6 Apr. 2011 http://163.17.20.49/AIT2011/2011AIT論文全文/ft_297.pdf *

Also Published As

Publication number Publication date
TW202340987A (en) 2023-10-16

Similar Documents

Publication Publication Date Title
KR102560512B1 (en) data check
CN105825257B (en) Information hiding and hiding information extracting method and system based on two-dimensional bar code
CN101897165B (en) Method of authentication of users in data processing systems
CN101999132B (en) The strong authentication token of one-time password and signature is generated when credential server is verified
CN105099692B (en) Security verification method and device, server and terminal
US9800408B2 (en) Method of generating secure tokens and transmission based on (TRNG) generated tokens and split into shares and the system thereof
CN104601332B (en) A kind of enhanced dynamic two-dimension code Verification System and its authentication method
US8297510B1 (en) Mathematical method of 2D barcode authentication and protection for embedded processing
JP6489464B2 (en) Optical code, information transmission method, and authentication method
CN105099712A (en) Data encryption method based on double-code verification
US9613327B2 (en) Adapting an incremental information object
Huang et al. Efficient QR code secret embedding mechanism based on hamming code
CN106529977A (en) Anti-counterfeiting method and system with support of terminal memory based on WeChat public account
CN115664858A (en) Authentication data encryption and decryption system for network security
Xiong et al. QR-3S: A high payload QR code secret sharing system for industrial Internet of Things in 6G networks
Thomas et al. Multilevel Authentication using QR code based watermarking with mobile OTP and Hadamard transformation
TWI783895B (en) QR code verification system and method of random RS code
CN109462620A (en) One kind realizing password method for retrieving and system based on a variety of safety verification modes
Wan et al. Multiple security anti-counterfeit applications to QR code payment based on visual secret sharing and QR code
CN109902528B (en) Encoding and decoding method of two-dimension code
TWI763474B (en) Public key encryption QR code method and its application
CN113221131B (en) LWE-based QR code encryption and decryption method
Arjona López et al. Post-quantum biometric authentication based on homomorphic encryption and classic McEliece
Jiang et al. Efficient approximate message authentication scheme
CN106650870A (en) Access safety two-dimensional code generation method