Secret material exchange and authentication cryptography operations

Abstract

Aspects of associative cryptography key operations are described. In one embodiment, a first cryptographic function is applied to secret data to produce a first encrypted result. The first encrypted result is transmitted by a first device to a second device. The second device applies a second cryptographic function to the first encrypted result to produce a second encrypted result. At this point, the secret data has been encrypted by two different cryptographic functions, each of them being sufficient to secure the secret data from others. The two different cryptographic function can be inversed or removed, in any order, to reveal the secret data. Thus, the first device can apply a first inverse cryptographic function to the second encrypted result to produce a first result, and the second device can apply a second inverse cryptographic function to the first result to decrypt the secret data.

Description

BACKGROUND

Cryptography is related to the study of protocols, techniques, and approaches that prevent third parties from accessing, reading, and/or interpreting secret data. Cryptography can be applied to various processes in information security, such as data integrity and encryption, confidentiality, authentication, verification, and non-repudiation. Thus, cryptography has several applications in various fields, including data encryption and privacy, computer network communications and transaction processing, and computing system security and integrity.

Modern cryptography often relies upon computational hardness in mathematical theory. In other words, it might be theoretically possible to break certain cryptographic systems, but the time required to do so makes such cryptographic-defeating processes intractable. Typically, computationally-secure cryptography processes are preferable to those which are easier to defeat. At the same time, however, computationally-secure cryptography processes might be more computationally-intensive to implement and, thus, more time consuming and costly. In that context, although some cryptographic processes, such as a one time pad, cannot be broken or defeated even with unlimited computing power, those schemes are more difficult to implement than a good, theoretically-breakable but computationally secure approach. As such, modern computing devices may exchange secret data using cryptographic processes having security problems (e.g., the processes are susceptible to brute force attack). At the same time, those cryptographic processes may be resource intensive (e.g., the processes are computationally-intensive to implement).

BRIEF DESCRIPTION OF THE DRAWINGS

Many aspects of the present disclosure can be better understood with reference to the following drawings. The components in the drawings are not necessarily to scale, with emphasis instead being placed upon clearly illustrating the principles of the disclosure. Moreover, in the drawings, like reference numerals designate corresponding parts throughout the several views.

FIG. 1 illustrates a process of secret text transfer using asymmetric keys.

FIG. 2 illustrates a representative process of secret key transfer using cryptography processes according to various embodiments described herein.

FIG. 3A illustrates an example distribution function of variables resulting from the white noise associative cryptography key operations according to various embodiments described herein.

FIG. 3B illustrates example probability distribution functions of variables resulting from the white noise associative cryptography key operations according to various embodiments described herein.

FIG. 4 illustrates example user interfaces of a program to perform cryptography key operations according to various embodiments described herein.

FIG. 5 illustrates a more particular example of a secret key transfer process according to the concepts described herein.

FIG. 6 illustrates an example of a secret key transfer process using authentication according to the concepts described herein.

DETAILED DESCRIPTION

As noted above, cryptography is related to the study of protocols, techniques, and approaches that prevent third parties from accessing, reading, and/or interpreting secret data. In the context of cryptography, the Rivest-Shamir-Adleman (RSA) cryptosystem, elliptic curve cryptography (ECC) cryptosystem, and other asymmetrical (and symmetrical) methods of secure key exchange have security problems. Those cryptosystems are based on complexity and can, theoretically, be decrypted.

In contrast to the RSA, ECC, and other cryptosystems, the cryptographic processes described herein is more immune to cryptanalysis and permits the sharing of secret data, such as symmetric keys and other secret data, over public networks. The cryptographic system can also be used for authentication. No known methods of traditional or quantum computing can be used to circumvent the cryptographic approaches described herein. The cryptographic system described herein was developed to achieve a number of goals including (1) securely exchanging cryptographic keys over public networks, (2) information ciphering, authentication, and (4) encryption for public networks that is secure against standard and quantum computing.

In the context described herein, white noise can be defined as (or can include) a sequence of independent random variables (e.g., discrete numbers) with a uniform probability distribution. Polynomial white noise can be defined as (or can include) a sequence of polynomial function values composed by independent random variables (e.g., discrete numbers) with a uniform probability distribution.

No known algorithm can decrypt the operations described herein due, at least in part, to the use of white noise randomization. The unknown independent variables appear to third parties as random white noise and, thus, there is no correlation between those variables and any information being transferred. As one example, the key exchange method or process described herein can be shown as an exchange of matrices with a corresponding number of different unknown independent variables and visible values. The number of unknown independent variables always exceeds the number of visible independent values in any combination of subsets of matrices. Further, the number of unknown variables exceeds the number of publically visible polynomial functions. Additionally, no inverse polynomial functions can be determined without information about the secret key—even if the plain text of the secret key is known by a third party.

Turning to the drawings, FIG. 1 illustrates a process of secret text transfer using asymmetric keys. In the example shown in FIG. 1, Alice wishes to communicate secret text to Bob over a public network, such as the Internet, and Eve is the eavesdropper. To communicate the secret text, which can be a symmetric key or any other secret information, Alice and Bob use asymmetric cryptography. Asymmetric cryptography relies upon a key pair including a public key that can be disseminated to third parties (e.g., Alice) and a private key which is kept private (e.g., by Bob). In an asymmetric cryptography system, any person can encrypt a message using the public key, and that encrypted message can only be decrypted using the private key. The strength of asymmetric cryptography relies on the degree of difficulty (e.g., computational impracticality) for a private key to be determined from its associated public key. Asymmetric cryptography also depends on keeping the private key private.

Referring back to FIG. 1, Alice obtains a copy of a public key from Bob (or any other source). Alice encrypts the secret text using the public key to produce the encrypted secret text and communicates it to Bob over the public network. Bob then decrypts the encrypted secret text using the private key to obtain the secret key. Over the public network, Eve can only see the encrypted secret text. Even if Eve obtains a copy of the encrypted secret text and the public key used to create it, Eve cannot obtain the secret text from the encrypted secret text using the public key. Instead, only the private key, which is securely held and protected by Bob, can be used to decrypt the encrypted secret text to obtain the secret text from Alice.

There are drawbacks and limitations to using asymmetric cryptography. For example, it is algorithmically possible to estimate (or determine) the private key in a key pair from the publicly available public key. Additionally, asymmetric key pairs are relatively difficult and time consuming to create, typically depending upon the identification of large prime numbers. Further, asymmetric cryptography can be vulnerable in that it may produce the same predictable encrypted output when the same secret text is encrypted.

To be distinguished from other cryptographic systems, various cryptography processes or operations are described herein. In one embodiment, a first cryptographic function is applied to secret data. The first cryptographic function operates as a type of cryptographic key and encrypts or ciphers the secret data to produce a first encrypted result. The first encrypted result can be securely transmitted by a first device to a second device. The second device then applies a second cryptographic function to the first encrypted result. Similar to the first cryptographic function, the second cryptographic function operates as a cryptographic key and further (or doubly) encrypts or ciphers the first encrypted result to produce a second (or doubly) encrypted result. At this point, the secret data has been encrypted by two different cryptographic functions, each of them being sufficient to secure the secret data. The two different cryptographic functions can then be inversed or removed, in any order, to reveal the secret data.

Turning to the embodiments, FIG. 2 illustrates a representative process 20 of secret key transfer using cryptography processes according to various embodiments described herein. The process described below can be performed by any suitable computing device(s) including a processor and memory, without limitation. In the example shown in FIG. 2, Alice wants to securely pass the secret key X to Bob over a public network. To do so, Alice should first encrypt the secret key X before sending it to Bob.

To encrypt the secret key X, Alice holds a first cryptographic function F_A. In various embodiments, the cryptographic function F_A can be embodied as any suitable mathematical function having an inverse which cannot be determined without knowledge of a certain set of parameters of the mathematical function. In one embodiment, the function F_A can be embodied as a polynomial function or multivariate polynomial function defined in part by one or more variables, combinations of variables, combinations of variables at various powers, and coefficients. To undo or unlock (e.g., decrypt) the effect of the cryptographic function F_A, Alice also holds a first inverse cryptographic function F⁻¹A.

