TW202244765A - Public key QR code encryption method and applications thereof capable of effectively reducing the probability of the QR code being maliciously decrypted to improve the security of QR code transmission - Google Patents

Abstract

The present invention discloses a public key QR code encryption method and applications thereof, in which the plaintext QR code is subjected to Arnold conversion to disrupt and rearrange the positioning area and the coded data area of the plaintext QR code, so that every point inside the plaintext QR code can perform periodic conversion to form a secret gold key pair, and then the gold key pair is used to encrypt the plaintext QR code to generate a public key type ciphertext QR code, as a result, the QR code can be transmitted securely to a receiving end by using the way of generating the public key, in addition, the QR code is undeniable after it is sent out, so as to effectively reduce the probability of being maliciously decrypted, thereby improving the security of QR code transmission.

Description

Public key encryption QR code method and its application

The invention relates to a public key encryption QR code method and its application, in particular to a public key encryption QR code technology that uses the method of generating a public key so that the QR code can be securely transmitted to the receiving end and has non-repudiation characteristics.

Press, generally common QR codes are square and black and white, the specific pattern is shown in Figure 5. The three corners of the QR code are positioning areas 11, and the three positioning areas 11 present a pattern of a character "Hui". The pattern of the three positioning areas 11 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, thus making the QR code the most common and accepted one at present. Encoding method, its applications include digital coupons, business transactions, verification functions and providing URL links. In addition, as shown in Figure 6, the encoding/decoding process of a traditional QR code can be divided into the following three steps:

1. Data encoding/decoding steps.

2. Correct the encoding (RS code encoding/decoding) step.

3. Fill in/take out encoding format steps.

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 and BCH codes), 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 cause the QR code to be easily read. The information was found inside. Therefore, in order to keep the QR confidential The content of the code, the QR code covers the 12th area of the RS code encoding data with a garbled pattern called a mask pattern (Mask Pattern).

The mask pattern of the traditional QR code takes the QR code version as an example, it has eight mask patterns as shown in Figure 7. The mask pattern is mainly to protect the RS coded data area other than the positioning area and the format data area. The data to be protected by the mask pattern is the gray area of the coded data area 12 shown in Figure 5: Figure 6 shows the coded data area of the QR code /decoding block hints. The data to be encoded is firstly coded in the block of data, and the output of the block is a data of a two-byte string, and then the data of the two-byte string is arranged into eight bits as a data form of a symbol for RS coding, RS The character code data after code encoding will be filled in the code data area 12 according to the format of the QR code, and then select a mask and perform XOR operation with the RS code code data area of the original QR code to generate a confidential QR code, and finally the error tolerance level Carry out BCH code encoding with the mask type data and fill in the BCH code data area 13 shown in FIG. 5 . In addition, when the mask pattern is selected, the fault-tolerant level data and mask type data can be encoded with BCH codes. Therefore, it can be said that in addition to positioning information, the QR code also includes RS codes, as shown in the coded data area 12 in Figure 5 BCH code and BCH code data area 13 as shown in FIG. 5 .

Although the mask pattern of the traditional QR code has preliminary security and confidentiality, it only has eight mask patterns, so that the probability of being maliciously cracked is more likely to occur due to the lack of variability of the mask pattern, thereby reducing the transmission of the QR code The security, thus causing the use of safety concerns. Known from the above, the known technology is indeed not perfect, and there is still a need for further improvement.

The reason is that how to develop a QR code generation technology that uses the method of generating a public key to allow the QR code to be transmitted confidentially to the receiving end and reduce the probability of being maliciously cracked has become a related technology. Based on the urgent needs of related industries, the inventors of the present invention have finally developed A kind of present invention that is different from above-mentioned prior art and above-disclosed patent.

The main purpose of the present invention is to provide a public key encryption QR code method and its application, mainly to use the way of generating public key to make the QR code can be transmitted to the receiving end in a confidential manner, and the QR code has the characteristic of non-repudiation after sending out , to effectively reduce the probability of being maliciously cracked, thereby improving the security of QR code transmission. The technical means to achieve the main purpose of the present invention is to perform Arnold conversion on the plaintext QR code, so as to disrupt and rearrange the positioning area and the coded data area of the plaintext QR code, so that every point inside the plaintext QR code is periodically converted, so that A confidential key pair is formed, and then the plaintext QR code is encrypted with the key pair to generate a public key type ciphertext QR code.

