Random generator of orthogonal matrices in finite fields
Patent Information
- Application Number
- PCT/IB2024/053068
- Authority / Receiving Office
- WO · WO
- Patent Type
- Applications
- Current Assignee / Owner
- Priority Date
- 2023-03-29
- Filing Date
- 2024-03-29
- Publication Date
- 2024-11-21
AI Technical Summary
The Janashia-Lagvilava method, used for spectral factorization and generating orthogonal matrices, is not applicable to finite fields due to the requirement of a positive element, limiting its ability to construct unitary matrix polynomials and orthogonal matrices in these fields.
A superfast method is developed to construct orthogonal matrices in finite fields by modifying the Janashia-Lagvilava method, eliminating the need to invert matrices and allowing for the generation of large orthogonal matrices with specific structures, such as circulant matrices, and paraunitary filter banks, using random selection of coefficients.
This method enables the efficient construction of orthogonal matrices and paraunitary filter banks over finite fields, with low probability of failure, and can handle large matrix sizes, making it suitable for applications in cryptography and signal processing.
Smart Images

Figure IB2024053068_21112024_PF_FP_ABST
Abstract
Description
Atty. Dkt. No.: 046434-0844 RANDOM GENERATOR OF ORTHOGONAL MATRICES IN FINITE FIELDS CROSS-REFERENCE TO RELATED APPLICATIONS
[0001] This application claims the benefit of and priority to U.S. Provisional Patent App. No. 63 / 455,534, filed March 29, 2023, the contents of which are incorporated herein by reference. TECHNICAL FIELD
[0002] The present disclosure relates generally to a random generator of orthogonal matrices in finite fields. BACKGROUND
[0003] Spectral factorization is a powerful mathematical tool with various applications in control engineering and communications. The Janashia-Lagvilava method has been developed over the years to solve the challenging spectral factorization problem in the matrix case. This method has been successfully algorithmized and offers several advantages over existing methods, as demonstrated in previous works. One noteworthy advantage of this method, which can be achieved through a suitable modification, is that it unexpectedly has the ability to generate a multitude of orthogonal matrices over finite fields in mere milliseconds, potentially finding applications in coding theory.
[0004] The Janashia-Lagvilava method has been discovered to be closely related with wavelet theory. Furthermore, the method has been recently generalized for any field satisfying the minimal requirements. However, these requirements necessitate the existence of a positive element in the field, precluding finite fields. In fact, the field of rational polynomials in several complex variables was the main focus of related paper Ephremidze & Epitkovsky, “On the generalization of the Janashia–Lagvilava method for arbitrary fields,” Georgian Mathematical Journal 29(3), pp.353-362 (2022) (hereinafter “Generalization”), and by taking this viewpoint, it was possible to generalize the Janashia-Lagvilava method to matrix functions on the multidimensional torus. The main result of Generalization, Theorem 4.1, does not hold for finite fields and, accordingly, the procedure described therein cannot guarantee the construction of the required unitary matrix polynomial for finite fields. Nevertheless, as it was further 1 4876-5304-4652.3Atty. Dkt. No.: 046434-0844 realized and confirmed by numerical simulations, the isolated cases of failure do not exclude the existence of statistically robust method of constructing above mentioned unitary matrix polynomials for finite fields, while these matrix polynomials can be converted into orthogonal matrices.
[0005] Described herein is a superfast method for constructing orthogonal matrices ^^ ∈ ^^^ ^^, ^^^ in finite fields ^^ ^^^ ^^^. It can be used to construct ^^ ൈ ^^ orthogonal matrices in ^^^with very high values of ^^ and ^^, and also orthogonal matrices with a certain circulant structure. Equally well one can construct paraunitary filter banks or wavelet matrices over finite fields. The construction mechanism is highly efficient, allowing for the complete screening and selection of an orthogonal matrix that meets specific constraints. For instance, one can generate a complete list of orthogonal matrices with given ^^ and ^^ ൌ ^^^provided that the order of ^^^ ^^, ^^^ is not too large, based on the limits of the computer system. Although the method is based on randomness, isolated cases of failure can be identified well in advance of the basic procedure’s start. The proposed procedures are based on the Janashia-Lagvilava method which was developed for an entirely different task, therefore, it may seem somewhat unexpected. SUMMARY
[0006] One embodiment relates to constructing an orthogonal matrix from finite fields. In particular, a random orthongonal matrix is constructed. The orthogonal matrix maybe utilized to encode information. A discrete wavelet matrix or paraunitary matrix may be constructed from the orthogonal matrix and utilized for signal processing.
[0007] It should be appreciated that all combinations of the foregoing concepts and additional concepts discussed in greater detail below (provided such concepts are not mutually inconsistent) are contemplated as being part of the subject matter disclosed herein. In particular, all combinations of claimed subject matter appearing at the end of this disclosure are contemplated as being part of the subject matter disclosed herein. BRIEF DESCRIPTION OF THE FIGURES
[0008] The foregoing and other features of the present disclosure will become more fully apparent from the following description and appended claims, taken in conjunction with the accompanying drawings. Understanding that these drawings depict only several implementations in accordance with the disclosure and are therefore not to be considered 2 4876-5304-4652.3Atty. Dkt. No.: 046434-0844 limiting of its scope, the disclosure will be described with additional specificity and detail through use of the accompanying drawings.
[0009] Figure 1 shows a rate of construction of orthogonal matrices.
[0010] Figure 2 shows a rate of construction of orthogonal matrices utilizing permutations.
[0011] Figure 3 illustrates a computer system for use with certain implementations.
[0012] Reference is made to the accompanying drawings throughout the following detailed description. In the drawings, similar symbols typically identify similar components, unless context dictates otherwise. The illustrative implementations described in the detailed description, drawings, and claims are not meant to be limiting. Other implementations may be utilized, and other changes may be made, without departing from the spirit or scope of the subject matter presented here. It will be readily understood that the aspects of the present disclosure, as generally described herein, and illustrated in the figures, can be arranged, substituted, combined, and designed in a wide variety of different configurations, all of which are explicitly contemplated and made part of this disclosure. DETAILED DESCRIPTION
[0013] Described herein are systems and methods for a random generator of orthogonal matrices in finite fields. It should be appreciated that orthogonal matrices, in particular random generators of such matrices have applications in a wide range of fields. Embodiments utilizing the approaches described in further detail below may include encrypting by use of the generated orthogonal matrix. Further, such encryption may be used for cryptography, including for encrypted communications as well as for cryptocurrency or related functions. Extending beyond cryptography, such orthogonal matrices maybe harnessed as part of a signal processing function and device.
[0014] This application incorporates by reference U.S. Patent App. No.16 / 557,944, filed August 30, 2019, now U.S. Patent No.10,951,919, and U.S. Patent App. No.16 / 557,887, filed August 30, 2019, now abandoned, which claims priority to U.S. Provisional Patent App No. 62 / 725,700, filed August 31, 2018, and U.S. Provisional Patent App. No. 62 / 726,868, filed September 4, 2018. This application also incorporates by reference U.S. Patent App No. 12 / 989,736, filed May 1, 2009, now U.S. Patent No.9,318,232. 3 4876-5304-4652.3Atty. Dkt. No.: 046434-0844
[0015] Specifically, described herein are efficient computational procedures for proving the following theorem. Theorem 1. Let ^^ be a finite field and ^^ be an ^^ ൈ ^^ matrix function of the form:^^ ൌ 1, 2, … , ^^ െ 1 are Laurent polynomials, 0, 1, ^^^^ ∈ ^^. Denoteby ^^^, ^^ ൌ 1, 2, … , ^^ െ 1, the Hankel matrices:and by Δ the following ^ ^^ ^ 1^ ൈ ^ ^^ ^ 1^ matrix:If det Δ 0, then there exists a unique ^^ ൈ ^^ polynomial matrix ^^:^^^^^^^^ൌ ^^^^,^ ^^^, ^^^^,^ ∈ ^^, such that the entries in the product matrix:^^^ ^^^diag^1, 1, … , 1, ^^ିே^ ^^^ ^^^ contain only the non-negative powers of ^^ (i.e., the coefficients of ^^ି^, ^^ ൌ 1, 2, …, are 0 of ^^)and, in addition, ^^^1^ൌ ^^^.
[0016] Furthermore, the matrix polynomial in Eq. (3) has the property that:4 4876-5304-4652.3Atty. Dkt. No.: 046434-0844
[0017] The straightforward computations show that, due to the property Eq. (4), the ^^ ൈ ^^ matrix: ^^^ൌ ^^^െ1^ ൌ ^^^െ ^^^^ ^^ଶെ⋯^െ1^ே^^ேand the block circulant ^^^ ^^ ^ 1^ ൈ ^^^ ^^ ^ 1^ matrix ^^ with the first (block) row: ^^^ൌ ^ ^^^^^^… ^^ே^ (5) are orthogonal, i.e.:
[0018] Hence, relying on the proof of Theorem 1, after selecting positive integers ^^ and ^^, one can randomly generate the coefficients ^^^^, 1 ^ ^^ ^ ^^, 1 ^ ^^ ^ ^^, of polynomials ^^ ^^ in Eq. (1) from the field ^^ and construct the orthogonal matrices satisfying Eq. (6). Concerning computer memory allocation, these ^ ^^ െ 1^ ^^ integers, ^^^^(generators), contain full (lossless) information about ^^ଶ^ ^^ ^ 1^ integersin Eq. (5). Explicit formulas converting the matrix ^^^back into the generators are also provided.
[0019] Note that the method generates only the trivial matrix ^^^ൌ ^^^for ^^ ൌ 2 since െ1 ൌ 1 in ^^ ^^^2^ and ^^^1^ൌ ^^^by construction. However, the circulant matrix ^^ still may be different from the trivial matrix ^^^^ேା^^.
[0020] The Janashia-Lagvilava method in fact contains the proof of the above theorem. However, the primary theoretical improvement of the Janashia-Lagvilava method proposed in what follows is the modification of the existing computational procedures. This modification eliminates the need to invert any ^^ ൈ ^^ matrix, which was previously required, and makes the entire procedure superfast. Namely, constructing orthogonal matrices ^^^and ^^ of sizes ^^ ൈ ^^ and ^^^ ^^ ^ 1^ ൈ ^^^ ^^ ^ 1^, respectively, requires ^^^ ^^ଷ^ ^ ^ ^^ ^ 1^ଶ^^ଶ(with the exact constant 1 instead of ^^ in front of the second summand) multiplications (in the field ^^). Furthermore, for arbitrarily large ^^, it is possible to select the second parameter ^^ as small as 1, admitting a moderate level of randomness. Notation.
[0021] This section summarizes the notation used throughout the application. Let ^^ ≡ ^^ ^^^ ^^^ ൌ ^^ ^^^ ^^^^ be the Galois field consisting of ^^ ൌ ^^^elements, where ^^ is a prime 5 4876-5304-4652.3Atty. Dkt. No.: 046434-0844 number and ≅ ℤ ^ mod ^^^. Wherever if one encounters 0 or 1, they are presumed to belong to this field, while െ1 is the additive inverse of 1 in ^^.
[0022] For a set ^^, let ^^^ൈ^be the set of ^^ ൈ ^^ matrices with entries from ^^, while ^^^∶ൌ ^^^ൈ^. ^^^ൌ diag^1, 1, … , 1^ ∈is the identity matrix, and 0^ൈ^∈ ^^^ൈ^is the ^^ ൈ ^^ matrix consisting of zeros. A matrix M ∈ ^^^ൈ^with entries ^^^^∈ ^^ is denoted by ^^ ∶ൌ or simply by ^^ ∶ൌ ^ ^^ ൧. A matrix ^^ ൌ^ൈ^^^^ ^^^^൧ ∈ ^^ is called orthogonal if: ^^ ^^்ൌ ^^^(7)where ^^்ൌ ^ ^^^^൧ stands for the transpose of ^^. The above equation implies also that ^^்^^ ൌ ^^^. The set of orthogonal ^^ ൈ ^^ matricies in ^^ ^^^ ^^^ is denoted by ^^^ ^^, ^^^.
[0023] Let ^^ ≡ ^^^ ^^^ be the set of Laurent polynomials with coeffcients from ^^:Further, one can also consider the following subsets of ^^: ^^ା, ^^ି, ^^ேା, and ^^ , where ^^ is a non-negative integer, which corresponds to sets ^^^ൌ 0, ^^ଶൌ 0, 0 ൌ ^^^^ ^^ଶൌ ^^, and െ ^^ ൌ ^^^^ ^^ଶൌ 0 in Eq. (8), respectively. So, ^^ାis the set of usual polynomials, and ^^ேାis the set of polynomials of degree less than or equal to ^^. Of course, any polynomial ^^ ∈ ^^^ ^^^,can be considered as the function ^^: ^^ → ^^ by plugging in it the values from ^^ instead of indeterminate variable ^^. The coefficient ^^^∈ ^^ is called the free term of ^^. It is also naturally assumed that ^^ ⊂ ^^^ ^^^, i.e., ^^ ∈ ^^ can be identifed with the (constant) polynomial ^^ ^^^. Saying that a polynomial Eq. (9) is constant means that all coefficients, except for a possible term ^^^, are zero. In this case, this can be represented in shorthand as ^^^^^^ൌ ^^^. In a similar manner, ^^ ∈ ^^ାmeans that all the coefficients of ^^ corresponding to negative powers of ^^ are equal to 0.
[0024] A matrix (Laurent) polynomial ^^ ∈ ^^^ൈ^can also be viewed as a polynomial with matrix coefficients,6 4876-5304-4652.3Atty. Dkt. No.: 046434-0844 For a polynomial Eq. (9), letand for a matrix polynomial Eq. (10), leti.e., if ^^^ ^^^ ൌ^ୀ^:^ then ^^^^ ^^^ ൌ ^ ^^^^^^ ^^^൧^ୀ^:^^ୀ^:^ . A matrix polynomial ^^ is called para-unitary if ^^^^^^^^^^^^^ൌ ^^^(13)i.e., all matrix coefficients of ^^ ^^^ are 0^ൈ^except the free term, and the latter is equal to ^^^. Thus, the matrix polynomial ^^ in Eq. (4) is para-unitary.
[0025] The symbol ^^ stands for the Kronecker delta, i.e.,ൌ otherwise.
[0026] Note that basic linear algebra rules apply to linear spaces over finite fields, and therefore they can be used without further justification. Constructive Proof of Theorem 1.
[0027] The methods described herein mainly follow the path developed in the Janashia- Lagvilava method. Therefore, many details given therein are not repeated, and only the arising differences are emphasized.
[0028] Construction of the para-unitary matrix Eq. (3), for a given matrix Eq. (1), starts by considering the following system:The solution is sought in the class ^^ேା, i.e., for^^^^, ^^ଶ, … , ^^^^∈ ^ ^^ேା^^ൈ^satisfying the conditions of the system Eq. (14).
[0029] It is proved in prior publications that if ^^ different solutions are found: 7 4876-5304-4652.3Atty. Dkt. No.: 046434-08441,2, … , ^^(15)of Eq. (14) satisfying alsoand assume1,2, … , ^^(the order of coefficients has been reversed in the last entry of ^^^in order to get ^^^^), then Eq. (3) can be represented as a concatenation of the columns ^^ ൌ ^ ^^^^, ^^^ଶ, … ^^^^^ (17)and thus constructed matrix Eq. (17) will satisfy the condition Eq. (4) as well.
[0030] To solve the system Eq. (14), it is rewritten in the equivalent form in terms of the coefficients of polynomial entries. In particular, to obtain the solution Eq. (15) satisfying Eq. (16), Eq. (14) is reduced toare unknown matrix coefficients. Note that matrices ^^differ from the corresponding matrices in the first row. This replacement is justified by freedom of selection of constant terms 8 4876-5304-4652.3Atty. Dkt. No.: 046434-0844of polynomials entering Eq. (14). On the other hand, this exibility allows the condition ^^^1^ ൌ^^^ to be merged into the system Eq. (14). Therefore, one can avoid an expensive step ofinverting ^^ ൈ ^^ matrix required in preceding papers. Note also that ^^^differs from Eq. (2) in the same way, however, this difference is immaterial and the notation is retained for convinience.
[0031] The system in Eq. (18) is solved in a natural way, having: ^^^ൌ ^^ି^∙ ^^^∙ ^^^^ ^^^^^^ି^∙ 1, ^^ ൌ 1,2,Substituting these equations into the last equation of Eq. (18), the result is ^^^^^ି^ ^^^^^^^ ^^ଶ^^ି^ ^^ଶ^^^^ ⋯^ ^^^ି^^^ି^ ^^^ି^^^^^ ^^ ^^^ൌ െ ^^^^^ି^ ^^(where it is assumed that the right-hand side is equal to ^^ for ^^ ൌ ^^), which leads to ∆ ^^^ൌ െ ^^ି^^^^^^ି^^^ (20) whereThe sufficient condition, det ∆് 0, for the existence of the solution to Eq. (20) is reflected (in the slightly different but equivalent form) in the hypothesis of the theorem. Therefore,assuming that this condition holds, then determine ^^^ from Eq. (20) and then ^^^, ^^ ൌ1,2, … , ^^ െ 1 from Eq. (19).Paraunitary Filter Banks and Wavelets over ^^.
[0032] The theory of paraunitary filter banks (“PFB”) in real and complex fields was developed in Vaidyanathan, “MULTIRATE SYSTEMS AND FILTER BANKS,” Prentice Hall, New Jersey (1993) and is closely related with the concept of wavelet matrices as it is presented in Resnikoff & Wells, “WAVELET ANALYSIS: THE SCALABLE STRUCTURE OF INFORMATION,” Springer, New York (1998). This theory has many applications in signal processing. A complete parameterization of such filter banks and wavelet matrices depending on Janashia- Lagvilava method was proposed in related paper Ephremidze & Lagvilava, “On Compact Wavelet Matrices of Rank m and of Order and Degree N,” Journal of Fourier Analysis and Applications 20, pp.401-420 (2014) (hereinafter “Compact”). 9 4876-5304-4652.3Atty. Dkt. No.: 046434-0844
[0033] In Phoong & Vaidyanathan, “Paraunitary filter banks over finite fields,” IEEE Transactions on Signal Processing 45(6), pp. 1443-1457 (1997), PFB were considered over finite fields. It was emphasized that filter banks over finite fields have the advantage that all the round-off error and the coefficient quantization error can be eliminated completely. In addition, its potential applicability in cryptography, in the theory of error-correcting codes, was mentioned. Accordingly, various theoretical properties of PFB were explored. In parallel, the theory of wavelet transforms over finite fields has been proposed by several authors and further applications envisioned. As one can observe, these two developments mostly differ from each other by terminology only.
[0034] As paraunitary filter banks are coefficients of polynomial matrices in Eq. (3) with property in Eq. (4), the instant disclosure offers a superfast method for constructing PFB and related wavelet matrices. Furthermore, a great deal of facts observed in Compact and Generalization can be directly extended to finite fields setting as well. In particular, whenever paraunitary matrixis constructible by the method described, it is unique for a given set of generators, itsdeterminant is always equal to ^^ே, i.e.,detand the last row of the matrix ^^ேin Eq. (21) cannot be all zeros. Conversely, if one has a paraunitary matrix Eq. (21) such that ^ ^^, ^^^-th entry of ^^ேdiffers from zero, ^ ^^ே^^^് 0, then the generators ^^^, ^^ ൌ 1,2, … , ^^ െ 1, can be reconstructed by the formulas1,2, … , ^^ െ 1 (23) where under ൫ ^^ே^^^^ఫ^ ^^^൯ି^it is assumed a formal inverse series of the polynomial ^^ே^^^^ఫ^ ^^^ (it exists since its constant term differs from 0), and ^∑^^ୀିே^^^^^^^ି∶ൌ ∑ି^ୀ^ିே^^^^^^. Numerical Simulations.
[0035] Numerical simulations were preformed as described in this section using a MATLAB code that was executed on a laptop equipped with an Intel(R) Core(TM) i78650U CPU (with a clock speed of 1.90 GHz) and 16.00 GB of RAM. Whenever the matrix parameters 10 4876-5304-4652.3Atty. Dkt. No.: 046434-0844 exceeded the available memory of our local computer, the resting utilized a compute node from the High Performance Computing resources at New York University, Abu Dhabi. The compute node had an Intel(R) Xeon(R) CPU E5-2680 v4 @ 2.40 GHz processor, 28 CPUs, and 102 Gigabytes of usable memory. The results of these simulations are given in Tables 1 and 2, respectively. ^^ ^^ ^^ ^^ f ^^ ^^ f ^^ ^^ f ^^ ^^ f 100 1 7 0.04 141 97 0.04 14 997 0.07 1 4999 0.81 0 100 10 7 0.06 132 97 0.06 7 997 0.23 1 4999 4.59 0 100 50 7 0.23 144 97 0.28 17 997 1.14 0 4999 17.1 0 500 1 7 0.07 129 97 0.07 12 997 0.10 1 4999 0.87 1 500 10 7 0.15 145 97 0.18 10 997 0.37 2 4999 4.72 0 500 50 7 0.83 155 97 0.98 12 997 1.92 3 4999 19.2 0 1000 1 7 0.14 142 97 0.15 14 997 0.18 0 4999 0.97 0 1000 10 7 0.42 159 97 0.48 11 997 0.73 0 4999 5.05 0 1000 50 7 2.85 151 97 3.28 12 997 4.46 1 4999 25.4 0 5000 1 7 2.24 - 97 2.31 - 997 2.72 - 4999 3.75 - 5000 10 7 8.52 - 97 10.2 - 997 12.1 - 4999 20.4 - 5000 50 7 154 - 97 161 - 997 274 - 4999 353 - Table 1. Simulation results for orthogonal matrix generation on local laptop. ^^ ^^ ^^ ^^ f ^^ ^^ f ^^ ^^ f ^^ ^^ f 5000 1 7 1.40 146 97 1.54 10 997 1.56 0 4999 1.59 0 5000 10 7 4.03 148 97 5.31 13 997 5.37 1 4999 5.91 0 5000 50 7 23.4 158 97 26.5 13 997 26.7 1 4999 27.3 0 10000 1 7 4.85 156 97 5.12 7 997 5.48 1 4999 5.58 0 10000 10 7 15.7 153 97 19.5 12 997 22.1 2 4999 24.7 0 10000 50 7 79.6 122 97 87.1 9 997 94.5 1 4999 101 0 15000 1 7 11.3 170 97 11.5 13 997 12.3 0 4999 12.6 0 15000 10 7 35.2 155 97 43.2 11 997 48.9 0 4999 49.6 0 15000 50 7 - - 97 - - 997 - - 4999 - - Table 2. Simulation results for orthogonal matrix generation on HPC Compute Node.
[0036] They present the computational time (t in seconds) required to construct an ^^ ൈ ^^ orthogonal matrix ^^^or an ^^^ ^^ ^ 1^ ൈ ^^^ ^^ ^ 1^ circulant orthogonal matrix ^^ (see Eq. (6)) with elements from ^^^by the proposed method. The corresponding columns of the tables display the values of ^^, ^^, ^^, and ^^. (The gaps in the last row of Table 2 indicate that the available RAM was not sufficient to perform the corresponding computations.) Also, the probabilities of failure for the construction of the corresponding matrices were statistically estimated. Namely, for each triple ( ^^, ^^, ^^) 1000 random trials were conducted and the number of failures ^^recorded . The observed stability of results, as shown in the ^^ column of the table, indicates that the probability of failure is contingent solely upon ^^. At first glance, this appears particularly surprising, warranting further investigation into its underlying cause. 11 4876-5304-4652.3Atty. Dkt. No.: 046434-0844
[0037] Below are some 7 ൈ 7 matrices constructed in ^^ଽ^when the degree ^^ in random generators is 1. These examples illustrate that the selected coefficients are rather dispersed even for the lowest value of ^^. Observe that these matrices are symmetric and the additional simulations confirm that all matrices ^^ ∈ ^^^ ^^, ^^^ constructed by the proposed method are symmetric for ^^ ൌ 1. This indicates that additional regularities can be revealed by further careful exploration of the method. é85 95 2 1 53 64 11 37 76 22 96 25 71 73 72 25 82 76 69 29 995 38 60 30 38 77ùéùé 0ù ê39 76 86 68 41 42 96 14 25 18 48 9 12 43 32 60 3ú ê ú ê ú ê8 67 59 20 58 22 68 36 91 53 38 50 82 48 11 14 51 13 371 30 67 83 78 10 29ú,ê96 41 91 63 2 60 33ú,ê76 9 14 4 úêú ê ú ê0 52 57 13úê53 38 59 78 61 45 82úê25 42 53 2 48 52 48úê69 12 51 52 38 76 82úê64 77 20 10 45 59 13ú ê71 96 38 60 52 9 82ú ê29 43 13 57 76 47 19úë11 39 58 29 82 13 29ûë73 14 50 33 48 82 17ûë90 3 37 13 82 19 70û
[0038] The results suggest that the proposed method enables the selection of an orthogonal matrix that meets specific constraints through a comprehensive or nearly comprehensive screening process. To substantiate this claim, an example is provided using 4 ൈ 4 matrices in ℤହ, where | ^^^4,5^| is known to be 28800. Half of these orthogonal matrices have the determinant 1, while the other half have the determinant െ1. Therefore, it is sufficient to construct 14400 matrices if one knows that all of them have equal determinants.
[0039] Because of Eq. (22), if ^^ is the number of the coefficients in randomly generated polynomials ^^^in Eq. (1), then the determinant of corresponding ^^^ ^^^ is ^^ேfor each ^^ from ^^. Therefore, det^ ^^^ ൌ det ൫ ^^^െ1^൯ ൌ ^െ1^ேand, for any fixed value of ^^, the method enables the construction of half of the existing orthogonal matrices. For 4 ൈ 4 matrices, three random polynomials ^^^, ^^ଶ, and ^^ଷneed to be selected, and there are totally^5ଷ^ଷ= 1953125 choices for ^^ ൌ 3 coefficients (for each^^ ൌ 1, 2, 3,) from ℤହ. A comprehensive through all these cases took around an hour (on the laptop) and 14306 different matrices from ^^^4,5^ were selected. Then a complete screening (on the HPC) through^5ସ^ଷ= 244140625 choices for ^^ ൌ 4 was initiated, and the process terminated resulting in the selection of all 14400 different matrices in 5354 sec ≈ 1:5 h. Next, all (14400) diferent matrices from ^^^4,5^ were constructed by randomly selecting generators, ^^ଶ, ^^ଷwith ^^ ൌ 4 coefficients ^5ସ^ଷ= 244140625 choices. This random process took 1545 sec ≈ 0:43 h and the rate of building these matrices is displayed in Figure 1, indicating that the majority of matrices were constructed in a relatively short period of time. It has been found that a more effcient strategy was to add all of the left and right even permutations of each newly selected random matrix to the set of already constructed orthogonal matrices. Using this strategy, all 14400 orthogonal 12 4876-5304-4652.3Atty. Dkt. No.: 046434-0844 matrices (from the same 244140625 options of random choices) were constructed in just 8.22 seconds. The rate of building these matrices is displayed in Figure 2. Conclusion.
[0040] Described herein is a novel method for generating ^^ ൈ ^^ orthogonal matrices in the Galois field ^^ ^^^ ^^^ that is highly efficient and can handle large values of ^^ and ^^. This method is based on random selection, but it has been shown that it has a low probability of failure for large ^^, as verified through statistical testing. In addition, this method can be used to construct paraunitary filter banks over finite fields. This approach can be useful constructing orthogonal matrices that satisfy specific constraints, making it potentially valuable for applications in coding theory, e.g., in constructing linear codes with given hull dimension and minimum distance. Definitions.
[0041] No claim element herein is to be construed under the provisions of 35 U.S.C. § 112(f), unless the element is expressly recited using the phrase “means for.”
[0042] As utilized herein, the terms “approximately,” “about,” “substantially,” and similar terms are intended to have a broad meaning in harmony with the common and accepted usage by those of ordinary skill in the art to which the subject matter of this disclosure pertains. It should be understood by those of skill in the art who review this disclosure that these terms are intended to allow a description of certain features described and claimed without restricting the scope of these features to the precise numerical ranges provided. Accordingly, these terms should be interpreted as indicating that insubstantial or inconsequential modifications or alterations of the subject matter described and claimed are considered to be within the scope of the disclosure as recited in the appended claims.
[0043] It should be noted that the term “exemplary” and variations thereof, as used herein to describe various embodiments, are intended to indicate that such embodiments are possible examples, representations, or illustrations of possible embodiments (and such terms are not intended to connote that such embodiments are necessarily extraordinary or superlative examples). 13 4876-5304-4652.3Atty. Dkt. No.: 046434-0844
[0044] The term “coupled” and variations thereof, as used herein, means the joining of two members directly or indirectly to one another. Such joining may be stationary (e.g., permanent or fixed) or moveable (e.g., removable or releasable). Such joining may be achieved with the two members coupled directly to each other, with the two members coupled to each other using a separate intervening member and any additional intermediate members coupled with one another, or with the two members coupled to each other using an intervening member that is integrally formed as a single unitary body with one of the two members. If “coupled” or variations thereof are modified by an additional term (e.g., directly coupled), the generic definition of “coupled” provided above is modified by the plain language meaning of the additional term (e.g., “directly coupled” means the joining of two members without any separate intervening member), resulting in a narrower definition than the generic definition of “coupled” provided above. Such coupling may be mechanical, electrical, or fluidic.
[0045] Any references herein to the positions of elements (e.g., “top,” “bottom,” “above,” “below”) are merely used to describe the orientation of various elements in the figures. It should be noted that the orientation of various elements may differ according to other exemplary embodiments, and that such variations are intended to be encompassed by the present disclosure.
[0046] Various embodiments are described in the general context of method steps, which may be implemented in one embodiment by a program product including computer-executable instructions, such as program code, executed by computers in networked environments. Generally, program modules include routines, programs, objects, components, data structures, etc. that perform particular tasks or implement particular abstract data types. Computer- executable instructions, associated data structures, and program modules represent examples of program code for executing steps of the methods disclosed herein. The particular sequence of such executable instructions or associated data structures represents examples of corresponding acts for implementing the functions described in such steps.
[0047] Software and web implementations of the present invention could be accomplished with standard programming techniques with rule based logic and other logic to accomplish the various database searching steps, correlation steps, comparison steps and decision steps. It should also be noted that the words “component” and “module,” as used herein and in the claims, are intended to encompass implementations using one or more lines of software code, and / or hardware implementations, and / or equipment for receiving manual inputs. 14 4876-5304-4652.3Atty. Dkt. No.: 046434-0844
[0048] As shown in Figure 3, e.g., a computer-accessible medium 120 (e.g., as described herein, storage members directly or indirectly to one another. Such joining may be stationary (e.g., permanent) or moveable (e.g., removable or releasable). Such joining may be achieved with the two members or the two members and any device such as a hard disk, floppy disk, memory stick, CD-ROM, RAM, ROM, etc., or a collection thereof) can be provided (e.g., in communication with the processing arrangement 110). The computer-accessible medium 120 may be a non-transitory computer-accessible medium. The computer-accessible medium 120 can contain executable instructions 130 thereon. In addition or alternatively, a storage arrangement 140 can be provided separately from the computer-accessible medium 120, which can provide the instructions to the processing arrangement 110 so as to configure the processing arrangement to execute certain exemplary procedures, processes and methods, as described herein, for example. The instructions may include a plurality of sets of instructions.
[0049] System 100 may also include a display or output device, an input device such as a keyboard, mouse, touch screen or other input device, and may be connected to additional systems via a logical network. Many of the embodiments described herein may be practiced in a networked environment using logical connections to one or more remote computers having processors. Logical connections may include a local area network (“LAN”) and a wide area network (“WAN”) that are presented here by way of example and not limitation. Such networking environments are commonplace in office-wide or enterprise-wide computer networks, intranets and the Internet and may use a wide variety of different communication protocols. Those skilled in the art can appreciate that such network computing environments can typically encompass many types of computer system configurations, including personal computers, hand-held devices, multi-processor systems, microprocessor-based or programmable consumer electronics, network PCs, minicomputers, mainframe computers, and the like. Embodiments of the invention may also be practiced in distributed computing environments where tasks are performed by local and remote processing devices that are linked (either by hardwired links, wireless links, or by a combination of hardwired or wireless links) through a communications network. In a distributed computing environment, program modules may be located in both local and remote memory storage devices.
[0050] As used herein, the singular forms “a”, “an” and “the” include plural referents unless the context clearly dictates otherwise. Thus, for example, the term “a member” is 15 4876-5304-4652.3Atty. Dkt. No.: 046434-0844 intended to mean a single member or a combination of members, “a material” is intended to mean one or more materials, or a combination thereof.
[0051] As used herein, the terms “about” and “approximately” generally mean plus or minus 10% of the stated value. For example, about 0.5 would include 0.45 and 0.55, about 10 would include 9 to 11, about 1000 would include 900 to 1100.
[0052] It should be noted that the term “exemplary” as used herein to describe various embodiments is intended to indicate that such embodiments are possible examples, representations, and / or illustrations of possible embodiments (and such term is not intended to connote that such embodiments are necessarily extraordinary or superlative examples).
[0053] The terms “coupled,” “connected,” and the like as used herein mean the joining of two members directly or indirectly to one another. Such joining may be stationary (e.g., permanent) or moveable (e.g., removable or releasable). Such joining may be achieved with the two members or the two members and any additional intermediate members being integrally formed as a single unitary body with one another or with the two members or the two members and any additional intermediate members being attached to one another.
[0054] It is important to note that the construction and arrangement of the various exemplary embodiments are illustrative only. Although only a few embodiments have been described in detail in this disclosure, those skilled in the art who review this disclosure will readily appreciate that many modifications are possible (e.g., variations in sizes, dimensions, structures, shapes and proportions of the various elements, values of parameters, mounting arrangements, use of materials, colors, orientations, etc.) without materially departing from the novel teachings and advantages of the subject matter described herein. Other substitutions, modifications, changes and omissions may also be made in the design, operating conditions and arrangement of the various exemplary embodiments without departing from the scope of the present invention.
[0055] While this specification contains many specific implementation details, these should not be construed as limitations on the scope of any inventions or of what may be claimed, but rather as descriptions of features specific to particular implementations of particular inventions. Certain features described in this specification in the context of separate implementations can also be implemented in combination in a single implementation. Conversely, various features described in the context of a single implementation can also be 16 4876-5304-4652.3Atty. Dkt. No.: 046434-0844 implemented in multiple implementations separately or in any suitable subcombination. Moreover, although features may be described above as acting in certain combinations and even initially claimed as such, one or more features from a claimed combination can in some cases be excised from the combination, and the claimed combination may be directed to a subcombination or variation of a subcombination.
[0056] Although the figures and description may illustrate a specific order of method steps, the order of such steps may differ from what is depicted and described, unless specified differently above. Also, two or more steps may be performed concurrently or with partial concurrence, unless specified differently above. 17 4876-5304-4652.3
Claims
Atty. Dkt. No.: 046434-0844 WHAT IS CLAIMED IS:
1. A method of cryptography comprising: constructing an orthogonal matrix with elements from finite fields; and encoding information through the use of the constructed orthogonal matrix.
2. The method of claim 1, wherein constructing the orthogonal matrix comprises generating ^^ ൈ ^^ orthogonal matrices.
3. The method of claim 2, wherein the orthogonal matrix takes the form of^^ ൌ 1, 2, … , ^^ െ 1 are Laurent polynomials, further wherein thematrix is generated using positive integers only.
4. The method of claim 1, wherein no matrix inversion occurs during construction of the orthogonal matrix.
5. The method of claim 1, further comprising transmitting a digital file including the encoded information.
6. The method of claim 1, wherein the finite field is Galois field ^^ ^^^ ^^^.
7. The method of claim 1, wherein the constructed orthogonal matrix is a linear code.
8. A method of signal processing comprising: constructing an orthogonal matrix with elements from finite fields; and processing a signal with the orthogonal matrix.
9. The method of claim 8, further comprising constructing a discrete wavelet matrix with elements from the orthogonal matrix.
10. The method of claim 8, wherein the constructed orthogonal matrix is random. 18 4876-5304-4652.3Atty. Dkt. No.: 046434-0844 11. A computer system for encoding information using randomly generated orthogonal matrixes, comprising: constructing an orthogonal matrix with elements from finite fields; and encoding information through the use of the constructed orthogonal matrix.
12. The method of claim 11, wherein constructing the orthogonal matrix comprises generating ^^ ൈ ^^ orthogonal matrices.
13. The method of claim 11, wherein no matrix inversion occurs during construction of the orthogonal matrix.
14. The method of claim 11, wherein the constructed orthogonal matrix is a linear code. 19 4876-5304-4652.3
Citation Information
Patent Citations
Public / private key biometric authentication system
KR1020180081108A
Method and apparatus for compressed sensing
US20060029279A1
Method and apparatus for public-key cryptography based on error correcting codes
US20140105403A1