To start, at step 202, the process 20 includes Alice generating, with a first computing device, a first random lock X_A. The first random lock X_A can be embodied as an array or vector of random scalar integers, for example, or another suitable organized structure of random numbers. In the process 20, the first random lock X_A can operate as a type of initialization vector upon which the cryptographic function F_A is applied in combination with the secret key X. For example, the first random lock X_A helps to randomize the application of the cryptographic function F_A creating, in effect, a new random cryptographic function F_A for each different random lock X_A. In that context, the first random lock X₄ helps to achieve semantic security, so that repeated usage of the cryptographic function F_A with the same operand does not produce the same ciphered result and does not allow an attacker to infer any information.

At step 204, the process 20 includes Alice applying, with the first computing device, the first cryptographic function F_A to a combination of the secret key X and the first random lock X_A to produce a first encrypted result R₁. Here, Alice's secret key X, which can include letters, numbers, American Standard Code for Information Interchange (ASCII) characters, etc., is ciphered with random numbers (i.e., the first random lock X_A) using the cryptographic operation or function F_A. The cryptographic function F_A can be embodied as any suitable mathematical function, such as a polynomial or multivariate polynomial function. For example, the cryptographic function F_A can be embodied as a polynomial function F(CX^k) of kth order written as:

$\begin{array}{cc}F\left({\mathrm{CX}}^k\right)=\sum _{i_1=1}^k\dots \sum _{i_k=1}^k{C}_{i_1{i}_2\dots i_k},X_{i_1},X_{i_2}\dots X_{i_k},& \left(1\right)\end{array}$ where C_{i . . . k} are coefficients of the polynomial function F(CX^k), and X_{i . . . k} are combinations of the operand X, which can include a combination of a random lock and secret data.

Thus, at step 204, Alice's secret key X, which may include letters, numbers, American Standard Code for Information Interchange (ASCII) characters, etc., are ciphered with random numbers based on the first random lock X_A and the first cryptographic function F_A. As an example, a distribution function of the variables in the results R₁, R₂, and R₃ is shown in FIG. 3A, and probability distribution functions of the variables in the results R₁, R₂, and R₃ is shown in FIG. 3B.

The structure of the polynomial function F(CX^k) and the coefficients can be known to others (although they generally are not) from the formalization of the algorithm. However, even if the structure of the polynomial function F and values of the coefficients C, k are known to a third party, the third party still cannot decrypt the transferred information.

At step 206, the process 20 includes Alice transmitting, with the first computing device, the first encrypted result R₁ to Bob's second computing device. At step 208, the process 20 includes Bob generating, with the second computing device, a second random lock X_B. Similar to the first random lock X_A, the second random lock X_B can be embodied as an array or vector of random scalar integers, for example, or another suitable organized structure of random numbers. In the process 20, the second random lock X_S can also operate as a type of initialization vector for the cryptographic function F_B. For example, the second random lock X_B helps to randomize the application of Bob's cryptographic function F_B creating, in effect, a new random cryptographic function F_B for each different random lock_XB. In that context, the second random lock X_B helps to achieve semantic security, so that repeated usage of the cryptographic function F_B with the same operand does not produce the same ciphered result and does not allow an attacker to infer any information.

At step 210, the process includes Bob applying, with the second computing device, Bob's cryptographic function F_B to a combination of the first encrypted result R₁ and the second random lock X_B to produce a second encrypted result R₂. Here, the first encrypted result R₁ (e.g., F_A(X,X_A)) is (doubly) ciphered with random numbers (i.e., the second random lock X_B) using the cryptographic operation or function F_B. The cryptographic function F_B can be embodied as any suitable mathematical function, such as a polynomial or multivariate polynomial function. For example, the cryptographic function F_B can be embodied as a polynomial function F(CX^k) of kth order according to that shown above in Equation (1).

At this point, Alice's secret key X has been encrypted or ciphered by two different cryptographic functions F_A and F_B, each of them being sufficient to secure the secret key X from others. The two different cryptographic functions can then be inversed or removed, in any order, to reveal the secret key X. In other words, to decrypt the secret key X from the second encrypted result R₂ (i.e., to undo the effects of the cryptographic functions F_A and Fa) it is possible to either apply the inverse F⁻¹_A function to F_A or the inverse F⁻¹_B function to F_B first. Thus, according to one aspect of associative cryptography key operations described herein, the order in which the second encrypted result R₂ is applied to the inverse cryptographic functions F⁻¹_A and F¹_B, does not impact the results of the decryption of secret key X from the second encrypted result R₂. Further, any number of cryptographic functions to F₁ . . . F_N can be applied to encrypt secret data in any order to produce an encrypted result R_N, and that encrypted result R_N can be decrypted in any order using the inverse cryptographic functions F⁻¹₁ . . . F⁻¹_N.

At step 212, the process 20 includes Bob transmitting, with the second computing device, the second encrypted result R₂ to the first computing device. At step 214, the process 20 includes Alice applying, with the first computing device, the first inverse cryptographic function F⁻¹_A to the second encrypted result R₂ to produce the result R₃. The first inverse cryptographic function F⁻¹_A unlocks or removes the effect of both the first random lock X_A and the first cryptographic function F_A. Thus, the result R₃ is what remains of the second encrypted result R₂ after the effect of the first random lock X_A and the first cryptographic function F_A are undone or unlocked (e.g., F_B(X,X_B)). Thus the result R₃ is still encrypted, but only by Bob's second random lock X_B and the second cryptographic function F_B, and the result R₃ can be securely transmitted over the public network.

At step 216, the process 20 includes Alice transmitting, with the first computing device, the result R₃ to the second computing device. Finally, at step 218, the process 20 includes Bob applying, with the second computing device, the second inverse cryptographic function F⁻¹_B to the result R₃ to arrive at the secret key X.

At the end of the process 20, the secret key X has been securely communicated from Alice to Bob. In contrast to the asymmetric key process described above with reference to FIG. 1, key pairs are not used in the process 20.

The general idea embodied in the process 20 is based on certain features of the publically unknown vectors X and the publically available (potentially visible) vectors R. Particularly, the number of variables “n” of the vectors X {x₁, . . . , x_n} is always more than the number of variables “m” of the vectors R={r₁, . . . , r_m}, i.e., n>m. Thus, there are no known algorithms which give a definite decryption solution of the secret key X, based only on visible values of the vectors R in the public networks. From this point of view, the method is cryptanalysis resistant. To obtain the only solution x₁, . . . , x_n from the values r₁, . . . , r_m of the polynomial functions F_A and F_B, the third party (e.g., outsider Eve) should have additional information about the structure of the random vectors X_A and X_B, which are available for Alice and Bob only. For instance, from x₁+x₂+x₃=r₁, it is not possible for a third party to arrive at a single solution for x₁ with only the value of the variable r₁ being publically visible, because the additional information about the values of the variables x₂+x₃ are not known.

A comparison of the features of asymmetrical methods and the method described herein is give in Table 1 below.

TABLE 1
	Public-Private Key
	Asymmetrical	PWN Three
Features	(RSA, ECC)	Pass Method
Numbers	Prime Numbers	Any Random
		Numbers
Time to Develop New Key	Relatively	Negligible
	More Costly
Processing Time	Relatively	Negligible
	More Costly
Inverse Function From	Relatively	Inverse Function
Public Key	Complex	Does Not Exist
Third Party Defeat	Possible	Never
Public Network Output	Constant,	Random,
For Constant Input	predictable	unpredictable