10: QR code

11: Positioning area

12: Coding data area

13: BCH code data area

20: Third-party notary terminal unit

30: Transmitter unit

40: Receiver unit

50: Network communication unit

T: plain text QR code

E: Cipher text QR code

B ₁ : the first public key

B ₂ : Second public key

C ₁ : the first private key

C ₂ : Second private key

Fig. 1 is a schematic diagram of the implementation framework of the system of the present invention.

Fig. 2 is a schematic diagram of the implementation of the public key encryption QR code of the present invention.

Fig. 3 is a schematic diagram of the implementation of the conversion, dispersal and rearrangement of the positioning area and the coding data area of the QR code according to the present invention.

Fig. 4 is a schematic diagram of the implementation of various mask patterns generated by periodic Arnold transformation in the present invention.

Fig. 5 is a schematic diagram of implementing a specific pattern of a traditional QR code.

FIG. 6 is an implementation schematic diagram of the encoding/decoding steps of a traditional QR code.

FIG. 7 is a schematic diagram of implementing a mask pattern of a traditional QR code.

In order to allow your review committee to further understand the overall technical characteristics and The technical means for achieving the object of the present invention are described in detail as follows with specific embodiments and drawings:

Please cooperate and refer to shown in Fig. 1～4, in order to reach the concrete embodiment of main purpose of the present invention, system comprises the following steps:

(a) The step of providing the QR code 10 is to provide the plaintext QR code T to be encrypted.

(b) The QR code 10 conversion step is to perform Arnold conversion on the plaintext QR code T, so as to scramble and rearrange the positioning area 11 and the coded data area 12 of the plaintext QR code T, so that every point inside the plaintext QR code T is periodically conversion to form a confidential key pair, and then use the key pair to encrypt the plaintext QR code T to generate a public key type ciphertext QR code E.

Specifically, the Arnold transformation is expressed as:

，A為矩陣

，p為該QR碼10 的邊長大小，該QR碼10內部每一點為(x,y)。

, A is a matrix

, p is the side length of the QR code 10, and each point inside the QR code 10 is (x, y).

During the Arnold conversion process, a confidential conversion matrix is formed, and the conversion matrix is divided into the at least one key pair; the at least one key pair includes a first public key B ₁ and a first public key corresponding to each other. The private key C ₁ corresponds to a second public key B ₂ and a second private key C ₂ .

The first public key B ₁ and the second public key B ₂ are expressed as:

，其中，n為Arnold轉換的週期數，k1 為第一秘密常數，k2為第二秘密常數。

, where n is the cycle number of Arnold transformation, k1 is the first secret constant, and k2 is the second secret constant.

Please refer to the embodiment shown in Figure 2, the ciphertext QR code (E) is expressed as: E=E _B2 (E _C1 (T)), the E _B2 is the second public key encryption, and the E _C1 is the first Private key encryption; the plaintext QR code (T) is expressed as: T=D _C2 ( _DB1 (E)), the DC ₂ is decrypted by the second private key, and the _DB1 is decrypted by the first public key.

Concretely, please cooperate and refer to shown in Figure 6, before this QR code 10 provides steps, further include the following steps (this step is the same as the prior art):

(c) The data encoding step is to convert the data message into binary string data.

(d) Correct the coding step, arrange the binary string data into a data form in which eight bits are a symbol for RS code coding.

(e) The QR code 10 filling step is to fill in the encoded data area 12 with the character code data encoded by the RS code according to the format of the QR code 10 .

(f) a mask operation step, select a mask and perform XOR operation with the RS code encoding data area 12 of the QR code 10 to generate the plaintext QR code.

(g) BCH code filling step, carry out the BCH code encoding of the error tolerance level and mask type data into the BCH code data area 13 of the QR code 10 .

