METHOD AND APPARATUS FOR PUBLIC-KEY CRYPTOGRAPHY BASED ON STRUCTURED MATRICES
20210152348 · 2021-05-20
Inventors
Cpc classification
H04L9/3026
ELECTRICITY
H04L9/0861
ELECTRICITY
H04L9/30
ELECTRICITY
International classification
H04L9/08
ELECTRICITY
G06F17/11
PHYSICS
Abstract
A method of generating a public key and a secret key using a key generator is disclosed. The method includes acquiring an affine map and a secret central map, and generating a public key and a secret key using the affine map and the secret central map, in which the secret central map is expressed as a system of o multivariate quadratic polynomials, the system of o multivariate quadratic polynomials can be expressed as a structured matrix or a product of a submatrix of a structured matrix and a vector when v linear equations and v variables defined on a finite field are given.
Claims
1. A method of generating a public key and a secret key using a key generator comprising: acquiring an affine map {tilde over (T)} and a map (:
.sup.n.fwdarw.
.sub.q.sup.m); and generating a public key (
=
∘T) and a secret key (
, {tilde over (T)}) and a secret key using the affine map and the map, wherein the map (
:
.sup.n.fwdarw.
.sub.q.sup.m) is expressed as a system (
.sub.V.sup.(1), . . . ,
.sub.V.sup.(o)) of O multivariate quadratic polynomials, the system (
.sub.V.sup.(1), . . . ,
.sub.V.sup.(o)) of O multivariate quadratic polynomials is expressed as below when υ linear polynomials (L.sub.1, . . . , L.sub.υ) and υ variables (χ.sub.1, . . . , χ.sub.υ) defined on a finite field
.sub.q are given,
.sub.q.sup.n.fwdarw.
.sub.q.sup.n, {tilde over (T)}=T.sup.−1, M.sub.V is a structured matrix or a submatrix of a structured matrix,
m=o,
V={1, . . . , υ},
O={υ+1, . . . , υ+o}, |V|=υ, |O|=o, V is an index set for defining Vinegar variables, and O is an index set for defining Oil variables.
2. The method of claim 1, wherein, when the system (.sub.V.sup.(1), . . . ,
.sub.V.sup.(o)) of O multivariate quadratic polynomials is expressed as below
3. A computer program which is stored in a storage medium to perform the method of generating a public key and a secret key of claim 1.
4. An electronic signer comprising the key generator configured to perform the method of generating a public key and a secret key of claim 1, wherein the electronic signer further comprises: a signature generator configured to generate an electronic signature σ of a message M using the affine map {tilde over (T)}, the map , and the message M; and a signature verifier configured to verify the electronic signature σ using the message M, the electronic signature σ, and the public key (
=
∘T), wherein the signature generator configured to calculate a hash message (H(M)=ξ) for the message M, and calculate a solution (s=(s.sub.1, . . . , s.sub.n)) of
(x)=ξ using
.sup.−1(ξ)=s when ξ=(ξ.sub.1, . . . , ξ.sub.m) is given, and calculates {tilde over (T)}(s)=σ, signature verifier determines whether P(σ)=H(M) and verify the electronic signature σ according to a result of the determination,
H:{0,1}*.fwdarw..sub.q.sup.m,
and
H(M)=ξ=(ξ.sub.1, . . . , ξ.sub.m)∈.sub.q.sup.m.
5. A method of generating a public key and a secret key using a key generator comprising: acquiring an affine map {tilde over (T)} and a map (:
.sup.n.fwdarw.
.sub.q.sup.m); and generating a public key (
=
∘T) and a secret key (
, {tilde over (T)}) using the affine map and the map, wherein the map (
:
.sup.n.fwdarw.
.sub.q.sup.m) is expressed as a system (
.sub.OV.sup.(1), . . . ,
.sub.OV.sup.(o)) of O multivariate quadratic polynomials, the system (
.sub.OV.sup.(1), . . . ,
.sub.OV.sup.(o)) of O multivariate quadratic polynomials is expressed as below when υ variables (χ.sub.1, . . . , χ.sub.υ) and O variables (χ.sub.υ+1, χ.sub.υ+2, . . . , χ.sub.υ+o) defined on a finite field (
.sub.q) are given
.sub.q.sup.n.fwdarw.
.sub.q.sup.n, {tilde over (T)}=T.sup.−1, and, when each column vector a.sub.ij is regarded as an element of one matrix, each column vector a.sub.ij is selected such that M.sub.OV is a structured matrix and element values of b.sub.ij are selected such that B is also a structured matrix of the same form as M.sub.OV.
6. The method of claim 5, when o(=2k) is an even number, M.sub.OV is a block circulant matrix of vectors when M.sub.OV is expressed as below,
7. A computer program that is stored in a storage medium for performing the method of generating a public key and a secret key of claim 5.
8. An electronic signer, comprising the key generator configured to perform the method of generating a public key and a secret key of claim 5, wherein the electronic signer further comprises: a signature generator configured to generate an electronic signature σ of a message M using the affine map {tilde over (T)}, the map , and the message M; and a signature verifier configured to verify the electronic signature σ using the message M, the electronic signature σ, and the public key (
=
∘T), wherein the signature generator configured to calculate a hash message H(M)=ξ for the message M, calculate a solution (s=(s.sub.1, . . . , s.sub.n) of
(x)=ξ using
.sup.−1(ξ)=s when ξ=(ξ.sub.1, . . . , ξ.sub.m) is given, and calculates {tilde over (T)}(s)=σ, the signature verifier determines whether P(σ)=H(M) and verify the electronic signature σ according to a result of the determination,
H:{0,1}*.fwdarw..sub.q.sup.m,
and
H(M)=ξ=(ξ.sub.1, . . . , ξ.sub.m)∈.sub.q.sup.m.
9. A method of generating a public key and a secret key using a key generator comprising: acquiring a first affine map {tilde over (S)}, a second affine map {tilde over (T)}, and a map (:
.sup.n.fwdarw.
.sub.q.sup.m); and generating a public key
=S∘
∘T and a secret key ({tilde over (S)},
, {tilde over (T)}) using the first affine map, the second affine map, and the map, wherein, the map (
:
.sup.n.fwdarw.
.sub.q.sup.m) is expressed as a system (
=
, . . . ,
.sup.(m)) of multivariate quadratic polynomials having m=o.sub.1+o.sub.2 polynomials and n=υ+m variables,
.sup.(i) for i=1, . . . , o.sub.1 is expressed as below,
.sub.V.sup.(i) for i=1, . . . , o.sub.1 is expressed as below when υ linear equations (L.sub.1, . . . , L.sub.υ) and υ variables (χ.sub.1, . . . , χ.sub.υ) defined on a finite field
.sub.q are given
.sup.(i) for i=o.sub.1+1, . . . , m is expressed as below,
.sub.V.sup.(i) for i=o.sub.1+1, . . . , m is expressed as below when linear equations (L′.sub.1, . . . , L′.sub.υ+o.sub.
m=o.sub.1+o.sub.2,
S:.sub.q.sup.m.fwdarw.
.sub.q.sup.m, T:
.sub.q.sup.n.fwdarw.
.sub.q.sup.n, {tilde over (S)}=S.sup.−1, {tilde over (T)}=T.sup.−1,
V={1, . . . , υ},
O.sub.1={υ+1, . . . , υ+o.sub.1},
O.sub.2={υ+o.sub.1+1, . . . , υ+o.sub.1+o.sub.2}, which |V|=υ, i=|O.sub.i|=o.sub.i for 1 and 2, V is an index set for defining Vinegar variables, and O.sub.1 and O.sub.2 are index sets for defining Oil variables.
10. The method of claim 9, wherein, when the map (:
.sup.n.fwdarw.
.sub.q.sup.m) is expressed as a system (
=
, . . . ,
.sup.(m)) of multivariate quadratic polynomials having m=o.sub.1+o.sub.2 polynomials and n=υ+m variables,
.sub.V.sup.(i) for i=1, . . . , o.sub.1 is expressed as below
.sup.(i) for i=o.sub.1+1, . . . , m is expressed as below
.sub.V.sup.(i) for i=o.sub.1+1, . . . , m is expressed as below
11. A computer program that is stored in a storage medium for performing the method of generating a public key and a secret key of claim 9.
12. An electronic signer comprising the key generator configured to perform the method of generating a public key and a secret key of claim 9, wherein the electronic signer further comprises: a signature generator configured to generate an electronic signature σ of a message M using the first affine map ({tilde over (S)}), the second affine map ({tilde over (T)}), the map (), and the message M; and a signature verifier configured to verify the electronic signature σ using the message M, the electronic signature σ, and the public key (
=S∘
∘T), wherein the signature generator configured to calculate a hash message H(M) for the message M, calculate {tilde over (S)}(H(M))=ξ=(ξ.sub.1, . . . , ξ.sub.m)∈
.sub.q.sup.m, calculate a solution (s=(s.sub.1, . . , s.sub.n)) of
(x)=ξ using
.sup.−1(ξ)=s when ξ=(ξ.sub.1, . . . , ξ.sub.m) is given, and calculate {tilde over (T)}(s)=σ, the signature verifier configured to determine whether P(σ)=H(M) and verify the electronic signature σ according to a result of the determination, and
H:{0, 1}*.fwdarw..sub.q.sup.m.
13. The electronic signer of claim 12, wherein, when a matrix R given for randomization of the first affine map {tilde over (S)} in a product {tilde over (S)}.Math.h of a vector h of .sub.q.sup.m and the first affine map {tilde over (S)} is a circulant matrix, the signature generator calculates {tilde over (S)}(H(M)) using an equation below
{tilde over (S)}(H(M))=({tilde over (S)}+R)(H(M))−R(H(M)).
14. The electronic signer of claim 12, wherein, when the matrix R given for the randomization of the first affine map {tilde over (S)} in the product {tilde over (S)}.Math.h of the vector h of .sub.q.sup.m and the first affine map {tilde over (S)} is a circulant matrix, the signature generator calculates {tilde over (S)}(H(M)) using an equation below
{tilde over (S)}(H(M))=({tilde over (S)}.Math.R.sup.−1.Math.R)(H(M)).
15. A method of generating a public key and a secret key using a key generator comprising: acquiring a first affine map ({tilde over (S)}), a second affine map ({tilde over (T)}), and a map (:
.sup.n.fwdarw.
.sub.q.sup.m); and generating a public key (
=S∘
∘T) and a secret key ({tilde over (S)},
, {tilde over (T)}) using the first affine map, the second affine map, and the map, wherein the map (
:
.sup.n.fwdarw.
.sub.q.sup.m) is expressed as a system (
=
, . . . ,
.sup.(m)) of m=o.sub.1+o.sub.2 multivariate quadratic polynomials, a system (
.sub.OV.sup.(1), . . . ,
.sub.OV.sup.(o.sup.
.sub.q are given
v.sup.T=[χ.sub.1χ.sub.2 . . . χ.sub.υ], each column vector a.sub.ij is selected such that M.sub.OV,1 is a structured matrix and element values of b.sub.ij are selected such that B.sub.1 is also a structure matrix of the same form as M.sub.OV,1, when each column vector a.sub.ij is regarded as elements of one matrix, and .sub.OV.sup.(i) for i=o.sub.1+1, . . . , m is given as below,
v′.sup.T=[χ.sub.1χ.sub.2 . . . χ.sub.υ+o.sub..sub.q.sup.m.fwdarw.
.sub.q.sup.m, T:
.sub.q.sup.n.fwdarw.
.sub.q.sup.n, {tilde over (S)}=S.sup.−1, and {tilde over (T)}=T.sup.−1.
16. The method of claim 15, wherein, when o.sub.1=2k.sub.1 and o.sub.2=2k.sub.2 are given, F.sub.OV.sup.(i) for i=1, . . . , o.sub.1 is expressed as below .sub.OV.sup.(i) for i=o.sub.1+1, . . . , m is expressed as below
17. The method of claim 16, wherein, when υ linear equations (L.sub.1, . . . , L.sub.υ) and υ variables (χ.sub.1, . . . , x.sub.υ) defined on the finite field are given, .sub.V.sup.(i) for i=1, . . . , o.sub.1 is expressed as below,
.sub.V.sup.(i) for i=o.sub.1+1, . . . , m is expressed as below when linear equations (L′.sub.1, . . . , L′.sub.υ+o.sub.
.sup.(i) for i=1, . . . , m is expressed as below,
18. A computer program that is stored in a storage medium for performing the method of generating a public key and a secret key of claim 15.
19. An electronic signer comprising the key generator configured to perform the method of generating a public key and a secret key of claim 15, wherein the electronic signer further comprises: a signature generator configured to generate an electronic signature σ of a message M using the first affine map ({tilde over (S)}), the second affine map ({tilde over (T)}), the map (), and the message M; and a signature verifier configured to verify the electronic signature σ using the message M, the electronic signature σ, and the public key (
=S∘
∘T), wherein the signature generator configured to calculate a hash message H(M) for the message M, calculate {tilde over (S)}(H(M))=ξ=(ξ.sub.1, . . . , ξ.sub.m)∈
.sub.q.sup.m, calculate a solution (s=(s.sub.1, . . . , s.sub.n)) of
(x)=ξ using
.sup.−1(ξ)=s when ξ=(ξ.sub.1, . . . , ξ.sub.m) is given, and calculate {tilde over (T)}(s)=σ, the signature verifier configured to determine whether P(σ)=H(M), and verify the electronic signature σ according to a result of the determination, and
H:{0, 1}*.fwdarw..sub.q.sup.m.
20. The electronic signer of claim 19, wherein, when a matrix R given for randomization of the first affine map {tilde over (S)} in a product {tilde over (S)}.Math.h of a vector h of .sub.q.sup.m and the first affine map ({tilde over (S)}) is a circulant matrix, the signature generator calculates {tilde over (S)}(H(M)) using an equation below
{tilde over (S)}(H(M))=({tilde over (S)}+R)(H(M))−R(H(M)).
21. The electronic signer of claim 19, wherein, when the matrix R given for randomization of the first affine map {tilde over (S)} in a product {tilde over (S)}.Math.h of a vector h of .sub.q.sup.m and the first affine map ({tilde over (S)}) is a circulant matrix, the signature generator calculates {tilde over (S)}(H(M)) using an equation below
{tilde over (S)}(H(M))=({tilde over (S)}.Math.R.sup.−1.Math.R)(H(M)).
Description
BRIEF DESCRIPTION OF THE DRAWINGS
[0013]
[0014]
[0015]
[0016]
DETAILED DESCRIPTION OF EXEMPLARY EMBODIMENTS
[0017] In the present specification, an electronic signature algorithm (or an apparatus, a method, and/or a computer program stored in a storage medium capable of performing the electronic signature algorithm) based on a generation of systems of multivariate quadratic polynomials (or equations), which can be expressed by a product of a structured matrix (or a submatrix of the structured matrix) and a vector after performing a suitable operation or operations, is disclosed.
[0018] 1. Generation of O (here, O is a natural number) quadratic polynomials which can be expressed by product of structured matrix or submatrix of structured matrix and vector using υ (Here, υ is a natural number) linear polynomials and υ variables (here, χ.sub.i, 1≤i≤υ).
[0019] When .sub.q is a finite field with q (here, q is a natural number) elements, and υ linear polynomials (L.sub.1, . . . , L.sub.υ) and υ variables (χ.sub.1, . . . , χ.sub.υ) defined on the finite field (
.sub.q) are given, a system (
.sub.V.sup.(1), . . . ,
.sub.V.sup.(o)) of O quadratic polynomials, which can be expressed in a form of a product of a structured matrix (or a submatrix of a structured matrix) and a vector as shown in Equation 1 is generated.
[0020] The system (.sub.V.sup.(1), . . . ,
.sub.V.sup.(o)) of quadratic polynomials will be expressed by Equation 1, in which M.sub.V is defined as a structured matrix (or a submatrix of a structured matrix).
[0021] Here, the structure matrix includes a case in which complexity of the product of a structured matrix (or a submatrix of a structured matrix) and a vector is less than or equal to O(υ.sup.2).
1-1. Structured Matrix is Circulant Matrix
[0022] When υ linear polynomials (L.sub.1, . . . , L.sub.υ) and υ variables (χ.sub.1, . . . , χ.sub.υ) are given to an apparatus or a computer program, a system (.sub.V.sup.(1), . . . ,
.sub.V.sup.(o)) of O quadratic polynomials is generated as shown in Equation 2. Here, O is the number of quadratic polynomials, which is represented as O when there is one layer, and, when there are two layers, a first layer thereof is represented as O.sub.1 and a second layer is represented as O.sub.2.
[0023] The system of quadratic polynomials in Equation 2 needs to be expressed in the form of a product of a circulant matrix (or a submatrix of a circulant matrix) and a vector as shown in Equation 3. That is, M.sub.V in Equation 3 is a circulant matrix or a submatrix of a circulant matrix.
1-2. Additional Generation of System of Quadratic Equations Expressed by Block Circulant Matrix
[0024] After quadratic polynomials for variables (χ.sub.1, . . . , X.sub.υ) are selected as described in 1-1, a system (.sub.OV.sup.(1), . . . ,
.sub.OV.sup.(o)) of quadratic polynomials for o(=2k) (Here, k is a natural number) variables (χ.sub.υ+1, χ.sub.υ+2, . . . , χ.sub.υ+o) is additionally generated as shown in Equation 4.
[0025] Here v.sup.T=[χ.sub.1 χ.sub.2 . . . χ.sub.υ], each of P, Q, R, S is a circulant matrix of vectors, M.sub.OV is a block circulant matrix of the vectors, and B is also a block circulant matrix with the same structure as M.sub.OV.
[0026] A system of quadratic equations such as in Equation 5 without quadratic terms that satisfy χ.sub.iχ.sub.j, i, j=υ+1, .. . , υ+o (here, each of i and j is a natural number) is generated by combining the system of quadratic polynomials in Equation 4 and the system of quadratic polynomials in Equation 2. Here, δ.sub.i is a constant term selected in the finite field (.sub.q).
2. Generation of System of Quadratic Equations in Which Coefficient Matrix Has Structured Matrix Structure
[0027] In a system of quadratic polynomials having n=υ+o (n is a natural number) variables which can be expressed as shown in equation 6, it is assumed that there is a system (.sub.OV.sup.(i)) of quadratic polynomials for υ variables (χ.sub.1, . . . , χ.sub.υ) and O variables (χ.sub.υ+1, χ.sub.υ+2, . . . , χ.sub.υ+o).
Here, v.sup.T=[χ.sub.1 χ.sub.2 . . . χ.sub.υ], and B and M.sub.OV are expressed as shown in Equation 7.
[0028] Here, when each column vector a.sub.ij is regarded as an element of one matrix, each column vector a.sub.ij is selected such that M.sub.OV is a structured matrix, element values of b.sub.ij are selected such that B is a structure matrix of the same form as M.sub.OV, thereby a system of desired quadratic polynomials is generated.
[0029] Here, the structured matrix includes a case in which complexity of obtaining an existing structured matrix or inverse matrix, or finding a solution of a system of a linear equation having a structured matrix as a coefficient matrix is less than or equal to O(n.sup.2). At this time, a size of the coefficient matrix of the system of a linear equation is n×n.
2-1. M.SUB.OV .and B Are Block Circulant Matrices (BC).
[0030] When (o=2k) is an even number, M.sub.OV and B are selected such that M.sub.OV and B are block circulant matrices, respectively, as shown in Equations 8 and 9.
Here, each of P, Q, R, S is a circulant matrix of vectors, and M.sub.OV is a block circulant matrix of the vectors.
Here, B is a block circulant matrix.
2-2. Method of Efficiently Calculating Inverse Matrix (BC.SUP.−1.) of Given Block Circulant Matrix (BC)
[0031] A block determinant (K−PS−QR) of a given block circulant matrix
is obtained. Since all of P, Q, R, S are circulant matrices, K is also a circulant matrix.
[0032] First, an inverse matrix (K.sup.−1) of K is obtained, and an inverse matrix (BC.sup.−1) of BC is obtained by calculating
At this time, efficient algorithms such as the Extended Euclidean Algorithm are used to obtain the inverse matrix of K.
3. Randomization Using Structured Matrix
[0033] Embodiments of message randomization or secret key randomization to cope with various types of attacks such as a side-channel attack are as below. [0034] (i) generating a first operation result by adding a matrix and a message (or a secret key), and then, subtracting the matrix from the first operation result, or [0035] (ii) generate a second operation result by multiplying a matrix and a message (or a secret key), and then, multiplying the second operation result by an inverse matrix of the matrix.
[0036] At this time, if the matrix is selected as a structured matrix, calculation efficiency can be increased.
3-1. Randomization Using a Circulant Matrix or a Block Circulant Matrix
[0037] Embodiments of message randomization or secret key randomization to cope with various types of attacks such as a side-channel attack are as below. [0038] (i) generating a first operation result by adding a matrix and a message (or a secret key), and then, subtracting the matrix from the first operation result, or [0039] (ii) generating a second operation result by multiplying a matrix and a message (or a secret key), and then, multiplying the second operation result by an inverse matrix of the matrix.
[0040] At this time, if a random matrix is selected as a circulant matrix or a block circulant matrix, the calculation efficiency can be increased.
3-2. When .sub.q is a finite field with q elements, if a random matrix (R) is selected as a circulant matrix as shown in Equation 10 to randomize a secret key ({tilde over (S)}) in a product ({tilde over (S)}.Math.h) of a vector (h) of
.sub.q.sup.m and the secret key ({tilde over (S)}), the calculation efficiency can be increased.
{tilde over (S)}(H(M))=({tilde over (S)}+R)(H(M))(−R(H(M))
or
{tilde over (S)}(H(M))=({tilde over (S)}.Math.R.sup.−1.Math.R)(H(M)) [Equation 10]
[0041] Here, {tilde over (S)}=S.sup.−1, and H(M) is a hash value for a message M and is expressed as H(M)=ξ=(ξ.sub.1, . . . , ξ.sub.m)∈.sub.q.sup.m.
[0042] The electronic (or digital) signature algorithms based on multivariate quadratic polynomials (or equations) according to the present invention include a key generation algorithm, a signature generation algorithm, and a signature verification algorithm. The electronic signature algorithms based on multivariate quadratic polynomials are executed by an electronic apparatus (or a digital signature apparatus) or a computer program being executed in the electronic apparatus.
[0043] A computer program stored in a storage medium has a program code for performing a method for electronic signature algorithms based on a structured matrix (algorithms that protect authentication, non-repudiation, and/or integrity of a message (or data)), and the program code is executed in a computing apparatus.
[0044] The computing apparatus refers to a PC (personal computer), a server, or a mobile device, and the mobile device refers to a mobile phone, a smartphone, an Internet mobile device (MID), a laptop computer, or the like, but the present invention is not limited thereto.
[0045]
[0046] In the present specification, the electronic signer 100 or 200 may be implemented as a hardware component or a software component. When the electronic signer 100 or 200 is implemented as a hardware component, each of the components 110, 120, and 130 is implemented as a hardware component, and, when the electronic signer 100 is implemented as a software component, each of the components 110, 120, and 130 is implemented as a software component.
Key Generation Algorithm
[0047] The key generator 110 performs steps (S110 to S130) to perform the key generation algorithm for calculating a public key.
[0048] For a security parameter (λ), a pair (<PK, SK>=<, (
, {tilde over (T)})>) of a public key (PK) and a secret key (SK) is generated as follows. The security parameter (λ) indicates a security level. [0049] 1. one affine map ({tilde over (T)}) is randomly selected (S110). If the affine map ({tilde over (T)}) is not invertible, a new affine map will be randomly selected again. Here, T:
.sub.q.sup.n.fwdarw.
.sub.q.sup.n and, {tilde over (T)}=T.sup.−1. It is assumed that affine maps and a secret central map (
=
, . . . ,
.sup.(m)) are securely stored in an apparatus (for example, a data storage apparatus) which can be accessed by the key generator 110. [0050] 2. The secret central map (
=
, . . . ,
.sup.(m)) is selected as below (S120).
[0051] For application to electronic signature algorithms based on multivariate quadratic polynomials using a structured matrix, a configuration of a new central map according to the present invention requires two index sets (V, O) when there is one (1) layer. :
.sup.n.fwdarw.
.sub.q.sup.m, and each of n and m is a natural number.
V={1, . . . , υ}
O={υ+1, . . . , υ+o}
[0052] Here, |V|=υ, and |O|=o. V is an index set for defining Vinegar variables, and O is an index set for defining Oil variables.
[0053] In the secret central map (=
, . . . ,
.sup.(m)), that is, a system of multivariate quadratic polynomials having m=o equations and n=υ+m variables,
.sup.(i) for i=1, . . . , o will be defined as shown in Equation 11.
[0054] .sub.V.sup.(i) for i=1, . . . , o will be defined as shown in Equation 12,
[0055] Here, M.sub.v is a circulant matrix or a submatrix of a circulant matrix.
[0056] .sub.OV.sup.(i) for i=1, . . . , o will be defined as shown in Equation 13, and
[0057] Here, B is the same as B in Equation 9, and M.sub.OV is the same as M.sub.OV in Equation 8.
[0058] A constant term (δ.sub.i) is randomly selected in the finite field (.sub.q). [0059] 3. A public key (
=
∘T) is calculated (S130). Here, a circle means a composition, the public key (
=
∘T) is required for signature verification, and a secret key (SK=(
, {tilde over (T)}) is required for signature generation.
Signature Generation Algorithm
[0060] A signature generator 120 performs steps (S140 to S160) to perform the signature generation algorithm, that is, how to invert a new central map according to the present invention.
[0061] The signature generator 120 receives an affine map {tilde over (T)}, a secret central map , and a message M. The message M refers to a message to be transmitted via a communication medium (for example, wired or wireless) as plain text. [0062] 1. A hash message (H(M)=ξ) for the message M is calculated (S140). Here,
H:{0, 1}*.fwdarw..sub.q.sup.m is a collision resistant hash function.
H(M)=ξ=(ξ.sub.1, . . . , ξ.sub.m)∈.sub.q.sup.m is calculated. [0063] 2. When ο=(ξ.sub.1, . . . , ξ.sub.m) is given, processes of finding
.sup.−1(ξ)=s, that is, a solution s=(s.sub.1, . . . , s.sub.n) of
(x)=ξ are as below (S150).
[0064] A vector of random values s.sub.v=(s.sub.1, . . . , s.sub.υ)∈.sub.q.sup.υ is selected. The vector (s.sub.v) is plugged into
.sub.V.sup.(i) for i=1, . . . , m to calculate a product of a o×υ submatrix of a υ×υ circulant matrix and a transpose of a vector ((L.sub.1(s.sub.υ), . . . , L.sub.υ(s.sub.υ))), and, as a result, (c.sub.1, . . . , c.sub.o) is obtained. At this time, the o×υ submatrix is M.sub.V in Equation 3.
[0065] If the vector (s.sub.v) is plugged into .sub.OV.sup.(i) for i=1, . . . , m to obtain a system of O linear equations having O variables (χ.sub.υ+1, . . . , χ.sub.n), a form of the coefficient matrix is a block circulant matrix (BC).
[0066] Here, the block circulant matrix (BC) is a matrix obtained by multiplying a matrix that is obtained by plugging the vector (s.sub.v) into a matrix composed of v.sup.T in Equation 13 by M.sub.OV.
[0067] A solution (s.sub.υ+1, . . . , s.sub.n), is obtained by multiplying the inverse matrix (BC.sup.−1) obtained by the method defined in 2-2 described above by a transpose of (ξ.sub.1−c.sub.1−δ.sub.1, . . . , ξ.sub.o−c.sub.o−δ.sub.o). Accordingly, a vector s=(s.sub.1, . . . , s.sub.n) is a solution of (x)=ξ.
[0068] If there is no inverse matrix BC.sup.−1 of the block circulant matrix BC, the procedure returns to a beginning of the signature generation algorithm to select a vector of new random values s.sub.v′=(s′.sub.1, . . . , s′.sub.υ) and performs the methods (or processes) described above again. [0069] 3. {tilde over (T)}(s)=σ is calculated (S160). σ refers to a signature of the message M (here, the signature means a digital signature or an electronic signature).
Signature Verification or Verification Algorithm
[0070] The signature verifier 130 performs a step (S170) to perform a signature verification or verification algorithm. If the signature verifier 130 receives one of the public key and a certificate including the public key
, the message M, and the signature σ from the signature generator 120, that is, if the public key
and the signature σ for the message M are given, the signature verifier 130 checks whether P(σ)=H(M). If P(σ)=H(M), the signature σ is accepted, and otherwise, the signature σ is rejected.
[0071]
[0072] The key generator 210 performs step (S210) to perform the key generation algorithm for calculating a secret key and a public key.
Key Generation Algorithm:
[0073] For the security parameter (λ), a pair (<PK, SK>=<, ({tilde over (S)},
, {tilde over (T)})>) of a public key (PK) and a secret (SK) is generated as follows. The security parameter (λ) represents a security level. [0074] 1. Two affine maps {tilde over (S)} and {tilde over (T)} are randomly selected (S210). If {tilde over (S)} and {tilde over (T)} are not invertible, two (new) affine maps {tilde over (S)} and {tilde over (T)} are randomly selected again. Here, S:
.sub.q.sup.m.fwdarw.
.sub.q.sup.m and {tilde over (S)}=S.sup.−1, and T:
.sub.q.sup.n.fwdarw.
.sub.q.sup.n and, {tilde over (T)}=T.sup.−1. Affine maps including the affine maps {tilde over (S)} and {tilde over (T)} and the secret central map (
=
, . . . ,
.sup.(m) can be securely stored in an apparatus which can be accessed by the key generator 210. [0075] 2. The secret central map
=
, . . . ,
.sup.(m) is selected as below (S220).
[0076] For application to electronic signature algorithms based on multivariate quadratic polynomials using a structured matrix, a configuration of a new central map according to the present invention requires two index sets (V, O.sub.1, and O.sub.2) when there are two layers.
V={1, . . . , υ},
O.sub.1={υ+1, . . . , υ+o.sub.1},
O.sub.2={υ+o.sub.1+1, . . . , υ+o.sub.1+o.sub.2}
[0077] Here, |V|=υ, and |O.sub.i|=o.sub.i for i=1, 2. V is an index set for defining Vinegar variables, and O.sub.1 and O.sub.2 are index sets for defining Oil variables.
[0078] In the secret central map =
, . . . ,
.sup.(m), that is, a system of quadratic polynomials having m=o.sub.1+o.sub.2 (here, each of O.sub.1 and O.sub.2 and is a natural number) polynomials and n=υ+m variables,
.sup.(i) for i=1, . . . , o.sub.1 will be defined as shown in Equation 14.
[0079] Here, .sub.V.sup.(i) is defined as shown in Equation 2 and
.sub.OV.sup.(i) is defined as shown in Equation 4. At this time, when O is replaced with O.sub.1 (o.sub.1=2k, here, k.sub.1 is a natural number) as in 1-2 described above, Equation 3 becomes Equation 15, Equation 6 becomes Equation 16, and Equations 8 and 9 become Equation 17.
[0080] Here, M.sub.V.sup.1 is a circulant matrix or a submatrix of a circulant matrix, and .sub.OV.sup.(i) for i=1, . . . , o.sub.1 is as shown in Equation 16.
Here,
[0081]
v.sup.T=[χ.sub.1χ.sub.2 . . . χ.sub.υ],
[0082] Here, M.sub.OV,1 is a block circulant matrix whose elements are column vectors a.sub.ij each having a size υ, and B.sub.1 is a block circulant matrix.
[0083] The block circulant matrix M.sub.OV,1 of the vectors and the block circulant matrix B.sub.1 are as shown in Equation 17.
[0084] Here, P.sub.1, Q.sub.1, R.sub.1, S.sub.1 are circulant matrices of vectors, and M.sub.OV,1 is a block circulant matrix of vectors.
[0085] At last, a constant term δ.sub.i is randomly selected in the finite field .sub.q.
.sup.(i) for i=o.sub.1+1, . . . , m will be defined as shown in Equation 18.
[0086] Here, .sub.V.sup.(i) is defined as shown in Equation 2. At this time, if L.sub.i of 1-1 described above is replaced with L′.sub.i and υ is replaced with υ+o.sub.1,
.sub.V.sup.(i) is as shown in Equation 19.
[0087] .sub.OV.sup.(i) is defined as shown in Equation 4. At this time, if υ described in 1-2 is replaced with υ+o.sub.1 and O is replaced with O.sub.2 (o.sub.2=2k.sub.2, here, k.sub.2 is a natural number), Equation 3 becomes Equation 20, Equation 6 becomes Equation 21, and Equations 8 and 9 become Equation 22.
[0088] Here, M.sub.V.sup.2 is a circulant matrix or a submatrix of a circulant matrix, and .sub.OV.sup.(i) for i=o.sub.1+1, . . . , o.sub.1+o.sub.2 will be defined as shown in Equation 21.
Here,
[0089]
[0090] Here, M.sub.OV,2 is a block circulant matrix whose elements are column vectors a′.sub.ij each having a size υ, and B.sub.2 is a block circulant matrix.
[0091] The block circulant matrix M.sub.OV,2 of vectors and the block circulant matrix B.sub.2 are as shown in Equation 22.
[0092] Here, p′.sub.i, q′.sub.i, s′.sub.i, r′.sub.i are column vectors each having the size υ, each of P.sub.2, Q.sub.2, R.sub.2, S.sub.2 is a circulant matrix of vectors, and M.sub.OV,2 is a block circulant matrix of vectors.
[0093] At last, a constant term δ.sub.i is randomly selected in the finite field .sub.q. [0094] 3. A public key
=S∘
∘T is calculated (S230).
Signature Generation Algorithm
[0095] The signature generator 220 performs steps (S240 to S260) to perform the signature generation algorithm, that is, how to invert a new central map according to the present invention. The signature generator 220 receives the affine maps {tilde over (S)} and {tilde over (T)}, the secret central map , and the message M. [0096] 1. A hash message H(M) for the message M is calculated (S240).
[0097] Here, H:{0, 1}*.fwdarw..sub.q.sup.m is a collision resistant hash function. [0098] 2. {tilde over (S)}(H(M))=ξ=(ξ.sub.1, . . . , ξ.sub.m)∈
.sub.q.sup.m is calculated (S240). If a random matrix R, that is, a circulant matrix, is given (or provided), as described in 3-2, {tilde over (S)}(H(M)) is calculated according to Equation 10. [0099] 3. When ξ=(ξ.sub.1, . . . , ξ.sub.m) is given, processes of finding
.sup.−1(ξ)=s, that is, solutions s=(s.sub.1, . . . , s.sub.n) of
(x)=ξ, are as below (S250).
[0100] In a first layer,
[0101] a random vector s.sub.V=(s.sub.1, . . . , s.sub.υ)∈.sub.q.sup.υ is randomly selected.
[0102] The vector (s.sub.v) is plugged into the first layer .sub.V.sup.(i) for i=1, . . . , o.sub.1 to calculate a product of a o.sub.1×υ submatrix of a υ×υ circulant matrix and the transpose of a vector (L.sub.1(s.sub.υ), . . . , L.sub.υ(s.sub.υ)), and, as a result, (c.sub.1, . . . , c.sub.o.sub.
[0103] The vector s.sub.v is plugged into .sub.OV.sup.(i) for i=1, . . . , o.sub.1 to obtain a system of linear equations of O.sub.1 equations having O.sub.1 variables. At this time, a coefficient matrix of the system of linear equations is a block circulant matrix BC.sub.1.
[0104] Here, the block circulant matrix BC.sub.1 is a matrix obtained by multiplying a matrix that is obtained by plugging the vector s.sub.v into a matrix composed of v.sup.T in Equation 13 by M.sub.OV,1.
[0105] A solution s.sub.υ+1, . . . , s.sub.υ+o.sub.
[0106] In a second layer,
[0107] a vector s.sub.υ+o.sub..sub.V.sup.(i) for i=o.sub.1+1, . . . , m to calculate a product of a o.sub.2×(υ+o.sub.1) submatrix of a (υ+o.sub.1)×(υ+o.sub.1) circulant matrix and a transpose of a vector (L′.sub.1(s.sub.υ+o.sub.
[0108] At this time, the o.sub.2×(υ+o.sub.1) submatrix into which the vector (s.sub.υ+o.sub.
[0109] The vector (s.sub.υ+o.sub..sub.OV.sup.(i) for i=o.sub.1+1, . . . , m to obtain a system of linear equations of o.sub.2 equations having o.sub.2 variables. At this time, a coefficient matrix of the system of linear equations is a block circulant matrix BC.sub.2.
[0110] Here, the block circulant matrix BC.sub.2 is a matrix obtained by multiplying a matrix that is obtained by plugging the vector S.sub.υ+o.sub.
[0111] A solution (s.sub.υ+o.sub.(x)=ξ.
[0112] If there is no inverse matrix BC.sub.1.sup.−1 of the block circulant matrix BC.sub.1 or there is no inverse matrix BC.sub.2.sup.−1 of the block circulant matrix BC.sub.2, the procedure returns to a beginning of the electronic signature algorithm to select a vector s.sub.v′=(s′.sub.1, . . . , s′.sub.υ) of new random values, and performs the methods (or processes) described above again. [0113] 4. {tilde over (T)}(s)=σ is calculated (S260). σ refers to a signature of the message M (here, the signature is a digital signature or an electronic signature).
Signature Verification or Verification Step:
[0114] If the signature verifier 230 receives the message M, the signature σ, and the public key , that is, if the public key
and the signature σ for the message M are given, the signature verifier 230 checks whether P(σ)=H(M) (S270). If P(σ)=H(M), the signature σ is accepted, and otherwise, the signature σ is rejected.
[0115] A method, an apparatus (or a device), or a computer program for performing an electronic signature algorithm based on multivariate quadratic polynomials according to the embodiment of the present invention can greatly reduce a length of a secret key by using structured matrices, and generate signatures quickly by increasing calculation efficiency.
[0116] Although the present invention has been described with reference to the embodiment shown in the drawings, this is merely exemplary, and it will be understood by those skilled in the art that various modifications and equivalent other embodiments thereof can be made. Therefore, a true technical protection scope of the present invention will be defined by a technical spirit of the appended claims.