An example of the use of the method described herein is provided below. Using the method, plain text (as a letter or ASCII code of 256 numbers) is represented in ciphered text by three corresponding random numbers r₁, r₂ and r₃ which are calculated by a random generator. Table 2 shows an example of how the plain text “This is a plain text” appears in ciphered numbers.

	TABLE 2
	Plain
	text	Ciphered text
	text	r1	r2	r3
	T	0.001251	0.563585	0.003585
	h	0.193304	0.808741	0.158307
	i	0.585009	0.479873	0.28051
	s	0.350291	0.895962	0.313555
		0.82284	0.746605	0.614412
	i	0.174108	0.858943	0.151801
	s	0.710501	0.513535	0.363394
		0.303995	0.014985	0.006167
	a	0.091403	0.364452	0.035009
		0.147313	0.165899	0.02575
	p	0.988525	0.445692	0.438709
	1	0.119083	0.004669	0.001204 i
	a	0.00891 1	0.37788	0.005292
	i	0.531663	0.571184	0.303183
	n	0.601764	0.607166	0.363988
		0.166234	0.663045	0.113037
	t	0.450789	0.352123	0.159469
	e	0.057039	0.607685	0.037377
	x	0.783319	0.802606	0.623152
	t	0.519883	0.30195	0.157851

Uniform distribution is called “white noise” due to its informative features. For the letter ‘A’ (ASCII code 65), as one example, the random numbers may appear over the public net as r₁=0.001251, r₂=0.563585, r₃=0.560746 or r₁=0.585009, r₂=0.479873, r₃=0.105796 and every time the random variables r₁, r₂, r₃ will be unpredictable. The correlation function between any two variables x and y is estimated as follows:

$\begin{array}{cc}\mathrm{corr}\left(x,y\right)=\frac{\sum \left(x-\stackrel{\_}{x}\right)\left(y-\stackrel{\_}{y}\right)}{\sqrt{\sum {\left(x-\stackrel{\_}{x}\right)}^2\sum {\left(y-\stackrel{\_}{y}\right)}^2}}.& \left(2\right)\end{array}$ The results of correlation function evaluation for pairs (r₁, r₂), (r₂, r₃) and (r₁, r₃) are given in Table 3 below.

TABLE 3
corr (r1, r2)	corr (r2, r3)	corr (r1, r3)
−0.013927	−0.002873	−0.010771

The correlation is negligibly small, which means that ciphered information is encapsulated into white noise and is not analyzable by a third party. There are no known algorithms to decrypt the ciphered information without the encryption key.

In the approaches described herein, there are neither restrictions nor requirements on the encryption key number and length. All keys are equal in terms of crypt analysis resistance. Additionally, there are no correlations between the plain text and the ciphered random numbers (r₁, r₂, r₃), as the combinations of them are unpredictable. There are no known algorithms which can decrypt ciphered random numbers (r₁, r₂, r₃) into plain text without the key. There are no known algorithms which can recalculate the encryption key using visible ciphered random numbers (r₁, r₂, r₃) and visible plain text. There is no need for rotation of encryption keys if a physical, completely unpredictable random number generator is used. The series repetition period of real random numbers (r₁, r₂, r₃) is infinite.

Computational time needed to encrypt and decrypt data by the method described herein is significantly smaller than commonly used algorithms. Since the method uses polynomial functions, the transaction of numbers (or ASCII) should be controlled by calculation procedures. The analysis of 25,600,000 transactions demonstrates that the final error of the secret key value estimate does not exceed 0.001%. This means that, for example, the transaction of the letter ‘A,’ which is represented by the integer number 65 (ASCII), after all transformations from client to server could be calculated to be a number about 64.9999 (and depends in part on the random generator variables during the transaction).

A comparison of the features of a standard symmetrical method and the method described herein are given in Table 4 below.

TABLE 4
		WNT One Pass Transaction
	Symmetrical	(in combination with Three
Features	FIPS Pub 197	Pass Transaction)
Encryption Key Rotation	Must Have	Not Needed
Processing time	Costly	Negligible
Security resistance	Strong relation	No Relation
and key length
Hack	Costly	Never (Potentially
		Impossible)
Public net output for	Constant,	Random,
constant input	Predictable	Unpredictable
(without key
rotation)

A computer program was developed to implement the method described herein. As shown in FIG. 4, Alice securely sends her secret text “Hello bob” to Bob using the three pass transaction. In FIG. 4, random values appear to a third party during the three pass transaction (specially shown in the blue box).

Among other benefits, the processes described herein can be used to achieve unbreakable (or nearly unbreakable) encryption over wireless, wired, and public networks, and against quantum computing attacks. It requires relatively little processing power for encrypting and decrypting and, thus, can be used for rapid verification and transactions. A practically limitless number of new keys can be generated on the fly. Thus, the keys can be changed on every transaction. Encryption and decryption can also occur on individual devices due to the high speed of encryption and low processing requirements. Further, there is no single point of compromise because every individual party has their own key. If a key is compromised, it is the one compromised and can be renewed or replaced.

An outline of various problems encountered and solutions that can be provided by the cryptographic systems described herein are given in Table 5 below.

TABLE 5
Problem                 Solution
Establishing a secure   Digital ID system in the cloud for
and reliable ID for all processing Ids
transactions            ID system only used for
                        registration and verification
                        Information unhackable
Having a secure payment Payment system using ID
system that             Email, internet banking, wireless
eliminates fraud        transaction
Cryptocurrency that is  Absolutely secure, stable, and
secure and stable       based on verifiable IDs
Fast enough and secure  Rapid trading and verification
trading system for      Trading exchanges connected to
cryptocurrencies        Exchange
Mobile Payments         Integrity over wireless signals and
                        public net
                        Transactions cannot be defrauded
                        via screening or copying
Key Management System   Cloud key management service ID
                        system to outsource all key management
                        responsibilities
People forget passwords Pass eliminates the use of
and passwords are       passwords using ID center
a weak point in security

FIG. 5 illustrates a more particular example of a secret key transfer process 30 according to the concepts described herein. While an example using square matrices of a certain size is provided below, the concepts described herein can be extended to use with square matrices of any size. Further, although the example below is presented in certain cases as steps between “Alice” and “Bob,” the process is conducted by computing systems or devices.

At the outset, consider the key to be exchanged, K, as a sequence of m bytes, each including one of the ASCII codes from 0 to 255, as follows:K={k₁,k₂, . . . ,k_m}, 0≤k_i≤255.

For example, the key string “ABCD” can be presented as ASCII codes K={65, 66, 67, 68}. A sequence of real numbers X can then be defined as a transformation of the key numbers (i.e., k₁, k₂, k_m), which are integers, into real ones, as follows:X=Φ(K), Φ:N^m→R^m andX={x₁,x₂, . . . ,x_m}, x_i∈R.

The sequence of real numbers is put into set of second order square matrices, as follows:

$X=❘\begin{array}{cc}{x}_1& x_2\\ x_3& x_4\end{array}❘\dots ❘\begin{array}{cc}{x}_{m-3}& x_{m-2}\\ x_{m-1}& x_m\end{array}❘$

If the number of real key numbers is not multiple of four, the last matrix is not fully filled in. In this case, the rest of the matrix members can be generated and added as any random numbers without influencing the algorithm.

Now, assume that Alice wants to pass the secret key K to Bob. For simplicity, however, consider one square matrix X, as follows:

$X=❘\begin{array}{cc}{x}_1& x_2\\ x_3& x_4\end{array}❘$ The matrix X decomposes into two singular matrices Z₁ and Z₂:

$X=Z_1{Z}_2,$ $Z_1=❘\begin{array}{cc}{Z}_1& Z_2\\ Z_3& \frac{Z_2{Z}_3}{Z_1}\end{array}❘,\mathrm{and}$ $Z_2=❘\begin{array}{cc}{Z}_4& Z_5\\ Z_6& \frac{Z_4{Z}_5}{Z_6}\end{array}❘$

At step 302, the process includes forming the matrix X as a singular matrix using a number of the real key numbers of the secret key K based on the following relationship x₄=x₂x₃/x₁. In that case, the inverse of matrix X, or X⁻¹, does not exist (see properties of singular matrices and matrix determinants in APPENDIX). In that case, the matrix X represents a portion of the secret key K,{k₁, k₂, k₃}.