Please refer to Figures 1 to 2 which show an encryption system using the above-mentioned public key encryption method for QR codes according to the present invention, wherein the at least one key pair includes a first public key B1 and a _first private key corresponding to each other C ₁ corresponds to a second public key B ₂ and a second private key C ₂ ; the encryption system includes a third-party notarization unit 20, a transmission unit 30, at least a receiving unit 40 and a network A communication unit 50, the network communication unit 50 is used to provide a signal connection between the transmitting unit 30, the third-party notary unit 20 and the at least one receiving unit 40; the third-party notary unit 20 is used to provide the The first public key B ₁ and the second public key B ₂ ; the transmission end unit 30 is used to generate the plaintext QR code, and the first private key C ₁ stored in it and the third-party notary end unit 20 The provided _second public key B2 performs the step of converting the QR code 10 to obtain the ciphertext QR code, and then transmits the ciphertext QR code to the at least one receiving end unit 40 for decoding; the at least one receiving end When the unit 40 decodes, it uses the stored second private key C ₂ and the first public key B ₁ provided by the third-party notary unit 20 to decode to obtain the plaintext QR code.

As mentioned above, when at least one receiver unit 40 obtains the plaintext QR code, the steps of extracting the format of the QR code 10 , RS decoding and data decoding are performed to obtain a completely decrypted data message.

In short, the present invention mainly proposes a QR code 10 technology applied to the public key encryption method. The public key encryption QR code uses the mathematical Arnold transformation to generate the public key. The advantage of this method is that the QR code can be sent to the other party confidentially by using the method of generating the public key, and the QR code has the characteristic of non-repudiation after sending out. In this invention, we propose a public-key encrypted QR code. The public-key QR code uses public-key encryption by changing the mask pattern. The present invention mainly utilizes Arnolda conversion to generate a public key mask area for mask protection of the QR code 10 .

Assume that the positioning area 11 and coded data area 12 of a QR code are shown in FIG. 5 . The public key encrypted QR code uses rearrangement to scramble the data of the QR code (including the positioning area 11 and the data area) to make it confidential. The method of scrambling is converted by Arnold. The Arnold transformation is described as follows: Suppose there is a point inside a QR code 10 as (x, y).

Z ⁺，且行列式|A|=1，而p為QR碼10的邊長大小。上述運算具有下列幾個特性： where a _i

Z ⁺ , and the determinant | A |=1, and p is the side length of QR code 10. The above operation has the following properties:

1. The conversion T _a is periodic, and the periodicity is related to the content value of A , that is, each point ( x , y ) inside the QR code 10 will return to its original position in a period PT _.

2. Converting T _a can evenly disperse the points inside the QR code.

3. The periodicity of switching T _a is random.

We use the following example to illustrate, assuming a matrix A is:

We can easily find that | A |=1. Now we convert each point ( x , y ) inside the QR code 10 as follows:

The above-mentioned Arnold conversion can be found by experiments, and the converted QR code will have 24 cycles. But this is the cycle generated by the matrix A , and different A will have different cycle numbers. We can express the conversion process as follows:

When n=1~24, each mapping point is different, but the point ( x , y ) will return to the origin at the 25th mapping. The experimental results are shown in Figure 4.

In the above conversion process, we divide the conversion matrix into two keys, public key B and private key C. Assuming that there is a secret constant k, the key generation method is as follows:

Taking the above as an example, if k = 17, the public key is:

The private key is:

The method of generating public and private keys can be illustrated by the above example, and the following is the generation process of the public key encryption QR code as shown in Figure 5.

Take the above example as an example, assuming that the left side of Figure 2 is the transmission end, and there is a third notary to keep the public key:

and

And the corresponding private key is:

and

T，而加密端進行以下運算： Assume ( x _i , y _i )

T , and the encryption side performs the following operations:

and

E。另外，在解密端進行運算如下： In the above ( x ", y ")

E. In addition, the operation on the decryption side is as follows:

In the decoding process, as long as the ciphertext QR code E is arbitrarily transmitted to anyone, because only the recipient with the _second private key C2 can decrypt it, except for using the _second private key C2. During the decryption process, the recipient also needs to use the sender's public key _first public key B1 to be able to see the plaintext QR code T. Therefore, the system has non-repudiation ( B ₁ ) in addition to confidentiality ( C ₂ ).

