TAME AUTOMORPHISM PUBLIC KEY SYSTEM

Abstract: The present invention relates to a tame automorphism based encryption system or scheme. Let K be a finite field of 2<m> elements. Let phi 4, phi 3, phi 2, phi 1 be tame automorphisms (see above) of the rink K[x1,...,xn+r]. Let the composition be pi = phi 4 phi 3 phi 2 phi 1. The automorphism pi and the factorization pi = phi 4 phi 3 phi 2 phi 1 are hidden. Let pi = ( pi 1(x1,...,xn+r),...,xn+r(x1,...,xn+r)). The field K and the polynomials (f1,...,fn+r) = ( pi 1(x1,...,xn,0,...,0),..., pi n+r(x1,...,xn,0,...,0)) will be announced publicly. Let (x'1,...,x'n) be the plaintext. Then the cyphertext will be (y'1,...,y'n+r) = (f1(x'1,...,x'n), ...,fn+r(x'1,...,x'n)). It is easy to find phi i<-1>((y'1,...,y'n+r)) (see Corollary 2). Therefore, it is easy to recover the plaintext (x'1,...,x'n) = phi 1<-1> phi 2<-1> phi 3<-1> phi 4<-1> pi (( pi 1,...,x'n)). However without knowing the automorphism pi precisely and the decomposition pi = phi 4 phi 3 phi 2 phi 1, it is very hard to find plaintext (x'1,...,x'n). The encryption system or scheme may be applied to electronic message transmission, data storage, smart card security, and product verification applications.

Description: TAME AUTOMORPHISM PUBLIC KEY SYSTEM The present invention relates to public key cryptography. Cryptography systems or schemes are used to encode messages that are either preserved or transmitted electronically, to preserve the privacy and the integrity of the messages, as well as to authenticate the originator of the message. In single key cryptography, or symmetric cryptography, a single key is used to encrypt and decrypt data or a transmitted message according to a predetermined mathematical formula. In the single or symmetric cryptography method, the single key must be maintained in secrecy or else the encrypted data or message may be easily decrypted. A more secure encryption system involves a two-key encryption method. A typical asymmetric encryption system includes both a public key, a code made generally available to some media, and a private key, a code which is made available only to the rightful owner of the data or intended recipients of the message. Known asymmetric public key encryption systems include RSA and hybrid PGP systems. The RSA method uses the RC2, RC4, or RC5 encryption algorithm. In the hybrid PGP encryption systems, the encryption algorithm initially begins by converting a plain text data or message into a cyphertext data and message with a "session key" which is the symmetric IDEA method. The "session key" is then encrypted with the public key of the rightful owner of the data or the recipient of the message in the asymmetric RSA key distribution system, and the recipient decrypts the session key using the private key to extract the plain texts from the cyphertexts. In conventional public key encryption systems, the public key of the user is used to identify a user, to avoid the problem of forgeries of data or impostors sending encrypted messages where the recipient is deceived into thinking another individual sent the message. To digitally sign a message, the sender needs only apply the private key, so anyone else can verify the authenticity of the message by applying the sender's public key. In another application, to avoid the forgery of a product, say U.S. dollar bills, one can select the serial numbers to be special, say last nine digits all zeros, then uses the private key to encrypt the serial numbers. The detectives can use the public key to discover forgeries quickly. However, these various public key encryption algorithms present their own computational difficulties. What is needed in the art is an improved public key encryption system to provide privacy, integrity, and authentication of data and electronic communications. The present invention relates to a tame automorphism based public key encryption system or scheme. The present invention contemplates a computer program which implements the tame automoφhism base encryption algorithm to encrypt and decrypt messages either sent electronically or encoded physically. A computer would first apply an encryption algorithm of the present invention to encode a plaintext data or message to be transmitted electronically. The encryption method produces a cyphertext data or message for sending via an electronic medium. The computer system of the rightful owner of the data or the message recipient would decrypt the cyphertext by using the tame automorphism based decryption algorithm to extract the original plaintext message. In this way, data may be secured, and messages may be securely transmitted over the airwaves or an open network. BRIEF DESCRIPTION OF THE DRAWINGS The above mentioned and other features and objects of this invention, and the manner of attaining them, will become more apparent and the invention itself will be better understood by reference to the following description of embodiments of the invention taken in conjunction with the accompanying drawings, wherein: Fig. 1 is a flow chart diagram of a first method of the present invention; Fig. 2 is a flow chart diagram of a second method of the present invention; and Fig. 3 is a schematic diagram of a computer system of the present invention. Corresponding reference characters indicate corresponding parts throughout the several views. Although the drawings represent embodiments of the present invention, the drawings are not necessarily to scale and certain features may be exaggerated in order to better illustrate and explain the present invention. The exemplification set out herein illustrates embodiments of the invention, in several forms, and such exemplifications are not to be construed as limiting the scope of the invention in any manner. DESCRIPTION OF THE INVENTION The embodiment disclosed below is not intended to be exhaustive or limit the invention to the precise form disclosed in the following detailed description. Rather, the embodiment is chose and described so that others skilled in the art may utilize its teachings. The encryption and decryption method of the present invention is not limited to a particular hardware or system configuration, rather may be broadly applied in a variety of computer hardware and computer software settings. The invention involves the preservation of data, authentication of data, and the transmission of messages, in digital or analog form, wherein the data or message is subject to an encryption algorithm, and is decoded using decryption algorithm. In a public key methodology, one of the two encryption keys is made generally available, while the other encryption key is maintained privately. Figure 1 shows a flow chart of a public-private key encryption scheme. In step 10, the message is encrypted into cyphertext using a tame automoφhism based algorithm, as explained in greater detail below. The cyphertext message is transmitted in step 12, so that it is received in step 14. Finally the cyphertext is decrypted with a private key in step 16, again using a tame automoφhism based algorithm. A similar procedure is shown in Figure 2, but with the initial encryption step 20 using a private key. Steps 22 and 24 relate to sending and receiving the cyphertext, with step 26 decrypting the cyphertext with a public key. A computer system implementing these steps is depicted in Figure 3. Computers 32 and 32' include programs 30 and 32' which enable the tame automoφhism based encryption and decryption algorithms. Transmission devices 30 and 30', such as a modem, a smart card (e.g., an electronically preprogrammed debit card), a hard disk file system, or a physical item's serial number, may be used to transmit the message. The method of the invention may also be used to encrypt data stored on computer 32 or 32' to prevent tampering. Although electronic communication is greatly enhanced by the present invention, the methods of the present invention may also be applied to physical communications for authentification puφoses. In order to establish the encryption algorithm, it is necessary to define the mathematical parameters of the equations used to perform the encryption and decryption. Mathematical Background [1]. Introduction Let K be a finite field of q = 2 m elements. Let A ,,- • -,*„] be the polynomial ring of n variables, x ; , ■ ■ -,*„, over K. Consider a sequence of automoφhisms φ, of defined either as, (1): φ,(x,) = x, + /ι,(x 2 ,-^ n ) (2): φβ 2 ) = x 2 («): φ,(x n ) = x n or as, φ, = invertible linear transformations The automoφhisms above are called tame automoφhisms. It is easy to see that the inverse of a tame automoφhism is also a tame automoφhism, and is of either the following form: (1)': X(x,) = x, - h,( 2 ,-^ (2)' : φ,-'(* 2 ) = * 2 (nY: φ,- Xr = x n or as φ ' = invertible linear transformations The group generated by all tame automoφhisms is called the tame automorphism group. It is an open problem in mathematics whether the automoφhism group of K[x t ,- • ,x n ] is the tame automoφhism group for n > 2. Remark 1 : The linear transformation φ, can be either the identity map or a permutation. Obviously, the order of the variables x,,- ■ -,x n is not significant. Let ■ K - LTφ, be an element in the tame automoφhism group. Then we have (\)°:y x = τr(X) =fβ„-^)for i = !,-,« (2)°:x, = 7r'(y,) = giy "^) f or ' = ",» Remark 2: In general, it is convenient to require that a tame automoφhism φ is either a linear transformation or of the following forms in any order of the variables x,,---,x n , (1)": φ,(x,) = x, + Λ„(x 2 ,-,x n ) = y ] (2)": φ,(x 2 ) = x 2 + h l2 (x 3 ,- c n ) = ;μ 2 (/)" : < »,(*,) = *j + *i,(* J+ l, " " rO = ^j (n)- : φ,(x n ) = x n = y n PROPOSITION:. Let a tame automoφhism φ t be defined as in the preceding paragraph. We have the inverse φ (y = v, - h^φ,- 1 ^,),—^- 1 ^)). PROOF: Trivial. For instance, in the case of four variables, we have Φ,-'0 2 ) = y 2 - Λ I2 Q> 3 - My, ,-'(y 4 ) = ^ In general, the total degree of φ; ] (y ) increases very fast. It is hard to write down the polynomials Φ,"'( J ). COROLLARY 1 :. Given the set {y '\, it is easy to find the values {φ^iγ ))} by induction; first, we have Φ.'O ) = y ' π , inductively if we have φ; λ (y ' i+ ---,φ; '(y ' n ), then we have ΦW = y) - h^(y ' 1+] ),---^(y' n )). Proof: Trivial. COROLLARY 2:. Given the decomposition τ = U'^ H Φ, where φ, are tame automoφhisms of the above forms, it is easy to find Proof: As usual, ιr l - I " 11 ,- ! Φ," 1 - It follows from Corollary 1. Remark 3: The inverse map φ,-' as polynomials is hard to write down because their degrees could be very high as indicated by our later discussions. We can show that if n = 2 and degf, > 2, then the highest degree forms of/,, f 2 must be powers, up to some non-zero constants, of the same linear form and degf,, deg f 2 are divisible by the smaller one of the two degrees (cf [1],[12],[13],[17]). Therefore the inverse g, can be recovered inductively by performing further tame automoφhism to cut down the degrees. However, for n > 3, the above considerations are no longer valid. Remark 4: For n > 3, there is no known theorem to decompose an element π in the tame automoφhism group into product of tame automoφhisms π Φ,- Remark 5: If n > 4, let {m; i=\,—,n) be positive integers, let I m be the ideal of the kernels of the maps τ m : then the numbers of the minimal generators of the ideals I m are unbounded, (cf [6]). The Public Key System Principle: Let the user select two tame automoφhism φ,,φ 2 , let it = φ 2 φ ] and hide the decomposition. The user shall announce publicly the map TV as polynomials π(x) =f,(x,, - • -,x n ), and the field K. Let x' ,,- • • ,x '„ <≡ K be the plaintext. The sender evaluates ^, =f{x,, - ■ • ,x n )(- π (x,)) at x',,- • " ,x '„ for the values of x,,- • -,x π . Let the results be y ,- ■ ■ j' '„. These will be the cyphertext. The legitimate receiver recovers the plaintext by x' , = "^'(X ,)( = g,Cy ' / • " ' ' >y ' n )) = Φy( ι ] y ' ) which can be done easily according to Corollary 2. Remarks 6: In general, we may consider π - φ ■ • • φ 2 φ for the product of k > 2 tame automoφhims. Note that for the me automoφhism group of K[x,, ■ ■ ,x n ], the unique factorization of an element as a product of tame automoφhisms is unknown. For k > 3, it is not known that if there are always tame automoφhisms Ψ,, 2 such that π = φ k φ 2 φ = ^ 2 ^ v One possible way to carry out the above Principle is as follows: Select n > 3 and positive integers s,t. Let the field K be ¥ 2m the finite field of 2 m elements. The user selects an element π of the tame automoφhism group in the following way, φ,(x,) = x, (2)' φβ = X j + Λ J (x„-^ / . / )+p J (x / ), deg{h) = s, deg (p) > s for; = 2,-,w (3)*: φ 2 (x = X j + deg q s < t for j = !,-,« - 1 (4) * : φ 2 (x n ) = x n (5) * : τr(x,) = φ 2 φβ = (x„- r c n ) An Example Let m = 1, n = 101 , s = 100. Furthermore, let ^( ^,,— ,x 101 ) be a homogenous polynomial (which may be zero, if necessary) of degree 4 such that it has the following properties (1): each variable could appear at most linearly in every term. (2): each variable appears either exactly in two terms or not at all, and let τ μ (x sβ ) be polynomials of x, of degrees less than 99. Let us consider the following example, (\ γ': φ ] (x ] ) = x ] (2)": φβ = x s + x,x k + sβ,) + r p (xXx t + *, . ,*» i≠k,l<i,k<j /</<; ' + i , for; = 2,- ■ ■ , 101 k^ l00+j-l (3)": φβ) = Xj + qj (x J+ „- • -mX /0l ), for; = 2 - ■ ■ ,101 (4) * ': φ 2 (x n ) = x n (5) ** : τr(x,) = φ 2 φβ) = /(*„ ■ ■ - m ) = )\ Let us count the number of terms in the sets {r (x l )},{s j (x\) }= 2, we have 100 terms for s 2 (xX For; = 3, we have 100 terms for s 3 (x,) and 100 terms for r 3 2 , continuously, for; = 101 we have 100 terms for ■Ϊ 101 (X 1 ) and 9,900 terms for r, 01 2 .- ■ • ,r ]01 100 . Totally, there are possibly 505,000 terms in the sets {rβΛ},{sβΛ}. Therefore the number of possible φ, is greater than 2 505 000 - 10' 51 - 500 . The inverse τ is of the following form; π-'Oi) = >r'Φ 2 -'tø = *frg ■ • O'loi)) Note that it follows from Remark 2 that each polynomial φ, '(y ; ) of variable y„- • • , ^ 101 is of degree > 99'- ' for =!,- • -,101. Note that the degrees are fairly large. Furthermore, it follows from Corollary 2 that it is easy to recover x ',,- • Xoi from JΛ " ' ' Xioi f° r m e legitimate user who knows φ ,φ 2 . Cryptoanalysis for the System It is not expensive for the legitimate user to select n, m, s, t, f p, q, the tame automoφhism π, and to construct the inverse map ττ ] = φyφ 2 Λ (cf Corollary 2), the polynomials/ for =1,--, n. The expense to the sender is mainly in evaluating polynomials X, =/ (x',,- • -.χ'„)- There are four ways to attack the system, (1) let x, be polynomials of y, with indeterminate coefficients. Do enough experiments using x, to determine y, and then solve the system of linear equations in the indeterminate coefficients to find polynomials g, or (2) apply resultant to y, = /(x,,- • - ,x n ) to recover plaintext x, or (3) find the maps φ x ,φ 2 directly or (4) use Newton Polyhedron Method to fined the maps φ ,φ 2 . Let us discuss the costs involved for the above four ways; ( 1 ) As we pointed out in Remark 2 that the total degrees of g } are very high, for discussions, we may assume that they are all of degree 2s. Then there are n x (2s + l)(2.s + 2)- - • (2s + n - \)ln possible terms. That is the dimension of the linear system. We conclude that it takes at least ((\/(n-\)\)(2s)") 2 5 steps of multiplications to solve the system. In the field K, every multiplication takes 2m shift operations. Totally, it takes 2m((\/(n-l)\)(2s) n ) 2 i shift operations to solve the system. For instance, in our previous example let us use the Sterling Formula and the following approximate estimate, (1) n\ =- (n/eY (2) e'= 10 3 then the number of shift operations needed is greater than 10 183 . Take a fast computer which is capable of execution 10 9 steps per second. Note that 1 year = 3.1536 x 10 7 seconds. It will take about 10' 66 . (2) Use resultant to eliminate variables , from the equations ^, = (x I , < ■ ,x n ) and then solving the equations in last variable x, to get the expressions x, = g,(y,,' ' The known complexity analysis (cf pg 75[6]) is o(n 3 s 5n log 2 (dm)). In our example, the number of shift operations needed is greater than 10 509 . A fast computer will spend 3 x 10 492 years to do it. (3) Find the maps φ^ 2 directly. The forms of φ, is covered up in the final forms of 7r(X | ). We shall find φ 2 first. Let us consider the case that the polynomial g j+ i,' • ', „) is homogeneous of degree 4. There are {n{n + \)(n + 2){n + 3))/4! monomials of degree 4 in n variables. That is the dimension of the space of the possible polynomials q in the above Equation (3)*. In our previous example, let us find a simple lower bound of the number τ of the possible q, in (3)**. Assume we separate all variable x 2 ,- ■ - . m into 11 blocks of 8 variables and one 12 variables. Let us consider the following expression, The number of all possible similar expressions is 8!/2 4 4. The corresponding one for the block of 12 variables is 12!/2 5 6. Therefore we have τ > (100!/8!" 12!)(8!/2 6 )"(12!/2 7 3) ^ (100 100 /8 88 12 12 )6.20)10 3 '(1.24)10 7 > (2.89)10 147 In other words, it takes at least 10 130 years for a fast computer to just look at all cases. (4) The Newton Polyhedron Method is to study the convex hall of the set of the exponents of non-zero terms of/ in «-dimensional space. This method may provide valuable informations about the polynomials /. Many data are provided by the number of appearances of variables x, mod 2 in /. From those data we may speculate about the polynomial q x J+ ι,'-,Xι 0 ι). In our example, those data are hidden. Signatures. Since we use automoφhisms π, then given any y ,y ^ ' ' > .vX ^ e legitimate user can easily produce x',,x' 2 ,- • -.x' n with x', = xXy',) as the digital signature. The Public Key Scheme. We will enhance the above method of the tame automorphisms to produce the following Public Key Scheme (see section [3]). One of the advantages is that all polynomials involved are quadratics. To this end we will first discuss the following technical section [2]. [2] Two Concepts. Let A„ — ,Λ s be polynomials in variables x,,—,x t . If we consider polynomials in h ,—,h v then some form, r, in x,, --,x, may be the highest degree forms of a polynomial Q in A,,---,/J S . We shall have the following definition. DEFINITION. Let r(x„— .x,) be a form. Let the generating degree, in symbol gendeg(r), be the minimal degree of Q(A„— ,Λ S ) such that Q(h 1 ,(x ] ,- r «t)" , Λ( i' , ' ^t)) = r + lower terms If the above conditions are satisfied, then Q is called a (minimal) generating polynomial of r. If there is no such polynomial Q, then we define gendeg(r)=∞. Example 1 : Let the field K be of 2 m elements, t = 16 and s = 27. Let n 3 = X [ X 2 ; 5 h 4 =x,x 3 ; h 5 = x,x 4 ; h 6 = x,x 5 ; l\η — X 2 X 4 , "8 — X 2 X 5' 10 h,= x 3 x 4 + x 6 x 7 ; n i0 — X 3 X 5 X 8 X ' h,,= x 3 x 6 n 12 — x 5 x 7 ; ^13 _ X 3 X 9' 15 h 14 =x 4 x 8 ; n i5 = X 6 X 8' "l6 = 6 X 9Ϊ h 17 — x 7 x g + x ]0 x u , n i8 — X 7 X 9 X 12 X 13' h 2 0 = X 9 X 1 1 > n 21 = x 7 x ]2 ; n 22 = X 8 X I3' n i3 — X 10 X 12' h 2 = Xπ x i3' n 26 = X ~I4 +X 15> Ω 27 ~ X 15 +X 16' Then the following Q is a generating polynomial of x 2 ]6 of degree 8 in h„ Q = h 4 ,h 2 + h 4 3 h + h 4 5 h 4 „ + h 7 h 8 (h 9 h, 0 + h 2 ,,h 2 12 + h, 3 h, 4 ) + h 2 7 h 2 8 h 15 h 16 (h 17 h, 8 + h 19 h 20 + h 21 h 22 + h 23 h 24 )+ h 8 2S + h 4 26 + h 2 27 The following example will be used later. Example 2: Let the field K be of 2 m elements. Let p,= X p 2 = χ X p 3 = x 3 x 2 ; p 4 =x,x 3 + x 4 x 2 ; p 6 =x,x 5 + x 6 x 2 ; p — X | X 2 + X5X6, Then the following P is the minimal defining polynomial of the above polynomials over K, P = p 7 2 p 2 7 + p,p 8 2 + (p 2 2 p 2 5 + p,p 2 p 2 4 + P 2 ,P 2 3 )(PιP 2 2 P 2 5 + P 2 ,P 2 P 2 4 + P 3 ιP 2 3 + P 3 2 P 2 6) Note that it is of degree 9. Remark 6: The polynomials Q,P will be used to construct a public key scheme in the next section. The security of the scheme depends on the degrees Q,P and their complexities. However, the degrees of Q,P can be increased easily by the technique of the two examples. Therefore, any attack based on the degrees Q,P being 8,9 would not be taken seriously. Let us introduce a new number as follows. Let h, be a polynomial of (x,,—,x,) with degree form q,. Let us define the diffdim (h j )=dim (the vector space generated θq, : ; ' = !, ■■ • , t}). Note that diffdim h x = 0,2,4 in our previous examples. dx } [3] Scheme. Any pair of polynomials Q,P similar to the ones in the previous section can be used to produce a scheme. Let us consider the two example in the previous section and use their notations, especially the generating polynomial Q(h,,— , ,-) and the polynomials h,, • •• , ?,,, homogenous polynomials p Let n = 70, r = 30. Let the field K be F 2m the finite field of 2 m elements. Let us use the following notations: we shall separate the indices / = 1 ,— ,64 to the 10 blocks as = 1 , = 1 + j + 7k where j = 1,— ,7 and k = 0,— ,8. The user selects the following randomly α, = α j (x,,---,x j )= linear form involving x ( , for ; ' = l,- -,70 β, = linear form in {x,,-,x 54 }, for = 65, -,70, 98, 99, 100 7i = linear form in {x„-,x 54 }, for = 65,-,70, 98, 99, 100 The user selects φ, to be any random invertible linear transformation such that φ,(Xi) = a, + linear forms in {x,,— ,x 70 } with ^ ≠ 0, for /, - •• , 70 φ,(Xi) = X j , for = 71,-, 100 The user selects φ 2 ,φ 2 to be the tame automoφhisms satisfies the following conditions (1)* — (7)* and φ 4 an invertible linear transformation satisfying the condition (8)* in the following way (1)*: φ 2 (x,) = x, (2)*: φ 2 (x,) = α, + P j (x l+6k ,-,x 6+6k ), where / = 1 + j + 7k, for i = 2,-,64 (3)*: φ 2 (x,) = α, + β + γ„ for = 65,-,70 (4)*: φ 2 (x.) = x, + h, .70 (x 55 ,-,x 70 ), for / = 71, -,97 (5)*: φ 2 (x,) = x, + β + γ,, for i = 98,99,100 (6)*: φ 3 ( Xj ) = x r for; = 2,-,100. (7)*: φ 3 (x,) = x, + b,Q(x 7 ,-,x 97 )), b, 0 (8)*: τr(x,) = φ,φ 3 φ 2 φβ) = π,(x„-,x 100 ), τr,(0,-,0) = 0 The field K and the polynomials /(x,,-,x 70 )= π,(x 1 ,---,x 7o ,0,- -,0) for ; ' = 1 , --,100 will be announced publicly. Detail description of the Scheme Due to the notations and indices involved in the preceding paragraph, we shall write down concrete formula for φ 2 as follows, (1)*: φ 2 (x,) = x, (2)*: φ 2 (x 2 = cx 2 + p,(x,,-,x 5 ) = 2 + x 2 „ (2)*: φ 2 (x 3 = α 3 + p 2 (x,,-,x 6 ) = α 3 + x 2 2 , (2)*: φ 2 (x 4 = α 4 + p 3 (x„-,x 6 ) = or 4 + x 3 x 2 , (2)*: φ 2 (x 5 = ct 5 + p 4 (x„-,x 6 ) = 5 + x 3 x, + x 4 x 2 , (2)*: Φ 2 (x 6 = α 6 + P 5 ( x ι --' x ) = «6 + X 4 X 1 + X 5 X 2> (2)*: φ 2 (x 7. = α 7 + p 5 (x„-,x 6 ) = α 7 + x 5 x, + x 6 x 2 , (2)*: Φ 2 (x 8 . = α 8 + p 7 (x„-,x 6 ) = o; 8 + x,x 2 + x 5 x 6 , (2)*: φ 2 (x 9 = g + p,(x 7 ,-,x 12 ) = or 9 + x 2 7 , (2)*: φ 2 (x l0 ) = l0 + p 2 (x 7 ,-,x l2 ) = α 10 + x 2 8 (2)*: φ 2 (x 58 «58 + <*58 + 2 4 , (2)*: φ 2 (x 59 ^59 P 2 V X 49' °" ' X 54 — ^5 + X 50' (2)*: Φ 2 (x 60 : ^ 0 P3( X 49' '" ' X 54) — α 60 + X 51 X 50' (2)*: Φ 2 (x 61 α 61 + P4( X 495 '" ' X 54) — a 6\ X 51 X 49 " * " X 52 X 50' (2)*: Φ 2 (x 62 0i 62 P5V X 49' "" ' X 54 — α 62 " * " X 52 X 49 + X 53 X 50' (2)*: Φ 2 (x 63 α 63 P6V X 49' '" ' X 54 — α 63 + X 49 X 53 + X 54 X 50' (2)*: Φ 2 (x 64 α 64 P?( X ' '" ' X 54 — α 64 + X 49 X 50 X 53 X 54> (3)*: Φ 2 (x 65 «65 + 3 2 65 + 765 (3)*: 2 (x 70 "70 + Xo + Ϊ70 (4)*: Φ 2 (x 7 , X 7 i h | (x 55 ,"-,x 70 ) — x 7] + x 55 + x 56 x 57 , (4)*: φ 2 2(Vx Λ 72 x 72 ' Π 2 ^X 55 ,'",X 7Q J — x 72 "" x 55 + x 5 x 59 , (4)*: Φ 2 (x„ x 73 + h 3 (x 55 ,— ,x 70 ) — x 73 + x 55 x 56 , (4)*: Φ 2 (x 74 X 74 + U 4 (X J5 ,"'-,X 70 ) — x 7 + x 55 X 57 , (4)*: Φ 2 (x 96 X 96 n 26V X 55' '" ' X 7θ — 96 " * " X 68 X 69' (4) + : Φ 2 (x 97 x 97 T n 27 (x 55 ,"-,x 70 ) — x 97 + x 69 + x 70 , (5)*: φ 2 (x 98 X 98 ~ * ~ 98 + 798 (5)*: φ 2 (x 99 ; X 99 + P 99 799 (5)*: φ 2 (x m ) = x I00 + β 2 m + 7 100 Plaintexts, Users and Compactness: Let us count the possible number of plaintexts; since the number of plaintexts is just the number of choices for x',,—,x' 70 , we see that there are 2 70m such plaintexts. To have a rich scheme and to prevent the attackers from forming tables of plaintext-cyphertext, and to avoid the usage of the following identities over the finite field F m 2 to cut down the degrees, ~ , - , = o it is suggested to require m > 20. Of equal importance to have a large number of possible plaintexts is having lots of possible users. In order to allow for many such users, we first get an expression for this number in terms of m and 70. This amounts to count the number of automoφhisms φ of the form φ = φ ] φ 2 φ i φ 4 . Assuming that a negligible proportion of these automoφhism φ have more than one representation φ = the number of users is asymptotic to (choices for φ 4 ) x (choices for φ 3 ) x (choices for φ 2 ) x (choices for φX The number of invertible linear transformations φ, is ] n i (2 mj - 1) = 2 mn < n " /2 = 2 3003m . A similar count of terms of φ 4 shows that the total possible number of users is > 2 7953m . It follows from Corollary 2 and the preceding conditions that we have, max{deg yl > 2' 3 Since φ,,φ 4 are linear transformations, therefore the theoretic total number of terms in 7T 1 is 100 (π,(2 13 + /))/100! > 10 254 . Note that the form of the map TΓ is not given to the public. Without knowing it, it is impossible to compute TΓ 1 . We will study the compactness of the scheme. It is easy to see that the number of terms of polynomials of degree 2 is (71)(72)/2!, and we have 100 polynomials, therefore the total number of terms is 255,600. Using a simple trick, we may reduce the number to 191,988. We believe that the numbers may be further reduced. This is the cost to the senders. For the legitimate receiver, the number of terms for φy,φ 2 φ 3 - φy is 25,000. As the technique improves, and new generating polynomial and defining polynomial Q,P discovered, the number of terms will be reduced. Error Detecting Function Upon receiving the cypertext Cy' the user apply φyφy yφy to decode and get ,,— x )00 ). If one of x 71 ,— x 100 is not zero, then there must be an error. Master Key Function Select a group of indices from 98, 99, 100. Select φ 4 such that the corresponding subspace generated by x, with / ' from this group of indices and the subspace generated by x J of the remaining indices from 1,— ,100 are both invariant. The original scheme is the master key. Another key can be produced by deleting all f, with i from this group of indices. Another way to produce a master key is to find a polynomial Q(f,,—,f n ,—,f n+r+s ), such that both it and its specialization Q(f,,— ,f n+r ,0,— ,0) can be used to construct public key scheme. Then we require that φ, to keep that space {c,,—,c n+r ,0,--,0} invariant and use the specialization x, -→ 0 for = n + r + 1,—, n + r + s to create a master key. The 'master key-ordinary key' relation can be broken by alternating any one of the 4 linear transformations φ ,φ 4 involved. Signatures The map TX is not an onto map. However, we may restrict to a suitable subspace. Let V = {(d^-^d^O,--^)} where j is a fixed integer less than or equal to 54, say 50. LetV = φ,"'(V). We shall require that φ 4 induces a linear transformation on W = {(e,-,^,-^)}. Let r : (c,,-,c r -,c I00 ) → (c } ,-,c } ) be a projection. Then clearly TTT in an one to one and onto map fromV to the j- dimensional affine space. Moreover, the map is tame, and its inverse can be found if the values (y' , ,—,y' j ) are known. The inverse forms a signature. [4] Cryptanalysis for the Scheme. I. Direct Methods It is not expensive for the legitimate user to select α , 3 j ,γ ,b , the tame automoφhism π, and to construct an inverse map τr = φyφyφyφy (cf Corollary 3), the polynomials f,(x,,— ,x 70 ) = ιr,(x,,— ,x 70 ,0,—,0) for / ' = 1 ,— ,100. The expense to the sender is mainly in evaluation polynomials y', = I](X ] -> " \X 7θ - There are three direct ways to attack the scheme, (1) use the 'inverse formula' for power series to find the polynomial expressions of 7r'(cf[9]). Note that only TΓ is given, and there is no way to find 7? 1 which does not exist theoretically, or (2) let x, be polynomials of y, with indeterminate coefficients. Do enough experiments using x, to determine y j and then solve the system of linear equations in the indeterminate coefficients to find polynomials g, or (3) using resultant to the expressions y', = f^x' ,,— ,x' 70 ) to eliminate all x', except one, and recover the expressions of x' in terms of y'„-,y' I00 . At this moment, the number of terms of the inverse map TΓ 1 > (10 254 ) which is beyond reach. The above three methods are ineffective. The only possible way of attacking is to recover φ, or their equivalent forms. II. Search for the Generating Polynomial Knowing the recipe of the construction of the public key scheme, one may launch a step by step search as follows. We consider all monomials of some fixed degree of all polynomials f,,— ,f 100 . It follows from Example 1 & 2 of section 4 that we have to consider polynomials of degree 9 or 8 in f,, -,f, 00 . For degree 9, the dimension is C 108 9 = 4(10 12 ). For degree 8, the dimension is ~ 3.26(10"). They are beyond the reach of present day computing technology. We may select Q,P with higher degrees to defend the scheme if necessary. III. Identify Degree Forms We should try to find v,=the highest degree forms of φ 2 (x,). Let the highest degree forms of f, = u,. Let U = {the vector space generated by u,}. As we pointed out in section 4 that the diffdim of some polynomial h, is 4. Then we want to find suitable numbers (z,,—,z 100 ) such that for some fixed k, 100 w = ∑ z,u, = v k =1 and diffdim(v k ) = 4. A necessary condition is that all partial derivatives, w , of w with respect to X j span a vector space of dimension = 4. Let u υ = ∑ a ljk x k be the partial derivative of u, with respect to x We have several ways of using the above information. A: Let A, be the 100 x 100 coefficient matrix (a 1Jk ), and A = ∑ I=1 100 Z j A j . Let us assume that A is of rank 4 with coefficients linear forms in the variables z„—,z 100 . It produces 100 homogenous equations in 100 variables of degree 5. It follows from pg 75 of [7] that the time required to solve the equations is O(m (100) 5 500 ) =- m 2 10 337 . B: Since the diffdim (vk) = 4, for some c,,c 2 ,c 3 ,c 4 ,c 5 , we have Σ J=1 5 c w = 0. Let B j be the 100 x 100 coefficient matrix (a ljk ), and B = ,,, 5 cfy. Then B is of rank < 100 with coefficients linear forms in the variables c,,—,c 5 . It produces 5 homogenous equations in 5 variables of degree 100. It follows from pg 75 of [7] that the time required to solve the equations is O(m 2 5 (100 25 )). The number is — m 2 2.5(10 5i ). C: We may try random tuple (u',,— ,u' 5 ) from that number field F . The total possibility is 2 5m = 10 30 if we take m = 20. Note that there are 3(10 7 ) seconds in a year. Let us use a fast computer which operate 10 9 shift operations a second. Then it takes about m 2 10 320 , m 10 34 ,10 13 years respectively for the above method A, B, C to find the quadratic forms. While this invention has been described as having an exemplary design, the present invention may be further modified within the spirit and scope of this disclosure. This application is therefore intended to cover any variations, uses, or adaptations of the invention using its general principles. Further, this application is intended to cover such departures from the present disclosure as come within known or customary practice in the art to which this invention pertains. REFERENCES [1] ABHYANKAR, S.S. and MOH, T.T., Embeddings of the line in the plane.. Journal fur die reine and angewandte Mathematik., 276 (1975), 148-166. [2] BAJAJ, C. GARRITY, T. WARREN, J., On the Application of Multi-Equational Resultants, Purdue University, Dept. of CS. Technical Report CSD-TR-826 (1988). [3] BERLEKAMP, E.R., Factoring polynomials over finite fields, Bell System Tech. J., 46 (1967), 1953-1859. [4] BRANDSTROM, H., A public-key cryptosystem based upon equations over a finite field, Cryptologia, 7 (1983), 347-358. [5] BRENT, R., and KUNG, H.„ Fast Algorithms for Manipulating Formal Power Series, Journal of ACM,, 25 Number 4 (1978), 581-595. [6] BRESINSKY, H., On Prime Ideals with Generic Zero x, = t nι , Proc. Amer. Math Soc, 47 Number 2 (1975), 329-332. [7] CANNY, JOHN F., The Complexity of Robot Motion Planning, The MIT Press, Cambridge, Massachusetts, 1988. [8] COHEN, HENRI, A course in Computational Algebraic Number Theory, Springer- Verlag, Berlin Heidelberg New York London Paris Tokyo Hong Kong Barcelona Budapest, 1983 [9] DICKERSON, MATHEW, The inverse of an automophism in Polynomial Time, J. Symbolic Computation (1992 (13)), 209-220. [10] LIDL, R and H. NIEDERREITER, Finite fields, Addison- Wesley, Reading, Massachusetts, 1983. [1 1] LIDL, R, On Cryptosystems Based on Polynomials and Finite Fields, Advances in Cryptology (Proceedings of EUROCRYPT 84) (1984), 10-15. [12] MOH, T.T., On the Classification Problem of Embedded Lines in Characteristic p„ Algebraic Geometry and Commutative Algebra in honor of M. Nagata (1988) Vol. I, 267-280. [13] NAGATA, M., On the automoφhism group of K[X,Y]„ Lectures in Mathematics, Tokyo, 1972. [14] H. NIEDERREITER, New Deterministic Factorization Algorithms for Polynomials over Finite Fields, Contemporary Mathematics (Finite Fields), 168 (1993), 251-268. [15] R.L. RIVEST, A. SHAMIR & L. ADLEMAN, A Method for Obtaining Digital Signatures and Public Key Cryptosystems, ACM 21, 120-126 (Feb. 1978). [16] J. HOPCROFT, J. ULLMAN, Introduction to Automata Theory, Languages & Computation, Addison Wesley, Reading, Massachusetts, 1979. [17] W. VAN DER KULK, On polynomial rings in two variables,, Nieuw Archief voor Wiskunde. (3), I (1953), 33-41.

Claims: CLAIMS 1. A method of electronically transmitting messages comprising the steps: applying an encryption algorithm to encode a plain text message into a cyphertext message for electronic transmission; transmitting the cyphertexted message over an electronic medium; receiving the cyphertexted message; and decrypting the cyphertexted message, characterized in that the encrypting and decrypting steps utilize a tame automoφhism based algorithm. 2. The method of Claim 1 characterized in that the tame automoφhism based algorithm includes an equation of one of the forms in any order of the variables x,,— ,x n : (l):φ,(x,)= x, + h„(x 2 ,-,x n )=y 1 ; (2):φ,(x 2 )= x 2 + h, 2 (x 3 ,-,x n )=y 2 ; (n):φ,(x n )= x n = y n ; and any linear transformation of the above mentioned equations. 3. The method of Claim 2 characterized in that the tame automoφhism based algorithm utilizes two encryption keys, a public key 7r(x,) = φ^-φ^β = f,(x,,— ,x n ) and a private key ιr l = φ 1 1 φ 2 -'-"φ k - 1 , where φ, is a tame automoφhism. 4. The method of Claim 3 characterized in that the public key is made generally available. 5. The method of Claim 4 characterized in that the private key is maintained privately. 6. A computer system for transmitting electronic messages comprising encoding means for encrypting a plain text message into a cyphertexted message; and decoding means for decrypting the cyphertexted message, characterized in that said encoding means utilizes a tame automoφhism based encryption algorithm and the decoding means utilizes a tame automoφhism based decryption algorithm. 7. The computer system of Claim 6 characterized in that the tame automoφhism based algorithm includes an equation of one of the forms in any order of the variables x,,—,x n : (l):φ,(x,)= x, + h„(x 2 ,-,x n )=y,; (2):φ,(x 2 )= x 2 + h, 2 (x 3 ,-,x n )=y 2 ; (n):φ,(x n )= x„ = y n ; and any linear tranformation of the above referenced equations. 8. The computer system of Claim 7 characterized in that the tame automoφhism based algorithm utilizes two encryption keys, a public key π(x,) = φ k --φ 2 φ 1 (x,)= f^x,,— ,x n ) and a private key τr l = φ Λ φ 2 —φ k Λ , where φ, is a tame automoφhism. 9. The computer system of Claim 8 characterized in that the public key is made generally available. 10. The computer system of Claim 9 characterized in that the private key is maintained privately. 1 1. A method of preserving the integrity and privacy of data comprising the steps: applying an encryption algorithm to encode the data into a cyphertext; decrypting the cyphertexted data, characterized in the encrypting and encrypting steps utilize a tame automoφhism based algorithm. 12. The method of Claim 1 1 characterized in that the tame automoφhism based algorithm includes an equation of one of the forms in any order of the variables x,,—^: (l):φ,(x,)= x, + h„(x 2 ,-,x n )=y,; (2):φ,(x 2 )= x 2 + h l2 (x 3 ,-,x n )-y 2 ; (n):φ,(x„X x n = y n ; and any linear tranformation of the above mentioned equations. 13. The method of Claim 12 characterized in that the tame automoφhism algorithm utilizes two encryption keys, a public key τ(x,) = φ^—φ^^x^ f 1 (x,,---,x n ) and a private key ιr l - φyφ 2 -φy, where φ, is a tame automoφhism. 14. The method of Claim 13 characterized in that the public key is made generally available. 15. The method of Claim 14 characterized in that the private key is maintained privately. 16. A method of verifying the authenticity of a product comprising the steps: applying a private key encryption algorithm to encode a serial number of the product into a cyphertext; decrypting the cyphertexted serial numbers using the private key to verify the authenticity of the product, characterized in the encrypting and decrypting steps utilize a tame automoφhism based algorithm. 17. The method of Claim 16 characterized in that the tame automoφhism based algorithm includes an equation of one of the forms in any order of the variables x„— ,x„: (l):φ,(x,)= x ] + h„(x 2 ,-,x n )=y,; (2):φ,(x 2 )= x 2 + h l2 (x 3 ,-,x n )=y 2 ; (n):φ,(x n )= x n = y n ; and any linear transformation of the above mentioned equations. 18. The method of Claim 17 characterized in that the tame automoφhism utilizes two encryption keys, a public key 7r(x,) = φ k -- φ 2 φ,(x 1 )= f,(x,,— ,x n ) and a private key ir 1 = φyφ 2 l --φ k ' where φ, is a tame automoφhism. 19. The method of Claim 18 characterized in that the public key is made generally available. 20. The method of Claim 19 characterized in that the private key is maintained privately. 21. A method of avoiding unauthorized alteration of data in a data storage card comprising the steps: applying the private key encryption algorithm to encode the modification of data in the data storage card; decrypting the encrypted data using the public key, characterized in the encrypting and decrypting steps utilize a tame automoφhism based algorithm. 22. The method of Claim 21 characterized in that the tame automoφhism based algorithm includes an equation of one of the forms in any order of the variables x,,—,x n : (l):φ,(x,)= x, + h 1I (x 2 ,-,x n )=y I ; (2):φ,(x 2 )= x 2 + h l2 (x 3 ,-,x n )=y 2 ; G):φ,(x J )= X j + (x i+ ,-,x n )=y ,- (n):φ,(x n )= x n = y n ; and any linear transformation of the above mentioned equations. 23. The method of Claim 22 characterized in that the tame automoφhism based algorithm utilizes two encryption keys, a public key 7τ(x,) = φ^-φ j φβ = f,(x,,—,x n ) and a private key 7T 1 = φ l 1 φ 2 - 1 -"φ k 1 , where φ, is a tame automoφhism. 24. The method of Claim 23 characterized in that the public key is made generally available. 25. The method of Claim 24 characterized in that the private key is maintained privately. 26. A method of verifying the identity of the sender of electronically transmitted message comprising the steps: transmitting one signal from a non- repeating sequence; applying a private key encryption algorithm to encode the signal into a cyphertext; decrypting the cyphertexted signal using a public key, characterized in the encrypting and decrypting steps utilize a tame automoφhism based algorithm. 27. The method of Claim 26 characterized in that the tame automoφhism based algorithm includes an equation of one of the forms in any order of the variables x,,— ,x n : any linear transformation of the above mentioned equations. 28. The method of Claim 27 characterized in that the tame automoφhism based algorithm utilizes two encryption keys, a public key 7r(x,) = φ k --φ 2 φβ) = f j CX —.x,,) and a private key tr = φ,- , φ 2 - 1 — φ k _1 , where φ, is a tame automoφhism. 29. The method of Claim 28 characterized in that the public key is made generally available. 30. The method of Claim 29 characterized in that the private key is maintained privately. 31. A method of creating ordinary public key from a master public key in a two key encryption system comprising the steps of replacing a portion of the encryption polynomial with zero values, characterized in that the encryption polynomial utilizes a tame automoφhism. 32. The method of Claim 31 characterized in that the tame automoφhism based algorithm includes an equation of one of the forms in any order of the variables x,,— ^ (l):φ,(x,)= x, + h,,(x 2 ,-,x n )=y 1 ; (2):φ,(x 2 )= x 2 + h l2 (x 3 ,-,x n )=y 2 ; (n):φ,(x n )= x n = y n ; and any linear transformation of the above mentioned equations.

Inventors: MOH TZUONG-TSIENG, MOH, TZUONG-TSIENG
Applicants: MOH TZUONG TSIENG, MOH, TZUONG-TSIENG
Application year: 1996
Main classification: H04K1
IPC codes: G09C1, H04L9