As part of a first pass transaction, at step 302, the process further includes generating a uniformly distributed random matrices Y₁, Y₂ and inverse matrices Y₁⁻¹, Y₂⁻¹, as follows:

$Y_1=❘\begin{array}{cc}{y}_1& y_2\\ y_3& y_4\end{array}❘,$ $Y_1^{-1}=\frac{❘\begin{array}{cc}{y}_4& -y_2\\ -y_3& y_1\end{array}❘}{y_1{y}_4-y_2{y}_3},y_i\in R,y_1{y}_4\ne y_2{y}_3,$ $Y_2=❘\begin{array}{cc}{y}_5& y_6\\ y_7& y_8\end{array}❘,\mathrm{and}$ $Y_2^{-1}=\frac{❘\begin{array}{cc}{y}_8& -y_6\\ -y_7& y_5\end{array}❘}{y_5{y}_8-y_6{y}_7},y_i\in R,y_5{y}_8\ne y_6{y}_7.$

At step 302, the process also includes generating uniformly distributed random centrosymmetric A₁, A₂, B₁, B₂, and inverse A₁⁻¹, A₂⁻¹, B₁⁻¹, B₂⁻¹ matrices as follows:

$A_1=❘\begin{array}{cc}{a}_1& a_2\\ a_2& a_1\end{array}❘,$ $A_2=❘\begin{array}{cc}{a}_3& a_4\\ a_4& a_3\end{array}❘,$ $A_1^{-1}=\frac{❘\begin{array}{cc}{a}_1& -a_2\\ -a_2& a_1\end{array}❘}{a_1^2-a_2^2},$ $A_2^{-1}=\frac{❘\begin{array}{cc}{a}_3& -a_4\\ -a_4& a_3\end{array}❘}{a_3^2-a_4^2},a_i\in R,a_1^2\ne a_2^2,a_3^2\ne a_4^2,$ $B_1=❘\begin{array}{cc}{b}_1& a_2\\ b_2& b_1\end{array}❘,$ $B_2=❘\begin{array}{cc}{b}_3& b_4\\ b_4& b_3\end{array}❘,$ $B_1^{-1}=\frac{❘\begin{array}{cc}{b}_1& -b_2\\ -b_2& b_1\end{array}❘}{b_1^2-b_2^2},$ $B_2^{-1}=❘\begin{array}{cc}{b}_3& -b_4\\ -b_4& b_3\end{array}❘,b_i\in R,b_1^2\ne b_2^2,b_3^2\ne b_4^2.$ Centrosymmetric square matrices A and B are always of the form AB=BA.

At step 304, the process includes Alice generating and sending matrices M₁ and M₂ to Bob, as follows:

$M_1=❘\begin{array}{cc}{m}_1^{\left(1\right)}& m_2^{\left(1\right)}\\ m_3^{\left(1\right)}& m_4^{\left(1\right)}\end{array}❘,$ $M_2=❘\begin{array}{cc}{m}_1^{\left(2\right)}& m_2^{\left(2\right)}\\ m_3^{\left(2\right)}& m_4^{\left(2\right)}\end{array}❘,$ $M_3=❘\begin{array}{cc}{m}_1^{\left(3\right)}& m_2^{\left(3\right)}\\ m_3^{\left(3\right)}& m_4^{\left(3\right)}\end{array}❘,\mathrm{and}$ $M_4=❘\begin{array}{cc}{m}_1^{\left(4\right)}& m_2^{\left(4\right)}\\ m_3^{\left(4\right)}& m_4^{\left(4\right)}\end{array}❘.$ which are generated according to the following calculations:M₁=Y₁A₁,  (3)M₂=B₁Y₁⁻¹Z₁,  (4)M₃=Y₂A₂, and  (5)

Thus, at step 304, Alice sends to Bob fourteen publicly visible values (m₁⁽¹⁾, m₂⁽¹⁾, m₃⁽¹⁾, m₄⁽¹⁾, m₁⁽²⁾, m₂⁽²⁾, m₃⁽²⁾, m₁⁽³⁾, m₂⁽³⁾, m₃⁽³⁾, m₄⁽³⁾, m₁⁽⁴⁾, m₂⁽⁴⁾, m₃⁽⁴⁾) of matrices M₁, M₂, M₃ and M₄ that are calculated from twenty-two independent unknown (for the third party) variables (a₁, a₂, a₃, a₄, b₁, b₂, b₃, b₄, y₁, y₂, y₃, y₄, y₅, y₆, y₇, y₈, z₁, z₂, z₃, z₄, z₅, z₆) known by Alice only, as follows:

$m_1^{\left(1\right)}=a_1{y}_1+a_2{y}_2,$ $m_2^{\left(1\right)}=a_2{y}_1+a_1{y}_2,$ $m_3^{\left(1\right)}=a_1{y}_3+a_2{y}_4,$ $m_4^{\left(1\right)}=a_2{y}_3+a_1{y}_4,$ $m_1^{\left(2\right)}=\frac{b_1\left(x_1{y}_4-x_3{y}_2\right)+b_2\left(x_3{y}_1-x_1{y}_3\right)}{y_1{y}_4-y_2{y}_3},$ $m_2^{\left(2\right)}=\frac{b_1\left(x_2{y}_4-y_2{x}_2{x}_3/x_1\right)+b_2\left(y_1{x}_2{x}_3/x_1-x_2{y}_3\right)}{y_1{y}_4-y_2{y}_3},$ $m_3^{\left(2\right)}=\frac{b_2\left(x_1{y}_4-x_3{y}_2\right)+b_1\left(x_3{y}_1-x_1{y}_3\right)}{y_1{y}_4-y_2{y}_3}$ $m_1^{\left(3\right)}=a_3{y}_5+a_4{y}_6,$ $m_2^{\left(3\right)}=a_4{y}_5+a_3{y}_6,$ $m_3^{\left(3\right)}=a_3{y}_7+a_4{y}_8,$ $m_4^{\left(3\right)}=a_4{y}_7+a_3{y}_8,$ $m_1^{\left(4\right)}=\frac{b_3\left(x_4{y}_8-x_6{y}_6\right)+b_4\left(x_6{y}_5-x_4{y}_7\right)}{y_5{y}_4-y_6{y}_3},$ $m_2^{\left(4\right)}=\frac{b_3\left(x_5{y}_8-y_6\frac{x_5{x}_6}{x_4}\right)+b_4\left(y_5\frac{x_5{x}_6}{x_4}-x_5{y}_7\right)}{y_5{y}_8-y_6{y}_7},\mathrm{and}$ $m_3^{\left(4\right)}=\frac{b_4\left(x_4{y}_8-x_6{y}_6\right)+b_3\left(x_6{y}_5-x_4{y}_7\right)}{y_5{y}_8-y_6{y}_7}.$

The variable m₄⁽²⁾ and m₄⁽⁴⁾ of the singular matrices M₂ and M₂ are used as m₄⁽²⁾=m₂⁽²⁾m₃⁽²⁾/m₁⁽²⁾ and m₄⁽²⁾=m₂⁽²⁾m₃⁽²⁾/m₁⁽²⁾.

As a second pass transaction, at step 306, the process includes Bob receiving the M₁ and M₂ matrices from Alice. At step 306, the process includes generating uniformly distributed random centrosymmetric matrices C₁, C₂ and inverse C₁⁻¹, C₂⁻¹ matrices, as follows:

$C_1=❘\begin{array}{cc}{c}_1& c_2\\ c_2& c_1\end{array}❘,$ $C_2=❘\begin{array}{cc}{c}_3& c_4\\ c_4& c_3\end{array}❘,$ $C_1^{-1}=\frac{❘\begin{array}{cc}{c}_1& -c_2\\ -c_2& c_1\end{array}❘}{c_1^2-c_2^2},c_i\in R,c_1^2\ne c_2^2,\mathrm{and}$ $C_2^{-1}=\frac{❘\begin{array}{cc}{c}_3& -c_4\\ -c_4& c_3\end{array}❘}{c_3^2-c_4^2},c_i\in R,c_3^2\ne c_4^2.$