After the description of the above specific embodiments, the present invention has explained the public key encryption method, in order to cooperate with the existing QR code standard, we can use the mask method shown in Figure 7 to combine. The mask in Figure 7 is an example of the QR code version. The traditional method is to choose a mask style for XOR operation at the end, but if we use the public key encryption method, we can mask the QR code data of the traditional QR code , plus the above-mentioned public-key encryption method to form a QR code in public-key format. The public key encrypted QR code will have the feature of non-repudiation in addition to confidentiality compared with the traditional general 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. The structural features of the invention specifically defined in the claims are not found in similar items, and are practical and progressive, and have met the requirements of an invention patent. I file 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 maintain this invention. The legitimate rights and interests of the applicant.

20: Third-party notary terminal unit

30: Transmitter unit

40: Receiver unit

50: Network communication unit

Claims (9)

A method for encrypting a QR code with a public key, comprising: The step of providing the QR code is to provide a plain text QR code to be encrypted; and The QR code conversion step is to perform Arnold conversion on the plaintext QR code to scramble and rearrange the positioning area and coded data area of the plaintext QR code, so that every point inside the plaintext QR code is periodically converted to form At least one key pair with confidentiality, and then use the at least one key pair to encrypt the plaintext QR code to generate a public key type ciphertext QR code. The public key encryption QR code method as described in Claim 1, wherein the Arnold conversion is expressed as:

, A is a matrix

, p is the side length of the QR code, and each point inside the QR code is (x, y). The public key encryption QR code method as described in Claim 1, wherein, in the process of the Arnold transformation, a confidential transformation matrix is formed, and the transformation matrix is divided into the at least one key pair; the at least one key The pair includes a first public key B ₁ and a first private key C ₁ corresponding to each other, and a second public key B ₂ and a second private key C ₂ corresponding to each other. The public key encryption QR code method as described in Claim 3, wherein the _first public key B1 and the _second public key B2 are expressed as:

Among them, n is the cycle number of the Arnold transformation, k1 is the first secret constant, and k2 is the second secret constant. The public key encryption QR code method as described in Claim 3, wherein the first private key C ₁ and the second private key C ₂ are expressed as:

Wherein, k1 is the first secret constant, and k2 is the second secret constant. The public key encryption QR code method as described in claim item 3, wherein, the ciphertext QR code (E) is expressed as: E=E _B2 (E _C1 (T)), the E _B2 is the second public key encryption, the E _C1 is encrypted by the first private key; the plaintext QR code (T) is expressed as: T=D _C2 (D _B1 (E)), the DC ₂ is decrypted by the second private key, and the D _B1 is decrypted by the first public key . The method for encrypting a QR code with a public key as described in Claim 1, wherein the following steps are further included before the step of providing the QR code: The data encoding step is to convert the data message into binary string data; Correct the encoding step, arrange the binary string data into a data form in which eight bits are a symbol for RS code encoding; The step of filling in the QR code is to fill in the coded data of the RS code in the coded data area according to the format of the QR code; The mask operation step is to select a mask and the RS code encoding data area of the QR code to perform XOR operation to generate the plaintext QR code; and The BCH code filling step is to encode the error tolerance level and mask type data into the BCH code data area of the QR code. An encryption system according to the public key encryption QR code method as described in Claim 1, wherein the at least one key pair includes a first public key B ₁ corresponding to each other and a first private key C ₁ corresponding to each other. A second public key B ₂ and a second private key C ₂ ; the encryption system includes a third-party notary end unit, a transmission end unit to at least one receiving end unit and a network communication unit, and the network communication unit uses To provide a signal connection between the transmitting unit, the third-party notary unit and the at least one receiving unit; the third-party notary unit is used to provide the first public key B ₁ and the second public key B ₂ ; The transmission end unit is used to generate the plaintext QR code, and perform the QR code conversion step with the stored first private key C ₁ and the second public key B ₂ provided by the third-party notary end unit, To obtain the ciphertext QR code, then transmit the ciphertext QR code to the at least one receiver unit for decoding; when the at least one receiver unit decodes, it uses the stored _second private key C2 and the The _first public key B1 provided by the third-party notary unit is decoded to obtain the plaintext QR code. The encryption system as described in Claim 8, wherein, when the at least one receiver unit obtains the plaintext QR code, it performs the step of extracting the QR code format, RS decoding step and data decoding step, and then obtains a completely decrypted data message.

Images