The process at step 306 also includes generating uniformly distributed random matrices D and H, as follows:

$D=❘\begin{array}{cc}{d}_1& d_2\\ d_3& d_4\end{array}❘,\mathrm{and}$ $H=❘\begin{array}{cc}{h}_1& h_2\\ h_3& h_4\end{array}❘,d_i,h_i\in R,d_1{d}_4\ne d_2{d}_3,h_1{h}_4\ne h_2{h}_3.$

The process at step 306 also includes generating corresponding inverse matrices D⁻¹ and H⁻¹, as follows:

$D^{-1}=\frac{❘\begin{array}{cc}{d}_1& d_2\\ d_3& d_4\end{array}❘}{d_1{d}_4-d_2{d}_3},\mathrm{and}$ $H^{-1}=\frac{❘\begin{array}{cc}{h}_1& h_2\\ h_3& h_4\end{array}❘}{h_1{h}_4-h_2{h}_3}.$

The process at step 306 also includes generating the matrices M₅, M₆, M₇ and M₈, as follows:

$M_5=❘\begin{array}{cc}{m}_1^{\left(5\right)}& m_2^{\left(5\right)}\\ m_3^{\left(5\right)}& m_4^{\left(5\right)}\end{array}❘,$ $M_6=❘\begin{array}{cc}{m}_1^{\left(6\right)}& m_2^{\left(6\right)}\\ m_3^{\left(6\right)}& m_4^{\left(6\right)}\end{array}❘,$ $M_6=❘\begin{array}{cc}{m}_1^{\left(7\right)}& m_2^{\left(7\right)}\\ m_3^{\left(7\right)}& m_4^{\left(7\right)}\end{array}❘,\mathrm{and}$ $M_8=❘\begin{array}{cc}{m}_1^{\left(8\right)}& m_2^{\left(8\right)}\\ m_3^{\left(8\right)}& m_4^{\left(8\right)}\end{array}❘$ as a result of the following calculations:M₅=DM₁C₁⁻¹=D₁Y₁A₁C₁⁻¹,  (7)M₆=C₁M₂E=C₁B₁Y₁⁻¹Z₁E,  (8)M₇=E⁻¹M₃C₂⁻¹=E⁻¹YA₂C₂⁻¹, and  (9)M₈=C₂M₄H=C₂B₂Y₂⁻¹Z₂H.  (10)

At step 308, the process includes Bob sending to Alice fourteen publicly visible values (m₁⁽⁵⁾, m₂⁽⁵⁾, m₃⁽⁵⁾, m₄⁽⁵⁾, m₁⁽⁶⁾, m₂⁽⁶⁾, m₃⁽⁶⁾, m₁⁽⁷⁾, m₂⁽⁷⁾, m₃⁽⁷⁾, m₄⁽⁷⁾, m₁⁽⁸⁾m₂⁽⁸⁾, m₃⁽⁸⁾) of matrices M₃ and M₄ that are calculated from sixteen independent unknown (for the third party) variables (c₁, c₂, c₃, c₄, d₁, d₂, d₃, d₄, e₁, e₂, e₃, e₄, h₁, h₂, h₃, h₄) which are known by Bob only, as follows:

$m_1^{\left(5\right)}=\frac{c_1\left(d_1{m}_1^{\left(1\right)}+d_2{m}_3^{\left(1\right)}\right)-c\left(d_1{m}_2^{\left(1\right)}+d_2{m}_4^{\left(1\right)}\right)}{c_1^2-c_2^2},$ $m_2^{\left(5\right)}=\frac{c_1\left(d_1{m}_2^{\left(1\right)}+d_2{m}_4^{\left(1\right)}\right)-c_2\left(d_1{m}_1^{\left(1\right)}+d_2{m}_3^{\left(1\right)}\right)}{c_1^2-c_2^2},$ $m_3^{\left(5\right)}=\frac{c_1\left(d_3{m}_1^{\left(1\right)}+d_4{m}_3^{\left(1\right)}\right)-c_2\left(d_3{m}_2^{\left(1\right)}+d_4{m}_4^{\left(1\right)}\right)}{c_1^2-c_2^2},$ $m_4^{\left(5\right)}=\frac{c_1\left(d_3{m}_2^{\left(1\right)}+d_4{m}_4^{\left(1\right)}\right)-c_2\left(d_3{m}_1^{\left(1\right)}+d_4{m}_3^{\left(1\right)}\right)}{c_1^2-c_2^2},$ $m_1^{\left(6\right)}=\left(c_1{m}_1^{\left(2\right)}+c_2{m}_3^{\left(2\right)}\right)e_1+\left(c_1{m}_2^{\left(2\right)}+c_2{m}_4^{\left(2\right)}\right)e_3,$ $m_2^{\left(6\right)}=\left(c_1{m}_1^{\left(2\right)}+c_2{m}_3^{\left(2\right)}\right)e_2+\left(c_2{m}_2^{\left(2\right)}+c_2{m}_4^{\left(2\right)}\right)e_4,$ $m_3^{\left(6\right)}=\left(c_2{m}_1^{\left(2\right)}+c_2{m}_3^{\left(2\right)}\right)e_1+\left(c_1{m}_2^{\left(2\right)}+c_1{m}_4^{\left(2\right)}\right)e_3,$ $m_4^{\left(6\right)}=m_2^{\left(6\right)}{m}_3^{\left(6\right)}/m_1^{\left(6\right)},$ $m_1^{\left(7\right)}=\frac{c_3\left(e_4{m}_1^{\left(3\right)}-e_2{m}_3^{\left(3\right)}\right)-c_4\left(e_4{m}_2^{\left(3\right)}-e_2{m}_4^{\left(3\right)}\right)}{\left(c_3^2-c_4^3\right)\left(e_1{e}_4-e_2{e}_3\right)},$ $m_2^{\left(7\right)}=\frac{c_3\left(e_4{m}_2^{\left(3\right)}-e_2{m}_4^{\left(3\right)}\right)-c_4\left(e_4{m}_1^{\left(3\right)}-e_2{m}_3^{\left(3\right)}\right)}{\left(c_3^2-c_4^3\right)\left(e_1{e}_4-e_2{e}_3\right)},$ $m_3^{\left(7\right)}=\frac{c_3\left(e_1{m}_3^{\left(3\right)}-e_3{m}_1^{\left(3\right)}\right)-c_4\left(e_1{m}_4^{\left(3\right)}-e_3{m}_2^{\left(3\right)}\right)}{\left(c_3^2-c_4^2\right)\left(e_1{e}_4-e_2{e}_3\right)},$ $m_4^{\left(7\right)}=\frac{c_3\left(e_1{m}_4^{\left(3\right)}-e_3{m}_2^{\left(3\right)}\right)-c_4\left(e_1{m}_3^{\left(3\right)}-e_3{m}_1^{\left(3\right)}\right)}{\left(c_3^2-c_4^2\right)\left(e_1{e}_4-e_2{e}_3\right)},$ $m_1^{\left(8\right)}=\left(c_3{m}_1^{\left(4\right)}+c_4{m}_3^{\left(4\right)}\right)h_1+\left(c_3{m}_2^{\left(4\right)}+c_4{m}_4^{\left(4\right)}\right)h_3,$ $m_2^{\left(8\right)}=\left(c_3{m}_1^{\left(4\right)}+c_4{m}_3^{\left(4\right)}\right)h_2+\left(c_3{m}_2^{\left(4\right)}+c_4{m}_4^{\left(4\right)}\right)h_4,$ $m_3^{\left(8\right)}=\left(c_3{m}_1^{\left(4\right)}+c_3{m}_3^{\left(4\right)}\right)h_1+\left(c_4{m}_2^{\left(4\right)}+c_3{m}_4^{\left(4\right)}\right)h_3,\mathrm{and}$

As a third pass transaction, at step 310, the process includes Alice receiving from Bob the matrices M₃, M₆, M₇, and M₈ as follows:M₅=DY₁A₁C₁⁻¹,M₆=C₁B₁Y₁⁻¹Z₁E. M₇=E⁻¹Y₂A₂C₂⁻¹, andM₈=CBY⁻¹XH.

Note that centrosymmetric matrices satisfy the following conditions:AC⁻¹=C⁻¹A andCB=BC, meaning that the matrices M₅, M₆, M₇, and M₈ can be transformed into:M₅=DY₁A₁C₁⁻¹=DY₁C₁⁻¹A₁,M₆=C₁B₁Y₁⁻¹Z₁E=B₁C₁Y₁⁻¹Z₁E, M₇=E⁻¹Y₂A₂C₂⁻¹=E⁻¹Y₂C₂⁻¹A₂, andM₈=C₂B₂Y₂⁻¹Z₂H=B₂C₂Y₂⁻¹Z₂H.

Thus, at step 312, the process includes multiplying the matrices M₅, M₆, M₇ and M₈ with the known inverse matrices A₁⁻¹, A₂⁻¹, B₁⁻¹ and B₂⁻¹, respectively, as follows:M₅A₁⁻¹=DY₁C₁⁻¹A₁A₁⁻¹=DY₁C₁⁻¹,B₁⁻¹M₆=B₁⁻¹B₁C₁Y₁⁻¹Z₁E=C₁Y₁⁻¹Z₁E, M₇A₂⁻¹=E⁻¹Y₂C₂⁻¹A₂A₂⁻¹=E⁻¹Y₂C₂⁻¹, andB₂⁻¹M₈=B₂⁻¹B₂C₂Y₂⁻¹Z₂H=C₂Y₂⁻¹Z₂H.

Further, at step 314, the process includes multiplying the results of those together to arrive at the matrix M₅, as follows:

$M_9=M_5{A}_1^{-1}{B}_1^{-1}{M}_6{M}_7{A}_2^{-1}{B}_2^{-1}{M}_8,$ $M_9={\mathrm{DY}}_1{C}_1^{-1}{C}_1{Y}_1^{-1}{Z}_1{\mathrm{EE}}^{-1}{Y}_2{C}_2^{-1}{C}_2{Y}_2^{-1}{Z}_{2}H={\mathrm{DZ}}_1{Z}_{2}H,$ $\mathrm{such}\mathrm{that}$ $\begin{array}{cc}{M}_9=\mathrm{DXH},& \left(11\right)\end{array}$ $\mathrm{and}$ $M_9=❘\begin{array}{cc}{m}_1^{\left(9\right)}& m_2^{\left(9\right)}\\ m_3^{\left(9\right)}& m_4^{\left(9\right)}\end{array}❘.$

At step 316, the process includes Alice sending the following three publicly visible values to Bob (m₁⁽⁹⁾, m₂⁽⁹⁾, m₃⁽⁹⁾, as follows:m₁⁽⁹⁾=(d₁x₁+d₂x₃)h₁+(d₁x₂+d₂x₄)h₃,m₂⁽⁹⁾=(d₁x₁+d₂x₃)h₂+(d₁x₂+d₂x₄)h₄,m₃⁽⁹⁾=(d₃x₁+d₄x₃)h₁+(d₃x₂+d₄x₄)h₃, andm₄⁽⁹⁾=m₃⁽⁹⁾m₂⁽⁹⁾/m₁⁽⁹⁾.

Thus, as part of the final key restoration at step 316, Bob receives the matrix M9 from Alice, as follows:M₉=DXH.

At step 318, the process includes Bob restoring the key X from Alice by using inverse matrices D⁻¹ and H⁻¹, which are known to Bob, and the matrix M₅, as follows:D⁻¹M₉H⁻¹=D⁻¹DXHH⁻¹=X.

As shown in Table 6 below, the entire scheme of the key exchange process can be performed using an exchange of matrices with a corresponding number of different unknown independent variables (underlined in Table 6) and visible (by the third party) values (bolded in Table 6). This scheme demonstrates that the number of unknown independent variables always exceeds the number of visible independent values in any combination of subsets of matrices.

This means that the system of nonlinear equations is an indeterminate system. There are no algorithms for the third party to obtain unknown independent variables including the secret key X using the visible independent values.

TABLE 6
				Independent
			Variables	Variables		Values
1	Alice	Y1A1	A1[2], Y1[4]	22	M1[4]	4	14
		B1Y1−1Z1	B1[2], Z1[3]		M2[4]	3
		Y2A2	A2[2], Y2[4]		M3[4]	4
		B2Y2−1Z2	B2[2], Z2[3]		M4[4]	3
2	Bob	DY1A1C1−1	D [4], C1[2]	16	M5[4]	4	14
		C1B1Y1−1 Z1E	E [4]		M6[4]	3
		B−1Y2A2C2−1			M7[4]	4
		C2B2Y2−1 Z2H	C2[2], H [4]		M8[4]	3
3	Alice	DXH			M9[3]	3	3
Total			38		31

The direct restoration of the matrix X (using formula transformations of Eqs.3-11 is also impossible. Note that the matrix X is singular. It leads to several features, which are used to perform the key exchange algorithm resistant against the third party decryption (see APPENDIX):

The matrices M₂, M₄, M₆, M₈, and M₉ M₂=B₁Y₁⁻¹Z₁,M₄=B₂Y₂⁻¹Z₂,M₆=C₁B₁Y₁⁻¹Z₁E, M₈=C₂B₂Y₂⁻¹Z₂H, andM₉=DZ₁Z₂H are also singular (due to the matrices Z₁ and Z₂ being singular).

Thus, the equation M₅L₁M₆M₇L₂M₈=M₉ (from the Eqs. 7-10) can not be resolved in regards to centrosymmetric matrices L₁=A₁⁻¹B₁⁻¹ and L₂=A₂⁻¹B₂⁻¹ by the third party as far as the matrix M₉ is singular so, the direct calculation X=M₁L₁M₂M₃L₂M₄ is not possible.

The concepts described herein can be used for other cryptographic operations, such as key exchanging using authentication. FIG. 6 illustrates an example secret material or key exchanging process using authentication according to the concepts described herein.

As shown in FIG. 6, Alice wants to pass the secret key K to Bob. They use Ed as an independent party for authentication. In the transaction, the square singular matrix

$X=❘\begin{array}{cc}{x}_1& x_2\\ x_3& x_4\end{array}❘$ is used to represent the key K={k₁, k₂, k₃}, where x₄=x₂x₃/x₁.

It is assumed that Alice and Bob both have passed the authentication procedure and both have got corresponding session numbers N₁^A, N₂^A and N₁^B, N₂^B from Ed according to the concepts described above.

Alice and Bob form centrosymmetric matrices N^A and N^B correspondently, as follows:

$N_A=❘\begin{array}{cc}{N}_1^A& N_2^A\\ N_2^A& N_1^A\end{array}❘\mathrm{and}{N}_{\mathrm{AB}}=❘\begin{array}{cc}{N}_1^B& N_2^B\\ N_2^B& N_1^B\end{array}❘.$

As part of a first pass transaction, at step 402, the process 40 includes Alice generating uniformly distributed random matrices Y₁, Y₂ and inverse matrices Y₁⁻¹, Y₂⁻¹, as follows:

$Y_1=❘\begin{array}{cc}{y}_1& y_2\\ y_3& y_4\end{array}❘,$ $Y_1^{-1}=\frac{❘\begin{array}{cc}{y}_4& -y_2\\ -y_3& y_1\end{array}❘}{y_1{y}_4-y_2{y}_3},y_i\in R,y_1{y}_4\ne y_2{y}_3,$ $Y_2=❘\begin{array}{cc}{y}_5& y_6\\ y_7& y_8\end{array}❘,\mathrm{and}$ $Y_2^{-1}=\frac{❘\begin{array}{cc}{y}_8& -y_6\\ -y_7& y_5\end{array}❘}{y_5{y}_6-y_6{y}_7},y_i\in R,y_5{y}_8\ne y_6{y}_7.$

Alice also generates uniformly distributed random centrosymmetric matrices A and B, as follows:

$A_1=❘\begin{array}{cc}{a}_1& a_2\\ a_2& a_1\end{array}❘,$ $A_2=❘\begin{array}{cc}{a}_3& a_4\\ a_4& a_3\end{array}❘,$ $A_1^{-1}=\frac{❘\begin{array}{cc}{a}_1& -a_2\\ -a_2& a_1\end{array}❘}{a_1^2-a_2^2},$ $A_2^{-1}=\frac{❘\begin{array}{cc}{a}_3& a_4\\ a_4& a_3\end{array}❘}{a_3^2-a_4^2},a_i\in R,a_1^2\ne a_2^2,a_3^2\ne a_4^2,$ $B_1=❘\begin{array}{cc}{b}_1& b_2\\ b_2& b_1\end{array}❘,$ $B_2=❘\begin{array}{cc}{b}_3& b_4\\ b_4& b_3\end{array}❘,$ $B_2^{-1}=❘\begin{array}{cc}{b}_3& -b_4\\ -b_4& b_3\end{array}❘,b_i\in R,b_1^2\ne b_2^2,b_3^2\ne b_4^2,$

Note that any centrosymmetric square matrices A and B always have the following feature: AB=BA. At step 404, the process includes Alice sending to Bob results as matrices M₁ and M₂, as follows:

$M_1=❘\begin{array}{cc}{m}_1^{\left(1\right)}& m_2^{\left(1\right)}\\ m_3^{\left(1\right)}& m_4^{\left(1\right)}\end{array}❘,$ $M_2=❘\begin{array}{cc}{m}_1^{\left(2\right)}& m_2^{\left(2\right)}\\ m_3^{\left(2\right)}& m_4^{\left(2\right)}\end{array}❘,$ $M_3=❘\begin{array}{cc}{m}_1^{\left(3\right)}& m_2^{\left(3\right)}\\ m_3^{\left(3\right)}& m_4^{\left(3\right)}\end{array}❘,\mathrm{and}$ $M_4=❘\begin{array}{cc}{m}_1^{\left(4\right)}& m_2^{\left(4\right)}\\ m_3^{\left(4\right)}& m_4^{\left(4\right)}\end{array}❘.$ of the following calculations:M₁=Y₁A₁,  (1B)M₂=B₁Y₁⁻¹Z₁,  (2B)M₃=Y₂A₂, and  (3B)M₄=B₂Y₂⁻¹Z₂.  (4B)

As part of a second pass transaction, at step 406, Bob receives M₁ and M₂ from Alice. Bob generates uniformly distributed random centrosymmetric matrices C₁, C₂ and inverse C₁⁻¹, C₂⁻¹ matrices, as follows:

$C_1=❘\begin{array}{cc}{c}_1& c_2\\ c_2& c_1\end{array}❘,$ $C_2=❘\begin{array}{cc}{c}_3& c_4\\ c_4& c_3\end{array}❘,$ $C_1^{-1}=\frac{❘\begin{array}{cc}{c}_1& -c_2\\ -c_2& c_1\end{array}❘}{c_1^2-c_2^2},c_i\in R,c_1^2\ne c_2^2,\mathrm{and}$ $C_2^{-1}=\frac{❘\begin{array}{cc}{c}_3& -c_4\\ -c_4& c_3\end{array}❘}{c_3^2-c_4^2},c_i\in R,c_3^2\ne c_4^2.$ and uniformly distributed random matrices D and H, as follows:

$D=❘\begin{array}{cc}{d}_1& d_2\\ d_3& d_4\end{array}❘,\mathrm{and}$ $H=❘\begin{array}{cc}{h}_1& h_2\\ h_3& h_4\end{array}❘,d_i,h_i\in R,d_1{d}_4\ne d_2{d}_3,h_1{h}_4\ne h_2{h}_3,$ and correspondent inverse matrices D⁻¹ and H⁻¹, as follows:

$D^{-1}=\frac{❘\begin{array}{cc}{d}_1& d_2\\ d_3& d_4\end{array}❘}{d_1{d}_4-d_2{d}_3},\mathrm{and}$ $H^{-1}=\frac{❘\begin{array}{cc}{h}_1& h_2\\ h_3& h_4\end{array}❘}{h_1{h}_4-h_2{h}_3}.$

At step 406, Bob also obtains the matrices M₅, M₆, M₇, and M₈, defined as follows:

$M_5=❘\begin{array}{cc}{m}_1^{\left(5\right)}& m_2^{\left(5\right)}\\ m_3^{\left(5\right)}& m_4^{\left(5\right)}\end{array}❘,$ $M_6=❘\begin{array}{cc}{m}_1^{\left(6\right)}& m_2^{\left(6\right)}\\ m_3^{\left(6\right)}& m_4^{\left(6\right)}\end{array}❘,$ $M_7=❘\begin{array}{cc}{m}_1^{\left(7\right)}& m_2^{\left(7\right)}\\ m_3^{\left(7\right)}& m_4^{\left(7\right)}\end{array}❘,\mathrm{and}$ $M_8=❘\begin{array}{cc}{m}_1^{\left(8\right)}& m_2^{\left(8\right)}\\ m_3^{\left(8\right)}& m_4^{\left(8\right)}\end{array}❘.$ as a result of the following calculations:M₅=DM₁C₁⁻¹=D₁Y₁A₁C₁⁻¹,  (5B)M₆=C₁M₂E=C₁B₁Y₁⁻¹Z₁E,  (6B)M₇=E⁻¹M₃C₂⁻¹=E⁻¹YA₂C₂⁻¹, and  (7B)M₈=C₂M₄H=C₂B₂Y₂⁻¹Z₂H.  (8B)

As part of a third pass transaction, at step 408, the process includes Alice generating a uniformly distributed random matrix G, as follows:

$G=❘\begin{array}{cc}{g}_1& g_2\\ g_3& g_4\end{array}❘,g_i\in R.$

Alice receives from Bob the matrices M₅, M₆, M₇ and M₈, as follows:M₅=DY₁A₁C₁⁻¹=DY₁C₁⁻¹A₁,M₆=C₁B₁Y₁⁻¹Z₁E=B₁C₁Y₁⁻¹Z₁E, M₇=E⁻¹Y₂A₂C₂⁻¹=E⁻¹Y₂C₂⁻¹A₂, andM₈=C₂B₂Y₂⁻¹Z₂H=B₂C₂Y₂⁻¹Z₂H.

At step 408, the process also includes Alice multiplying both the matrices M₅, M₆, M₇ and M₈ with the inverse matrices which are known to her, A₁⁻¹, A₂⁻¹, B₁⁻¹ and B₂⁻¹, respectively, as follows:

$B_1^{-1}{M}_6=B_1^{-1}{B}_1{C}_1{Y}_1^{-1}{Z}_{1}E=C_1{Y}_1^{-1}{Z}_{1}E,$ $B_1^{-1}{M}_6=B_1^{-1}{B}_1{C}_1{Y}_1^{-1}{Z}_{1}E=C_1{Y}_1^{-1}{Z}_{1}E,$ $M_7{A}_2^{-1}=E^{-1}{Y}_2{C}_2^{-1}{A}_2{A}_2^{-1}=E^{-1}{Y}_2{C}_2^{-1},\mathrm{and}$ $B_2^{-1}{M}_8=B_2^{-1}{B}_2{C}_2{Y}_2^{-1}{Z}_{2}H=C_2{Y}_2^{-1}{Z}_{2}H,$ $M_5={\mathrm{GM}}_5{A}_1^{-1}{B}_1^{-1}{M}_6{M}_7{A}_2^{-1}{B}_2^{-1}{M}_8={\mathrm{GDY}}_1{C}_1^{-1}{C}_1{Y}_1^{-1}{Z}_1{\mathrm{EE}}^{-1}{Y}_2{C}_2^{-1}{C}_2{Y}_2^{-1}{Z}_{2}H,\mathrm{such}$ $M_9=\mathrm{GDXH}\left(9B\right),\mathrm{where}$ $M_9=❘\begin{array}{cc}{m}_1^{\left(9\right)}& m_2^{\left(9\right)}\\ m_3^{\left(9\right)}& m_4^{\left(9\right)}\end{array}❘.$

At step 410, the process includes Alice sending three publicly visible values to Bob, including (m₁⁽⁹⁾, m₂⁽⁹⁾, m₃⁽⁹⁾). The matrix M is singular and m₄⁽⁹⁾=m₃⁽⁹⁾m₂⁽⁹⁾/m₁⁽⁹⁾. At step 412, Alice also sends four publicly visible values to Ed (m₁⁽⁶⁾,m₂⁽⁶⁾,m₃⁽⁶⁾,m₄⁽⁶⁾) of the matrix M₁₀, defined as:

$M_{10}=❘\begin{array}{cc}{m}_1^{\left(10\right)}& m_2^{\left(10\right)}\\ m_3^{\left(10\right)}& m_4^{\left(10\right)}\end{array}❘,$ as a result of the following calculations:M₁₀−N{circumflex over ( )}G.  (9B)

For authentication, Ed receives the matrix M6 from Alice. At step 414, Ed sends to Bob the matrix M₁₁ using the inverse matrix (N^A)⁻¹ and the matrix N^B′ as follows:M₁₁=N^B(N^A)⁻¹N^AG=N^BG, M₁₁=N^BG.  (10B).

As part of the final key restoration, at step 416, the process includes Bob receiving the matrix M₁₁ from Ed and obtaining the matrix G using the inverse matrix (N^B)⁻¹, as follows:G=(N^B)⁻¹M₁₁=(N^B)⁻¹N^BG.

Bob also receives the matrix M₉ from Alice at step 410. Using inverse matrices G⁻¹, D⁻¹, and H⁻¹, which are known to Bob, he can restore the key X from the received matrix M₅ as follows:D⁻¹G⁻¹M₉H⁻¹=D⁻¹C⁻¹GDXHH⁻¹=X.

The embodiments described herein can be implemented by either a method or process or as a system or device. The method can be performed using any suitable computing device, and the system can be embodied as any suitable computing device. The computing device can include at least one processing system, for example, having one or more processors and memories electrically and communicatively coupled together using a local interface. The local interface can be embodied as a data bus with an accompanying address/control bus or other addressing, control, and/or command lines.

In various embodiments, the memory can store data and software or executable code components executable by the processor. For example, the memory can store executable-code components associated with cryptographic operations for execution by the processor. The software or executable-code components can be developed using or embodied in various programming languages, such as, for example, C, C++, C#, Objective C, JAVA®, JAVASCRIPT®, Perl, PHP, VISUAL BASIC®, PYTHON®, RUBY, FLASH®, or other programming languages.

The embodiments can rely, in part, on executable instructions or instructions for execution by the computing device. The terms “executable” or “for execution” refer to software forms that can ultimately be run or executed by a processor, whether in source, object, machine, or other form. Examples of executable programs include, for example, a compiled program that can be translated into a machine code format and loaded into a random access portion of memory and executed by a processor, source code that can be expressed in an object code format and loaded into a random access portion of the memory and executed by the processor, or source code that can be interpreted by another executable program to generate instructions in a random access portion of the memory and executed by the processor, etc.

An executable program can be stored in any portion or component of the memory including, for example, a random access memory (RAM), read-only memory (ROM), magnetic or other hard disk drive, solid-state, semiconductor, or similar drive, universal serial bus (USB) flash drive, memory card, optical disc (e.g., compact disc (CD)) or digital versatile disc (DVD)), floppy disk, magnetic tape, or other memory component.

Although the process diagram shown in FIGS. 2 and 5 illustrate a certain order, it is understood that the order can differ from that which is depicted. For example, an order of execution of two or more blocks can be scrambled relative to the order shown. Also, two or more blocks shown in succession can be executed concurrently or with partial concurrence.

Further, in some embodiments, one or more of the blocks can be skipped or omitted. In addition, any number of counters, state variables, warning semaphores, or messages might be added to the logical flow described herein, for purposes of enhanced utility, accounting, performance measurement, or providing troubleshooting aids, etc. It is understood that all such variations are within the scope of the present disclosure.

Also, any algorithm, method, process, or logic described herein that are embodied, at least in part, by software or executable-code components, can be embodied or stored in any tangible or non-transitory computer-readable medium or device for execution by an instruction execution system such as a general purpose processor. In this sense, the logic can be embodied as, for example, software or executable-code components that can be fetched from the computer-readable medium and executed by the instruction execution system. Thus, the instruction execution system can be directed by execution of the instructions to perform certain processes such as those illustrated in FIG. 2. In the context of the present disclosure, a “computer-readable medium” can be any tangible medium that can contain, store, or maintain any logic, application, software, or executable-code component described herein for use by or in connection with an instruction execution system.

The computer-readable medium can include any physical media such as, for example, magnetic, optical, or semiconductor media. More specific examples of suitable computer-readable media include, but are not limited to, magnetic tapes, magnetic floppy diskettes, magnetic hard drives, memory cards, solid-state drives, USB flash drives, or optical discs. Also, the computer-readable medium can include a RAM including, for example, an SRAM, DRAM, or MRAM. In addition, the computer-readable medium can include a ROM, a PROM, an EPROM, an EEPROM, or other similar memory device.

Disjunctive language, such as the phrase “at least one of X, Y, or Z,” unless specifically stated otherwise, is to be understood with the context as used in general to present that an item, term, etc., can be either X, Y, or Z, or any combination thereof (e.g., X, Y, and/or Z). Thus, such disjunctive language is not generally intended to, and should not, imply that certain embodiments require at least one of X, at least one of Y, or at least one of Z to be each present.

It should be emphasized that the above-described embodiments of the present disclosure are merely possible examples of implementations set forth for a clear understanding of the principles of the disclosure. Many variations and modifications can be made to the above-described embodiment(s) without departing substantially from the spirit and principles of the disclosure. All such modifications and variations are intended to be included herein within the scope of this disclosure and protected by the following claims.

Claims

1. A method of cryptography, comprising: encrypting a symmetric key by applying at least one associative cryptography key operation to the symmetric key to generate an encrypted symmetric key, wherein the at least one associative cryptography key operation is based on applying a polynomial function composed by a combination of independent random variables with uniform probability distribution and white noise randomization;transmitting, with a first computing device, the encrypted symmetric key from the first computing device to a second computing device;decrypting the encrypted symmetric key by applying at least one inverse associative cryptography key operation to the encrypted symmetric key to produce the symmetric key.

2. A computing device comprising: a processor; anda memory for storing an application to be executed by the processor, the application, which when executed, causes the processor to: encrypt a symmetric key by applying at least one associative cryptography key operation to the symmetric key to generate an encrypted symmetric key, wherein the at least one associative cryptography key operation is based on applying a polynomial function composed by a combination of independent random variables with uniform probability distribution and white noise randomization; andtransmit the encrypted symmetric key to a remote computing device, wherein the remote computing device receives the encrypted symmetric key transmitted and decrypts the encrypted symmetric key by applying at least one inverse associative cryptography key operation to the encrypted symmetric key to produce the symmetric key.

3. A system, comprising: a first computing device comprising: a first processor; anda first memory for storing a first application to be executed by the first processor, the application, which when executed, causes the processor to: encrypt a symmetric key by applying at least one associative cryptography key operation to the symmetric key to generate an encrypted symmetric key, wherein the at least one associative cryptography key operation is based on applying a polynomial function composed by a combination of independent random variables with uniform probability distribution and white noise randomization; andtransmit the encrypted symmetric key to a second computing device; andthe second computing device comprising: a second processor; anda second memory for storing a second application to be executed by the second processor, the application, which when executed, causes the processor to: receive the encrypted symmetric key transmitted from the first computing device; anddecrypt the encrypted symmetric key by applying at least one inverse associative cryptography key operation to the encrypted symmetric key to produce the symmetric key.