US20010056452A1 - Efficient finite field basis conversion involving a dual basis - Google Patents
Efficient finite field basis conversion involving a dual basis Download PDFInfo
- Publication number
- US20010056452A1 US20010056452A1 US09/919,664 US91966401A US2001056452A1 US 20010056452 A1 US20010056452 A1 US 20010056452A1 US 91966401 A US91966401 A US 91966401A US 2001056452 A1 US2001056452 A1 US 2001056452A1
- Authority
- US
- United States
- Prior art keywords
- basis
- dual
- multiplier
- output
- value
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Abandoned
Links
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F7/00—Methods or arrangements for processing data by operating upon the order or content of the data handled
- G06F7/60—Methods or arrangements for performing computations using a digital non-denominational number representation, i.e. number representation without radix; Computing devices using combinations of denominational and non-denominational quantity representations, e.g. using difunction pulse trains, STEELE computers, phase computers
- G06F7/72—Methods or arrangements for performing computations using a digital non-denominational number representation, i.e. number representation without radix; Computing devices using combinations of denominational and non-denominational quantity representations, e.g. using difunction pulse trains, STEELE computers, phase computers using residue arithmetic
- G06F7/724—Finite field arithmetic
Landscapes
- Physics & Mathematics (AREA)
- General Physics & Mathematics (AREA)
- Engineering & Computer Science (AREA)
- Computational Mathematics (AREA)
- Mathematical Analysis (AREA)
- Mathematical Optimization (AREA)
- Pure & Applied Mathematics (AREA)
- Theoretical Computer Science (AREA)
- Computing Systems (AREA)
- Mathematical Physics (AREA)
- General Engineering & Computer Science (AREA)
- Complex Calculations (AREA)
Abstract
Description
- The present application claims the benefit of U.S. Provisional Application Serial No. 60/066,937 filed on Nov. 18, 1997.
- The present invention relates generally to techniques for converting signals of a finite field having one basis to signals of a finite field having another basis, and more particularly to finite field basis conversion techniques which involve a dual basis.
- As described in U.S. application Ser. No. 08/851,045, filed in the name of inventors Burton S. Kaliski Jr. and Yiqun Lisa Yin on May 5, 1997 and entitled “Methods and Apparatus for Efficient Finite Field Basis Conversion,” and which is incorporated by reference herein, conversion between different choices of basis for a finite field is an important problem in today's computer systems, particularly for cryptographic operations. While it is possible to convert between two choices of basis by matrix multiplication, the matrix may be too large for some applications, hence the motivation for more storage-efficient techniques.
-
- where B[0], . . . , B[m−1]εGF(q) are the coefficients. Two common types of basis are a polynomial basis and a normal basis. In a polynomial basis, the basis elements are successive powers of an element γ, called the generator:
- ωi=γi.
- A polynomial ƒ of degree m, called the minimal polynomial of γ, relates the successive powers:
- γm+ƒm−1γm−1+ƒm−2γm−2+ . . . +ƒ1γ+ƒ0=0.
- In a normal basis, the basis elements are successive exponentiations of an element γ, again called the generator:
- ωi=γq
i . - Another common type of basis is a dual basis. Let ω0, . . . , ωm−1 be a basis and let h be a nonzero linear function from GF(qm) to GF(q), i.e., a function such that for all ε, φ,
- h(ε+φ)=h(ε)+h(φ).
-
- The dual basis is uniquely defined, and duality is symmetric: the dual basis with respect to h of the basis ξ0, . . . , ξm−1 is the basis ω0, . . . , ωm−1. A dual basis can be defined for a polynomial basis, a normal basis, or any other choice of basis, and with respect to a variety of functions (including, as an example, the function that evaluates to a particular coefficient of the representation of the field element in some basis).
- The basis conversion or change-of-basis problem is to compute the representation of an element of a finite field in one basis, given its representation in another basis. The problem has two forms, which distinguish between the internal basis in which finite field operations are performed, and the external basis to and from which one is converting:
- Import problem. Given an internal basis and an external basis for a finite field GF(qm) and the representation B of a field element in the external basis (the “external representation”), determine the corresponding representation A of the same field element in the internal basis (the “internal representation”).
- Export problem. Given an internal basis and an external basis for a finite field GF(qm) and the internal representation A of a field element, determine the corresponding external representation B of the same field element.
- A conventional solution to both problems is to apply a change-of-basis matrix relating the two bases. However, as the matrix is potentially quite large, and as the operations involved are not necessarily implementable with operations in either basis, the matrix-based conversion process may be inefficient in many important applications.
- Another approach to conversion is to compute with a dual basis. Consider the problem of converting to the basis ω0, . . . , ωm−1, and let ξ0, . . . , ξm−1 be its dual basis with respect to some linear function h. Then by the definition of the dual basis and the linearity of h, it follows that for all i,
- B[i]=h(εξi).
- One can therefore convert by multiplying by elements of the dual basis and evaluating the function h, another straightforward and effective solution, which is efficient provided that the elements of the dual basis ξ0, . . . , ξm−1 can be generated efficiently and that the function h can be computed efficiently. But this approach is again limited by a number of difficulties. First, the approach requires the elements of the dual basis, which must either be stored in the form of m2 coefficients, or computed. Second, it requires the computation of the function h, which may or may not be efficient. More practical choices of h have been suggested, such as a particular coefficient of the representation in some basis. See, for example, S. T. J. Fenn, M. Benaissa, and D. Taylor, “Finite Field Inversion Over the Dual Basis,” IEEE Transactions on VLSI, 4(1):134-137, March 1996, which is incorporated by reference herein. But even with a more practical h, there still remains the problem of determining the dual basis efficiently. Moreover, the Fenn et al. method is efficient only when m is very small, and no general efficient conversion algorithm is given.
- A number of other references describe finite field basis conversion operations involving dual basis. For example, U.S. Pat. No. 4,994,995, issued Feb. 19, 1991 to R. W. Anderson, R. L. Gee, T. L. Nguyen, and M. A. Hassner, entitled “Bit-Serial Division Method and Apparatus,” describes hardware for a converter which converts an element in GF(2m) in a polynomial basis representation to a scalar multiple of its dual basis representation, where the scalar is an element of the field. The scalar is chosen so that the scalar multiple of the dual has many of the same elements as the polynomial basis. The hardware consists of AND gates, XOR gates, and a table for computing the trace function. Again, no general conversion algorithm is suggested. I. S. Hsu, T. K. Truong, L. J. Deutsch, and I. S. Reed, “A Comparison of VLSI Architecture of Finite Field Multipliers using Dual, Normal, or Standard Bases,” IEEE Transactions on Computers, 37(6):735-739, June 1988, discloses conventional techniques for converting between polynomial and dual bases. D. R. Stinson, “On Bit-Serial Multiplication and Dual Bases in GF(2m),” IEEE Transactions on Information Theory, 37(6):1733-1737, November 1991, describes change-of-basis matrices between polynomial and dual bases. Given a polynomial basis such that the change-of-basis matrix M from the dual basis to some scalar (cεGF(2m)) times the polynomial basis has as few “1” entries as possible, efficient bit-serial multiplication is possible. Given the minimal polynomial of α, a generator of the polynomial basis, the Stinson reference gives simple formulae computing a scalar c and the weight of the matrix M. Although the above-cited references disclose numerous conventional techniques for converting between a polynomial basis and its dual basis, these techniques are generally inefficient in terms of memory, and may also be inefficient in terms of computation time.
- The above-cited U.S. application Ser. No. 08/851,045 introduced the “shift-extract” technique of basis conversion, and also provided several storage-efficient and computation-efficient algorithms based on that technique for converting to and from a polynomial or normal basis. The conversion algorithms described therein overcome many of the problems associated with the previously-described conventional approaches. However, a need remains for further improvements in finite field basis conversion, particularly with regard to techniques involving dual basis.
- It is therefore an object of the present invention to provide efficient finite field basis conversion techniques involving dual basis which do not require an excessively large amount of storage or an excessively large number of operations, and which take advantage of the built-in efficiency of finite field operations in one basis, rather than implementing new operations such as matrix multiplications.
- The invention provides apparatus and methods for use in basis conversion involving dual basis, such as a dual of a polynomial basis or dual of a normal basis. For example, the invention includes efficient basis generators for generating the dual of a polynomial or normal basis. In accordance with the invention, these generators are implemented in generate-accumulate import basis converters and conversion algorithms, and generate-evaluate export basis converters and conversion algorithms. The invention also includes efficient basis shifters for performing shifting operations in a dual of a polynomial basis or normal basis. In accordance with the invention, these basis shifters are implemented in shift-insert import basis converters and conversion algorithms, and shift-extract export basis converters and conversion algorithms. The basis shifters may also be used to provide alternative shift-based basis generators.
- The basis conversion techniques of the invention significantly increase the storage and computational efficiency of dual basis conversion operations in cryptographic systems and other applications, relative to the conventional dual basis conversion approaches described previously. The basis converters and conversion algorithms in accordance with the invention are computationally efficient in that they involve primarily or exclusively finite-field operations, rather than more complex operations such as matrix multiplications, and thus benefit from available optimizations for finite-field operations. The invention may be used, for example, to convert from a polynomial basis or a normal basis to a corresponding dual basis, and vice versa, in order to simplify cryptographic operations. These and other features of the present invention will become more apparent from the accompanying drawings and the following detailed description.
- FIG. 1 shows a basis converter which performs import operations using a generate-accumulate method in accordance with the present invention.
- FIGS. 2A and 2B show basis converters which perform import operations using a shift-insert method in accordance with the present invention.
- FIGS. 3A and 3B show basis converters which perform export operations using a generate*-evaluate method in accordance with the present invention.
- FIGS. 4A and 4B show basis converters which perform export operations using a shift-extract method in accordance with the present invention.
- FIG. 5 shows a polynomial* basis generator in accordance with the present invention.
- FIG. 6 shows a polynomial* basis external shifter in accordance with the present invention.
- FIG. 7 shows an alternative polynomial* basis generator in accordance with the present invention.
- FIG. 8 shows a normal* basis generator in accordance with the present invention.
- FIG. 9 shows a normal* basis external shifter in accordance with the present invention.
- FIGS. 10 and 11 show an alternative normal* basis generator and an alternative normal* basis shifter, respectively, in accordance with the present invention.
- FIGS. 12A and 12B illustrate exemplary cryptographic systems in which the basis conversion techniques of the present invention may be implemented.
- The present invention will be described in several sections below in accordance with the following outline.
- 1.0 Overview of Basis Conversion Techniques
- 1.1 Import Algorithms
- 1.1.1 Generate-Accumulate Method
- 1.1.2 Shift-Insert Method
- 1.2 Export Algorithms
- 1.2.1 Generate*-Evaluate Method
- 1.2.2 Shift-Extract Method
- 1.3 Summary Tables
- 2.0 Techniques Involving the Dual of a Polynomial Basis
- 2.1 Efficient Basis Generation
- 2.1.1 Importing from a Polynomial* Basis by Generate-Accumulate
- 2.1.2 Exporting to a Polynomial Basis by Generate*-Evaluate
- 2.2 Efficient External Shifting
- 2.2.1 Importing from a Polynomial* Basis by Shift-Insert
- 2.2.2 Exporting to a Polynomial* Basis by Shift-Extract
- 3.0 Techniques Involving the Dual of a Normal Basis
- 3.1 Efficient Basis Generation
- 3.1.1 Importing from a Normal* Basis by Generate-Accumulate
- 3.1.2 Exporting to a Normal Basis by Generate*-Evaluate
- 3.2 Efficient External Shifting
- 3.2.1 Importing from a Normal* Basis by Shift-Insert
- 3.2.2 Exporting to a Normal* Basis by Shift-Extract
- 4.0 Applications
- As noted above, U.S. application Ser. No. 08/851,045 introduced the “shift-extract” technique of basis conversion, and also provided several storage-efficient algorithms based on that technique for converting to a polynomial or normal basis. The present invention provides techniques involving the dual of a polynomial or normal basis, including storage-efficient generation of a dual basis and storage-efficient shifting in such a basis. The present invention may be used in combination with the “shift-extract” technique of U.S. application Ser. No. 08/851,045 as well as other basis conversion techniques, but also provides several new storage-efficient and computation-efficient algorithms for converting to and from the dual of a polynomial or normal basis, as well as additional algorithms for converting to a polynomial or normal basis. Like the invention described in U.S. application Ser. No. 08/851,045, the present invention applies both to even-characteristic and odd-characteristic finite fields of degree greater than one, though even-characteristic processing is the most likely application since it is generally more common in practice. It should be noted that in certain special cases, a given dual basis may be the same as the corresponding polynomial or normal basis. These so-called “self-dual” bases can be generated using conventional techniques, and thus do not require the dual basis techniques described herein.
- An overview of the basis conversion techniques of the present invention will now be provided. Algorithms for particular choices of basis will then be described in greater detail in subsequent sections. In the following description, the dual of a polynomial basis will be denoted as a polynomial* basis, and the dual of a normal basis will be denoted as a normal* basis. Although the problem of conversion between two choices of basis involving different ground fields is not addressed in this description, it will be apparent to those skilled in the art that the described techniques can be readily applied to this problem in a straightforward manner, as illustrated in U.S. application Ser. No. 08/851,045.
- It should also be noted that for all the techniques described, it may be possible to improve efficiency by working with a scaled version of the intended basis, as the conversion process may be simpler for certain scaling factors. During an export operation, the element to be converted would be multiplied by the scaling factor before conversion to the external basis, and during an import operation, the element would be multiplied by the inverse of the scaling factor after conversion. Since a scaled version of a basis is also in general a basis, the general techniques described herein apply, the multiplication by the scaling factor or its inverse being considered simply as an additional processing step.
- 1.1 Import Algorithms
- Given an internal basis and an external basis for a finite field and the representation B of a field element in the external basis, an import algorithm determines the corresponding representation A of the same field element in the internal basis. Two general methods for determining the internal representation A are described below: the generate-accumulate method and the shift-insert method.
- 1.1.1 Generate-Accumulate Method
-
- where W0, . . . , Wm−1 are the internal-basis representations of the elements of the external basis. The basic form of algorithm for this method, which is well known in the prior art, is as follows:
- proc I
mport By Gen Accum - A←0
- for i from 0 to m−1 do
- A←A+B[i]×Wi
- end for
- end proc
- As written, this conventional algorithm requires storage for the m values W0, . . . , Wm−1, and is therefore not storage efficient. To reduce the storage requirement, it is necessary to generate the values as part of the algorithm. This is straightforward when the external basis is a polynomial basis or a normal basis. The variant algorithm mentioned in the conjunction with the algorithms I
mport Poly and Import Normal in U.S. application Ser. No. 08/851,045 follows this method. - FIG. 1 shows a basis converter which implements the Generate-Accumulate import algorithm. An external basis representation (B)1 is stored in an
input register 2. At each step of a loopingmechanism 9, acoefficient selector 4 and abasis generator 3 respectively select and generate the pair (B[i], Wi), which are multiplied in amultiplier 5, and accumulated by anadder 6 into anoutput register 7. Unless otherwise stated, all output registers shown herein are assumed to hold the value zero initially, or to be initialized to zero before the start of the conversion algorithm. Once the loop is finished, the content ofregister 7 is output as an internal representation (A) 8. Thebasis generator 3 could be, for example, a polynomial* basis generator (see FIG. 5), a normal* basis generator (see FIG. 8), or a normal or polynomial basis generator. - The present invention provides algorithms for generating the values for a polynomial* or normal* basis, called G
en Poly * and Gen Normal *, which lead to two new conversion algorithms for polynomial* and normal* bases, Import Poly *By Gen Accum and Import Normal *By Gen Accum. - 1.1.2 Shift-Insert Method
- The Shift-Insert method computes the internal representation A by “shifting” an intermediate variable in the external basis, and inserting successive coefficients between the shifts. This follows the same concept as the shift-extract method to be described below. Let S
hift be a function that shifts an element in the external basis, i.e., a function such as one which given the internal representation of an element with external representation - B[0] B[1] . . . B[m−2] B[m−1]
- computes the internal representation of the element with external representation
- B[m−1] B[0] . . . B[m−3] B[m−2].
- Other forms of shifting are possible, including shifting in the reverse direction, or shifting where the value 0 rather than B[m−1] is shifted in.
- The basic form of algorithm for this method is as follows:
- proc I
mport By Shift Insert - A←0
- for i from m−1 downto 0 do
- S
hift (A) - A←A+B[i]×W0
- endfor
- endproc
- The direction of the for loop may vary depending on the direction of the shift. The algorithm has the advantage over I
mport By Gen Accum that more than one coefficient can readily be processed per iteration, regardless of the basis. If one wishes to reduce the number of shifts by a factor of k, k-fold insertion can be performed at each iteration of the loop. If k does not divide m, some of the insertions may have to be performed outside of the loop (in Import By Gen Accum , a similar improvement can only be done for certain choices of basis). However, an efficient Shift function is required. The algorithms Import Poly and Import Normal in U.S. application Ser. No. 08/851,045 follow this method. - FIG. 2A shows a basis converter which implements the Shift-Insert import algorithm. The
external basis representation 1 is stored in theinput register 2. At each step of a loopingmechanism 16, acoefficient selector 10 selects one coefficient B[i] of the external representation. This element is then multiplied by apredetermined basis element 12, and added by anadder 13 into aregister 15. Then, theregister 15 is shifted by anexternal shifter 14. Once the loop is finished, the content ofregister 15 is output as theinternal basis representation 8. - FIG. 2B shows a basis converter which implements the above-described k-fold optimization of the Shift-Insert import algorithm. The
external basis representation 1 is stored in aninput register 9. Amultiple coefficient selector 10′ selects k elements of the array, each of which is multiplied by different basis elements from abasis element source 12′ via the multipliers 11-1, 11-2, . . . , 11-k, and accumulated by the adders 13-1, 13-2, . . . , 13-k into theregister 15. Alternatively, themultiple coefficient selector 10′ could be k separate coefficient selectors. Note that the multiplications could be done in parallel. Theexternal shifter 14 in FIGS. 2A and 2B could be, for example, a polynomial* basis external shifter (see FIG. 6), a normal* basis external shifter (see FIG. 9), or a normal or polynomial basis external shifter (see U.S. application Ser. No. 08/851,045). - The present invention provides algorithms for shifting in a polynomial* or normal* basis, called S
hift Poly * and Shift Normal *, which lead to two new conversion algorithms for polynomial* and normal* bases, Import Poly *By Shift Insert and Import Normal *By Shift Insert . Alternative forms of Gen Poly * and Gen Normal * and hence Import Poly *By Gen Accum and Import Normal *By Gen Accum may also be obtained from the Shift functions, as it is possible to generate the internal representations of the elements of an external basis by repeated application of Shift. - 1.2 Export Algorithms
- Given an internal basis and an external basis for a finite field and the representation A of a field element in the internal basis, an export algorithm determines the corresponding representation B of the same field element in the internal basis. Two general methods for determining the external representation B are described: the generate*-evaluate method and the shift-extract method.
- 1.2.1 Generate*-Evaluate Method
- The Generate*-Evaluate method computes the external representation B by evaluating products of A with successive elements of a dual of the external basis, as in the equation
- B[i]=h(AX i)
- where h is a linear function and X0, . . . , Xm−1 are the internal-basis representations of the elements of the dual of the external basis with respect to the function h. (The “Generate*” designation refers to the fact that the dual basis is generated.) The basic form of algorithm for this method, which is well known in the prior art, is as follows:
- proc E
xport By Gen *Eval - for i from 0 to m−1 do
- T←A×Xi
- B[i]←h(T)
- end for
- end proc
- A variation on this conventional algorithm is to generate the values AX0, . . . , AXm−1 directly, which can save a multiplication during each iteration. The algorithms G
en Poly * and Gen Normal * are easily adapted to this approach. The choice of function h and the consequent choice of dual basis is generally not important as far as the correctness of the algorithm, though some choices may lead to more efficient implementations than others. For instance, the choice h(T)=T[0] is particularly efficient. The conventional algorithm Export By Gen *Eval requires storage for m values, and, as was the case for the conventional algorithm Import By Gen Accum , to reduce the storage requirement, it is necessary to generate the values as part of the algorithm. - FIG. 3A shows a basis converter implementing the Generate*-Evaluate export algorithm. An
internal basis representation 17 is stored in aregister 18. At each step of a loopingmechanism 25, adual basis generator 19 outputs a dual basis element Xi, which is multiplied by the internal representation inmultiplier 20. Anevaluator 21 then evaluates a linear function h on Xi×A, and the result is inserted by acoefficient insertor 22 into anoutput register 23. Once the loop is finished, the content ofregister 23 is output as anexternal basis representation 24. - FIG. 3B shows an improvement in the basis converter of FIG. 3A which gives the
dual basis generator 19 the value A×Z to scale by instead of Z, which eliminates one multiplication per iteration of the loop. Thedual basis generator 19 in FIGS. 3A and 3B could be, for example, a polynomial* basis generator (see FIG. 5), a normal* basis generator (see FIG. 8), or a normal or polynomial basis generator. Theevaluator 21 in FIGS. 3A and 3B may be, for example, a circuit which evaluates a linear function, or another suitable evaluator. - As previously noted, the present invention provides algorithms for generating the values for a polynomial* or normal* basis, called G
en Poly * and Gen Normal *. This leads to two algorithms for polynomial and normal bases, Export Poly By Gen *Eval and Export Normal By Gen *Eval . The latter algorithm was first presented as algorithm Export Normal * in U.S. application Ser. No. 08/851,045, and is presented again here for completeness. - It should be noted that it is straightforward to generate the dual of the external basis when the external basis is a polynomial* or normal* basis, since the dual is then a scaled polynomial or scaled normal basis. The algorithms for these choices of basis, which one might call E
xport Poly *By Gen *Eval and Export Normal *By Gen *Eval , may thus be considered part of the prior art. - 1.2.2 Shift-Extract Method
- The Shift-Extract method computes the external representation A by “shifting” an intermediate variable in the external basis, and extracting successive coefficients between the shifts. This follows the same concept as the shift-insert method above, and may be based on the same S
hift function and an Extract function that obtains a selected coefficient of the external representation. (The Extract function is similar to the h function in the previous method.) The basic form of algorithm for this method is as follows: - proc E
xport By Shift Extract - for i from m−1 to 0 do
- B[i]←E
xtract (A) - S
hift (A) - end for
- end proc
- Again, the direction of the for loop may vary depending on the direction of the shift.
- The algorithm has the advantage over E
xport By Gen *Eval that more than one coefficient can readily be processed per iteration, regardless of the basis. If one wishes to reduce the number of shifts by a factor of k, k-fold extraction can be performed at each iteration of the loop. If k does not evenly divide m, some of the extractions may have to be done outside the loop. However, an efficient Shift function is required. The shift-extract approach was introduced in U.S. application Ser. No. 08/851,045, and related Shift functions are described there for a polynomial and a normal basis, leading to the algorithms Export Poly and Export Normal. - FIG. 4A shows a basis converter implementing the Shift-Extract export algorithm. The
internal representation 17 is stored in aregister 26. Then, at each step of a loopingmechanism 31, anextractor 27 extracts the coefficient B[i], and passes the result to acoefficient insertor 28 which inserts it into anoutput register 29. Then, theregister 26 is shifted by anexternal shifter 30. Once the loop is finished, the content ofregister 29 is output as theexternal basis representation 24. - FIG. 4B shows the above-described k-fold optimization of the Shift-Extract algorithm. A
multiple extractor 27′ extracts k coefficients, which coefficient insertors 28-1, 28-2, . . . , 28-k insert into theoutput register 29. Themultiple extractor 27′ may simply be k extractors in parallel, or may have another configuration. Theexternal shifter 30 in FIGS. 4A and 4B could be, for example, a polynomial* basis external shifter (see FIG. 6), a normal* basis external shifter (see FIG. 9), or a normal or polynomial basis external shifter (see U.S. application Ser. No. 08/851,045). - As previously noted, the present invention provides algorithms for shifting in a polynomial* or normal* basis, called S
hift Poly * and Shift Normal *. This leads to two new conversion algorithms, Export Poly *By Shift Insert and Export Normal *By Shift Insert . Alternative forms of Gen Poly * and Gen Normal * and hence Export Poly By Gen *Eval and Export Normal By Gen *Eval may also be obtained from the Shift functions, as it is possible to generate the internal representations of the elements of an external basis by repeated application of Shift. - 1.3 Summary Tables
- The following Tables summarize the foregoing techniques and where they are described.
TABLE 1 Import Algorithms. Method Basis Shift-Insert Generate-Accumulate POLY Ser. No. 08/851,045 Ser. No. 08/851,045 NORMAL Ser. No. 08/851,045 Ser. No. 08/851,045 POLY* present invention present invention NORMAL* present invention present invention -
TABLE 2 Export Algorithms. Method Basis Shift-Extract Generate*-Evaluate POLY Ser. No. 08/851,045 present invention NORMAL Ser. No. 08/851,045 Ser. No. 08/851,045 POLY* present invention prior art NORMAL* present invention prior art -
Let 1, γ, . . . , γm−1 be a polynomial basis for GF(qm), and let h(x) be a linear function from GF(qm) to GF(q). Let h0(x) be the linear function whose output is the 1-coefficient of x when x is written in the polynomial basis, where the term “1-coefficient” denotes the coefficient of the first basis element. In general, let hi(x) be the coefficient of the ith basis element of x written in the internal basis. Furthermore, let ζ be the element of GF(qm) such that h0(xζ)=h(x). In the remainder of the description, let ξ0, ξ1, . . . , ξm−1 denote the canonical dual basis and η0, η1, . . . , ηm−1 a dual basis. A formula for the dual basis (i.e., the polynomial* basis) of the above-described polynomial basis with respect to h is: - η0=ζ1ξ0, η1=ζ−1ξ1, . . . , ηm−1=ζ−1ξm−1
- where ξ0=1 and ξi=ξi−1γ−1−h0(ξi−1γ−1). When h=h0, ζ=1, and η0, η1, . . . , ηm−1 equals ξ0, ξ1, . . . , ξm−1 and is called the canonical polynomial* basis. To prove the correctness of the formula, one can use the definition of the dual basis, and induction. First,
- h(1ζ1)=h 0(1)=1, and
- h(γiζ1)=h 0(γi)=0 for i>0.
- Suppose it is known that the first i−1 elements are correct elements of the dual basis. Then for the ith element:
- h(γiζ1ξi)=h(γi−1ζ−1ξi−1)−h(γiζ−1 h 0(ξi−1γ−1))=1−h 0(γi h 0(ξi−1γ−1))=1,
- since h0(γic)=0, whenever c is an element of GF(q) and i>0. Furthermore, if i≠j and j≠0,
- h(γiζ1ξi)=h(γj−1ζ−1ξi−1)−h(γiζ−1 h 0(ξi−1γ−1))=0−h 0(γi h 0(ξi−1γ−1))=0.
- If j=0, h(ξiζ1)=h0(ξi)=0. Thus, the formula for the dual basis is correct. In the following algorithms, Z will generally be the internal representation of ζ−1, Y will be the internal representation of ζ, G will be the internal representation of γ, H will be the internal representation of γ−1, and I will be the internal representation of the identity element. The value Z corresponds to the function h(ε)=h0(ζε), and contains the information specific to the choice of dual basis in the following algorithms. Note that if Z is 0, h(ε)=h0(0)=0, and therefore, h would not be a suitable linear function for this purpose. However, it may be useful in some applications to have Z=0. Z will also be referred to herein as the scaling factor.
- In general, the internal representations of constants such as Z, Y, G and H utilized by the algorithms described herein can be obtained by applying known techniques, such as the correspondence between linear functions and multiplication by group elements, or solution of polynomials. For example, the internal representation G of the generator of an external basis can be computed using information about the internal and external basis, as noted in U.S. application Ser. No. 08/851,045. The general approach to computing such a representation is to find a root, in the internal-basis representation, of an appropriate polynomial corresponding to the external basis. Such root-finding techniques are well known in the prior art. As a further example, the value V0 used in certain of the algorithms described herein, and other elements corresponding to a linear function, can be computed by matrix operations, as described in U.S. application Ser. No. 08/851,045. All these values can be precomputed as part of the setup for the algorithms. Their computation is not necessarily part of the algorithms themselves.
- 2.1 Efficient Basis Generation
- The algorithm G
en Poly * shown below generates the internal representation of the dual basis elements of a polynomial basis, in accordance with an illustrative embodiment of the invention. Gen Poly * is an iterator; it is meant to be called many times in succession. The first time an iterator is called, it starts from the “iter” line. When a yield statement is reached, the iterator returns the value specified by the yield. The next time an iterator is called, it starts immediately after the last yield executed; all temporary variables are assumed to retain their values from one call to the next. An iterator ends when the “enditer” line is reached. - Input:
- Z, a scaling factor.
- Output:
- W0, . . . , Wm−1, the canonical polynomial* basis scaled by Z.
- Parameters:
- m, the degree of the finite field.
- Constants:
- I, the internal representation of the identity element,
- V0, the internal representation of the element such that if T=A×V0, T[0]=h0(A),
- H, the internal representation of the inverse of the polynomial basis generator.
- Algorithm:
- iter G
en Poly * - W←I
- yield Z
- for i from 1 to m−1 do
- W←W×H
- T←W×V0
- W←W−T[0]×I
- yield W×Z
- endfor
- enditer
- Typically, Z will be the internal representation of the scaling factor. However, as noted above, sometimes one may wish to use a value of 0 for Z, which does not correspond to any linear function. If Z does correspond to a linear function, the output is the polynomial* basis with respect to the linear function corresponding to Z. In all cases, the output is the canonical polynomial* basis scaled by Z, and in the case that Z=0, the output will always be zero. At iteration i, the algorithm outputs Wi. To show that this is the correct result, note that W at the beginning of the algorithm corresponds to ξ0=1. Proceeding by induction, at each iteration, W is recalculated as WH−h0(WH). So, ξi becomes ξiγ−1−h0(ξiγ−1)=ξi+1, which is the correct term. The value ηi=ζ1ξi is then output. This version is a preferred embodiment and generally the most efficient version, but other versions are possible. For instance, one could set W to Z instead of I, and then at each iteration multiply by Z−1 before applying the formula, then multiply by Z again afterwards. This turns out to be equivalent to the generation method based on the algorithm S
hift Poly * below. - FIG. 5 shows a polynomial* basis generator in accordance with the invention, which implements the above-described iterator G
en Poly *. The value W0=Z is output first. Aregister 34 stores the canonical poly* basis, initialized to the identity element I. At each call, this is multiplied by H, then from this result, the value (W×V0)[0]×I is subtracted. The value (W×V0)[0]×I is computed usingmultipliers coefficient selector 37, where W is the value stored inregister 34. The subtraction is done by ascalar subtractor 39. Once this subtraction is computed, the result is stored in theregister 34, and is multiplied in themultiplier 33 by the scaling factor Z to obtain the output Wi, a scaled polynomial* basis element. As in the algorithm Gen Poly *, the value V0 is the element such that (A×V0)[0]=h0(A) in the internal basis, H is the internal representation of γ−1, and I is the internal representation of the identity element. Alternatively, themultiplier 36 and thecoefficient selector 37 may be replaced by a coefficient extractor, i.e., a circuit that selects a coefficient of an element in the external basis, given that element's internal basis representation. - Other forms of G
en Poly * may be readily constructed in accordance with the invention. For example, it may be convenient to perform the steps of the loop in a different order, perhaps starting the value W at a different state, as in the following alternate algorithm: - Algorithm:
- iter G
en Poly * - W←H
- yield W×ZG
- for i from 1 to m−1 do
- T←W×V0
- W←W−T[0]×I
- W←W×H
- yield W×ZG
- endfor
- enditer
- This alternate algorithm, which involves a slight rewriting of the steps of the previous algorithm, has the property that it involves the same sequence of steps in the loop (ignoring the yield) as the exemplary polynomial-basis shifter described in U.S. application Ser. No. 08/851,045, which may provide benefits in terms of sharing of computational logic.
- Another possible variant of the G
en Poly * algorithm is the following: - Algorithm:
- iter G
en Poly * - W←Z
- yield W
- for i from 1 to m−1 do
- T←W×V0YH
- W←W×H
- W←W−T[0]×Z
- yield W
- endfor
- enditer
- This variant avoids the multiplication in the yield, but it presumes the availability of Y=Z−1, or at least V0YH. It may be inconvenient or expensive to compute Z−1, as would be the case if Z is a variable input value such as the value A to be converted, as in the E
xport Poly By Gen *Eval algorithm to be described in Section 2.1.2 below. - In the case that the linear function to which Z corresponds is the coefficient at index 0 of the internal basis representation, i.e., the linear function x0 in Section 2.1.2 below, V0=Z, V0Y=I, and T[0]=W[0], and the first multiplication in the loop in the above variant is not needed. This fact can be exploited to obtain the following variant of the G
en Poly * algorithm that does not require the inverse computation: - Algorithm:
- iter G
en Poly * - W←V0
- yield Z
- for i from 1 to m−1 do
- W←W×H
- W←W−W[0]×V0
- yield W×Z V0 −1
- endfor
- enditer
- In general, the above and other forms of G
en Poly * have the following common characteristics: multiplication by a function of the generator of the polynomial basis, e.g., H; generation of a coefficient, e.g., T[0]; and subtraction of a function of the coefficient from one of the loop variables. The ordering and specifics of these steps may vary in accordance with implementation preference, for instance to simplify one of the steps or to introduce parallelism. Initial values of loop variables will vary correspondingly. The examples of Gen Poly * given above illustrate some of the possible orderings and specifics. - 2.1.1 Importing from a Polynomial* Basis by Generate-Accumulate
- One application of the above-described G
en Poly * algorithm is in the Generate-Accumulate method for importing from a polynomial* basis. - Input:
- B[0], . . . , B[m−1], the external representation to be converted.
- Output:
- A, the corresponding internal representation.
- Parameters:
- Any required for G
en Poly *. - Constants:
- Z, the internal representation of the scaling factor, and any constants required for G
en Poly *. - Algorithm:
- proc I
mport Poly *By Gen Accum - A←0
- i←0
- for W in G
en Poly *(Z) do - A←A+B[i]×W
- i←i+1
- endfor
- endproc
- The I
mport Poly *By Gen Accum algorithm may be implemented using the basis converter of FIG. 1. - 2.1.2 Exporting to a Polynomial Basis by Generate*-Evaluate
- The algorithm E
xport Poly By Gen *Eval converts from an internal representation to an external representation in a polynomial basis over the same ground field, primarily with internal-basis operations, and using information largely about the dual of the external basis rather than information about the external basis itself. - Input:
- A, the internal representation to be converted.
- Output:
- B[0], . . . , B[m−1], the corresponding external representation.
- Parameters:
- Any required for G
en Poly *. - Constants:
- V0, the element such that if T=A×V0, T[0]=B[0], and any constants required for G
en Poly *. - Algorithm:
- proc E
xport Poly By Gen *Eval - A←A×V0
- i←0
- for T in G
en Poly *(A) do - B[i]←T[0]
- i←i+1
- endfor
- endproc
- The above version of the E
xport Poly By Gen *Eval algorithm may be implemented using the basis converter of FIG. 3B. This is generally the most efficient version; it makes two shortcuts which are not essential to the efficiency of the technique. First, it uses the polynomial* basis corresponding to the linear function x0, defined by x0(A)=A[0], where A is an internal basis representation; this is easy to evaluate, and results in the Z value being V0. Second, Gen Poly * is passed the value A so that it is not necessary to multiply the result of Gen Poly * by A in an extra step. The algorithm is still efficient without either of these shortcuts. The following is a basic form of the algorithm. - Algorithm:
- proc E
xport Poly By Gen *Eval - i←0
- for W in G
en Poly *(Z) do - B[i]←h(W×A)
- i←i+1
- endfor
- endproc
- This version of the E
xport Poly By Gen *Eval algorithm may be implemented using the basis converter of FIG. 3A. Here, h is the linear function corresponding to Z. It should be noted that in practice, Export Poly as described in U.S. application Ser. No. 08/851,045 is likely to be more efficient. However, if Gen Poly * is already available in an implementation, there may be an advantage to choosing this approach. - 2.2 Efficient External Shifting
- With knowledge of the formula for a polynomial* basis, a method for shifting an element's representation in the polynomial* basis can also be derived. The algorithm uses the recursive formula for generating ξi from ξi−1. To prove that this is correct, it is sufficient to show that applying the formula to ξm−1 yields 0. This shifting method works for basis elements, since it simply applies the recursive formula r(ε)=εγ−1−h0(εγ−1) to get all the successive elements.
- To prove the above claim, repeated applications of the formula to the
identity element 1, and their representations in the polynomial basis, will be considered. Recall that since ξ0 is 1, these various terms are the ξi. Also recall that if the 1-coefficient of ε written in the polynomial basis is 0, multiplying ε by γ−1 performs a shifting operation. That is, if - ε=B[1]γ+B[2]γ2 + . . . +B[m−1]γm−1, then εγ−1 =B[1]+B[2]γ1 + . . . +B[m−1]γm−2.
- First, ξ0 has a nonzero 1-coefficient, but none of the other ξi does. Second, notice that ξ1=γ−1−h0(γ−1), so ξ1 has a zero 1-coefficient. After ξ1, each application of the recursive formula performs a shifting-like operation in the polynomial basis, so one more of the coefficients is 0 after each application. So, after m−1 more applications of the recursive formula, the result is ξm−1γ−1−h0(ξm−1γ−1),which must be zero. But if the recursive formula is applied to ξm−1, the result is
- ξm−1γ−1 −h 0(ξm−1γ−1)=0.
- Now the technique for shifting in the polynomial* basis will be demonstrated. Let ε be any element.
- ε=B[0]η0 +B[1]η1 + . . . +B[m−1]ηm−1
- ζε=B[0]ξ0 +B[1]ξ1 + . . . +B[m−1]ξm−1
- r(ζε)=B[0]ξ1 +B[1]ξ2 + . . . +B[m−2]ξm−1 +B[m−1]0
- ζ−1 r(ζε)=B[0]η1 +B[1]η2 + . . . +B[m−2]ηm−1
- Thus, if ε is an element, then ζ−1r(ζε)=εγ−1−ζ−1h0(ζεγ−1) is ε shifted in the polynomial* basis. It should be noted that, in addition to shifting in one direction, it is also possible to shift on the other direction, or to rotate. For example, a formula implementing a right rotate operation for the polynomial* basis is given by:
- εγ−1−ζ−1h0(ζεγ−1)+ζ−1ξ0h0(ζεγm−1).
- The following is an algorithm for shifting in the polynomial* basis, based on the above-described shifting technique.
- Input/Output:
- A, the internal representation of the element to be shifted.
- Parameters:
- m, the degree of the finite field.
- Constants:
- YH, the internal representation of ζγ−1,
- I, the internal representation of the identity element,
- V0, the internal representation of the element such that if T=A×V0, T[0]=h0(A),
- Z, the internal representation of the scaling factor.
- Algorithm:
- proc S
hift Poly * - A←A×YH
- T←A×V0
- A←A−T[0]×I
- A←A×Z
- endproc
- Another variation of this algorithm which does not require the constant I is the following:
- Algorithm:
- proc S
hift Poly * - A←A×YH
- T←A×V0
- T←T[0]×Z
- A←A×Z
- A←A−T
- endproc
- A further variation of the S
hift Poly * algorithm is as follows: - Algorithm:
- proc S
hift Poly * - A←A×YH
- T←A×V0
- A←A×Z
- A←A−T[0]×Z
- endproc
- Another variation of the S
hift Poly * algorithm which saves one additional multiplication is the following: - Algorithm:
- proc S
hift Poly * - T←A×V0YH
- A←A×H
- A←A−T[0]×Z
- endproc
- FIG. 6 shows a polynomial* basis external shifter which implements the above-described procedure S
hift Poly *. Aninternal basis representation 42 is first multiplied in themultiplier 43 with the value YH. From this ascalar subtractor 47 subtracts a value obtained by multiplying this value by V0 (in a multiplier 44) and extracting the 1-coefficient (in a coefficient selector 45). Finally, this value is multiplied in amultiplier 48 by Z. The output ofmultiplier 48 is a shiftedinternal basis representation 49. As above, Z is the scaling factor, Y is the inverse of the scaling factor, H is the internal representation of γ−1, and V0 is the element such that (A×V0)[0]=h0(A) in the internal basis, where A is an internal representation and B is its corresponding external representation. If this external shifter is to be implemented for the canonical polynomial* basis, then Z=I and YH=H, and the multiplication inmultiplier 48 may be suppressed. - It should also be noted that S
hift Poly * can be used to make a new version of Gen Poly *: - Algorithm:
- iter G
en Poly *By Shift - T←Z
- yield T
- for i from 1 to m−1 do
- S
hift Poly *(T) - yield T
- endfor
- enditer
- The algorithms G
en Poly * and Gen Poly *By Shift are similar in efficiency. Any of the algorithms using Gen Poly * would also work with Gen Poly *By Shift instead. Gen Poly *By Shift , as presented above, assumes that the scaling factor is the same in the dual basis being generated as in the shifter, but it is straightforward to adapt a shifter for a different scaling factor by multiplying the outputs of the shifter by a ratio of scaling factors. - FIG. 7 shows an alternative polynomial* basis generator which implements the above-described G
en Poly *By Shift algorithm. A scaling factor 50 (Z, which is the same as the scaling factor Z used in an external shifter 52) is stored in aregister 51, whose contents are yielded initially and for each iteration of a loopingmechanism 54. For each successive result, the contents ofregister 51 are shifted by theexternal shifter 52. The results are polynomial*basis elements 53, which may be scaled by an additional multiplication. The alternative basis generator of FIG. 7 could be used in any basis conversion application in which the basis generator shown in FIG. 5 could be used. Theexternal shifter 52 could be, for example, the external shifter shown in FIG. 6. - It should be noted that in a case in which YH=I, the first multiplication may be suppressed (and the last multiplication is by H) and in a case in which Z=I, the last multiplication may be suppressed. Various straightforward rearrangements of S
hift Poly * can be made to accommodate these and other similar situations. - Similar to G
en Poly *, the above and other forms of Shift Poly * have the common characteristics of multiplication by a function of the generator of the polynomial basis, generation of a coefficient, and subtraction of a function of the coefficient from one of the loop variables. Additional scaling of a value may also be included. Again, the ordering and specifics of these steps may vary in accordance with implementation preference, and the examples of Shift Poly * given above illustrate some of the possible orderings and specifics. It should be noted that many of the approaches given for Gen Poly * are also applicable to Shift Poly *, and vice-versa. - 2.2.1 Importing from a Polynomial* Basis by Shift-Insert
- The algorithm I
mport Poly *By Shift Insert converts from a polynomial*-basis representation to an internal representation over the same ground field, primarily with internal-basis operations. - Input:
- B[0], . . . , B[m−1], the external representation to be converted.
- Output:
- A, the corresponding internal representation.
- Parameters:
- m, the degree of the finite field, and any required for S
hift Poly *. - Constants:
- Z, the internal representation of the scaling factor, and any other constants required for S
hift Poly *. - Algorithm:
- proc I
mport Poly *By Shift Insert - A←B[m−1]×Z
- for i from m−2 downto 0 do
- S
hift Poly *(A) - A←A+B[i]×Z
- endfor
- endproc
- The algorithm I
mport Poly *By Shift Insert may be implemented using the basis converter of FIG. 2A. - A possible improvement on this algorithm is to insert multiple coefficients per iteration, as in the basis converter of FIG. 2B. If the value V, the internal representation of ηm/2, were precomputed, assuming without loss of generality that m is even, the algorithm could be run this way:
- Algorithm:
- proc I
mport Poly *By Shift Insert - A←B[m−1]×Z
- A←A+B[(m/2)−1]×V
- for i from m−2 downto (m/2) do
- S
hift Poly *(A) - A←A+B[i]×Z
- A←A+B[i−(m/2)]×V
- endfor
- endproc
- This reduces the number of external shifts by a factor of 2. A similar improvement can be made with a factor of k, as mentioned previously, using the basis converter of FIG. 2B.
- Another version of the I
mport Poly *By Shift Insert algorithm is as follows: - Algorithm:
- proc I
mport Poly *By Shift Insert - A←0
- for i from m−1 downto (m/2) do
- S
hift Poly *(A) - A←A+B[i]×Z
- A←A+B[i−(m/2)]×V
- endfor
- endproc
- In this version of the algorithm, the loop is started at m−1 in order to reduce the number of statements in the algorithm.
- 2.2.2 Exporting to a Polynomial* Basis by Shift-Extract
- The algorithm E
xport Poly *By Shift Extract converts from an internal representation to an external representation in a dual basis of a polynomial basis over the same ground field, primarily with internal-basis operations. - Input:
- A, the internal representation to be converted.
- Output:
- B[0], . . . , B[m−1], the corresponding external representation.
- Parameters:
- m, the degree of the finite field, and any required for S
hift Poly *. - Constants:
- Vm−1, an element such that if T=A×Vm−1, T[0]=B[m−1], and any constants required for S
hift Poly *. - Algorithm:
- proc E
xport Poly *By Shift Extract - for i from m−1 downto 0 do
- T←A×Vm−1
- B[i]←T[0]
- S
hift Poly *(A) - endfor
- endproc
- The algorithm E
xport Poly *By Shift Extract may be implemented using the basis converter of FIG. 4A. This algorithm can be made more efficient by computing multiple coefficients at once and inserting them, as in the basis converter of FIG. 4B. That is, suppose m is divisible by 2 and Vm/2−1 is the element such that if T=A×Vm/2−1, T[0]=B[m/2−1], then the following algorithm also works. - Algorithm:
- proc E
xport Poly *By Shift Extract - for i from m−1 downto m/2 do
- T←A×Vm−1
- B[i]←T[0]
- T←A×Vm/2−1
- B[i−m/2]←T[0]
- S
hift Poly *(A) - endfor
- endproc
- This is more efficient, since in the second version of the algorithm, there are half as many shifts as in the first version. A similar improvement can be made with a factor of k, as mentioned previously, using the basis converter of FIG. 4B. Another version of the algorithm may be implemented by excluding the shift the last time through the loop.
- Let γ, . . . , γq
m−1 be a normal basis for GF(qm), and let h(x) be a linear function from GF(qm) to GF(q). Let h0(x) be the linear function whose output is the γ-coefficient of x when x is written in the normal basis, where the term “γ-coefficient” denotes the coefficient of the first basis element. Furthermore, let ζ be such that h0(xζ)=h(x). Again, we let ξ0, ξ1, . . . , ξm−1 denote the canonical dual basis and η0, η1, . . . , ηm−1 denote a dual basis. A formula for the dual basis (i.e., the normal* basis) of the above-described normal basis with respect to h is: - η0=ζ1ξ0, η1=ζ−1ξ1, . . . , ηm−1=ζ−1ξm−1
- where ξ0=1, ξ1=σ(q
i −1)/(q−1) and σ is an element such that h0(σγq)=1 and h0(σγqi )=0 for i≠1. When h=h0, ζ=1, and η0, η1, . . . , ηm−1 equals ξ0, ξ1, . . . , ξm−1 and is called the canonical normal* basis. The element σ is referred to below as the normal* basis generator. To prove that the above dual basis formula is correct, one can use the dual basis property and induction. First, - h(ζ1γ)=h 0(γ)=1, and
- h(ζ1γq
i )=h 0(γqi )=0 for j≠0. - To establish the induction, one need only recall the simple result that raising an element ε to the qth power performs a shifting operation in the normal basis. Thus, h0(ε)=h1(εq) where h1(ε) is the γq-coefficient of ε written in the normal basis. Now, suppose that each term up to the term given by ζ−1ξi−1=ζ−1σ(q
i−1 −1)/(q−1) satisfies the appropriate dual basis property. Then the same can be derived for i by the following: - γq
i ζ−1ξi=γqi ζ−1σ(qi −1)/(q−1)=ζ1σ(γqi−1 σ(qi−1 −1)/(q−1))q=ζ1σ(γqi−1 ξi−1)q. - Now, by the definition of σ, h(ζ1σε)=h0(σε)=h1(ε), so
- h(ζ1σ(γq
i−1 ξi−1)=h 1((γqi−1 ξi−1)q)=h 0(γqi−1 ξi−1)=1. - With a similar derivation, it follows that
- h(ζ1σ(γq
i−1 ξi−1)q)=h 0(γqi−1 ξi−1)=0 for i≠j. - This establishes the correctness of the formula for the dual basis and also gives a recursion formula: ξi=σ(ξi−1)q, where ξi is the ith element of the canonical normal* basis. In the following algorithms, G will be the internal representation of γ, S will be the internal representation of σ, and Z will be the internal representation of ζ−1. The value Z corresponds to the function h(ε)=h0(ζε), and contains the information specific to the choice of dual basis in the following algorithms. Note that if Z is 0, h(ε)=h0(0)=0, and therefore, h would not be a suitable linear function. However, it may be useful in some applications to have Z=0. As noted previously, Z is referred to herein as the scaling factor.
- 3.1 Efficient Basis Generation
- The following algorithm illustrates a technique for efficiently generating the dual of a normal basis in accordance with the invention.
- Input:
- Z, a scaling factor.
- Output:
- W0, . . . , Wm−1, the canonical normal* basis multiplied by Z.
- Parameters:
- m, the degree of the finite field; q, the order of the ground field GF(q).
- Constants:
- S, the internal representation of the normal* basis generator.
- Algorithm:
- iter G
en Normal * - T←Z
- W←S
- yield T
- for i from 1 to m−1 do
- T←T×W
- W←Wq
- yield T
- endfor
- enditer
- Typically, Z will be the internal representation of the scaling factor. However, sometimes one may wish to use a value 0 for Z, which does not correspond to any linear function. If Z does correspond to a linear function, the output is the normal* basis with respect to the linear function corresponding to Z. In all cases, the output is the canonical normal* basis scaled by Z, and in the case that Z=0, the output will always be zero. Assuming Z is nonzero, the following establishes the correctness of the algorithm. After the first iteration, G
en Normal * outputs the internal representation of ζ−1. At each successive step, the basis is multiplied by successively higher powers of q of σ, resulting in ζ−1, ζ−1σ, ζ−1σq+1, ζ−1σq2 +1, and so on. By the above-described formula, this is the correct list of normal* basis elements. - FIG. 8 shows a normal* basis generator which implements the above-described iterator G
en Normal *. Aregister 57 stores one temporary variable, W, initialized to S, the internal representation of σ. Aregister 56 stores another temporary variable, T, initialized to Z, the scalingfactor 55. At each iteration of a loopingmechanism 60, the product T×W calculated by amultiplier 58 is output as a scaled normal* basis element. Then, the product is stored as the new value of theregister 56, and the value of theregister 57 is replaced by Wq, calculated by an exponentiator 59 (q is the order of the ground field). The results are the scaled normal*basis elements 61. - Other forms of G
en Normal * may be readily constructed in accordance with the invention. For example, the following alternate algorithm may be used: - Algorithm:
- iter G
en Normal * - W←U
- yield W×ZU−1 (i.e., yield Z)
- for i from 1 to m−1 do
- W←Wq
- yield W×ZU−1
- endfor
- enditer
- In this alternate algorithm, U is a (q−1)st root of S, and there are q−1 such roots. Such a root exists since S(q
m −1)/(q−1)=I, and can be found by conventional root-finding techniques. This alternate algorithm has the property that it involves the same sequence of steps in the loop (ignoring the yield) as the exemplary normal-basis shifter described in U.S. application Ser. No. 08/851,045 (i.e., an exponentiator), which may provide benefits in terms of sharing of computational logic. - In general, the above and other forms of G
en Normal * have the following common characteristics: exponentiation of a loop variable, and scaling of a value before it is yielded or multiplication of a loop variable by a previously-yielded value before a new one is needed. The ordering and specifics of these steps may vary in accordance with implementation preference; initial values of loop variables will vary correspondingly. The examples of Gen Normal * given above illustrate some of the possible orderings and specifics. - 3.1.1 Importing from a Normal* Basis by Generate-Accumulate
- The algorithm I
mport Normal *By Gen Accum converts from a normal*-basis representation to an internal representation over the same ground field, primarily with internal-basis operations. - Input:
- B[0], . . . , B[m−1], the external representation to be converted.
- Output:
- A, the corresponding internal representation.
- Parameters:
- Any required for G
en Normal *. - Constants:
- Z, the internal basis representation of the scaling factor, and any other constants required for G
en Normal *. - Algorithm:
- proc I
mport Normal *By Gen Accum - A←0
- i←0
- for W in G
en Normal *(Z) do - A←A+B[i]×W
- i←i+1
- endfor
- endproc
- The I
mport Normal *By Gen Accum algorithm may be implemented using the basis converter of FIG. 1. - 3.1.2 Exporting to a Normal Basis by Generate*-Evaluate
- The algorithm E
xport Normal By Gen *Eval converts from an internal representation to an external representation in a normal basis over the same ground field, primarily with internal-basis operations, and using information largely about the dual of the external basis rather than information about the external basis itself. - Input:
- A, the internal representation to be converted.
- Output:
- B[0], . . . , B[m−1], the corresponding external representation.
- Parameters:
- Any required for G
en Normal *. - Constants:
- V0, the internal representation of the element such that if T=A×V0, T[0]=B[0], and any constants required for G
en Normal *. - Algorithm:
- proc E
xport Normal By Gen *Eval - A←A×V0
- i←0
- for T in G
en Normal *(A) do - B[i]←T[0]
- i←i+1
- endfor
- endproc
- The above version of the E
xport Normal By Gen *Eval algorithm may be implemented using the basis converter of FIG. 3B. This is generally the most efficient version; it makes two shortcuts which are not essential to the efficiency of the technique. First, it uses the normal* basis corresponding to the linear function x0, defined by x0(A)=A[0], where A is an internal basis representation; this is easy to evaluate, and results in the Z value being V0. Second, the value A is passed to Gen Normal * so as to avoid multiplying the result of Gen Normal * by A in an extra step. The algorithm is still efficient without either of these shortcuts. The following is a basic form of the algorithm. - Algorithm:
- proc E
xport Normal By Gen *Eval - i←0
- for W in G
en Normal *(Z) do - B[i]←h(W×A)
- i←i+1
- endfor
- endproc
- This version of the E
xport Normal By Gen *Eval algorithm may be implemented using the basis converter of FIG. 3A. Here, h is the linear function corresponding to Z. It should be noted that in practice, Export Normal as described in the U.S. application Ser. No. 08/851,045 is likely to be more efficient. However, if Gen Normal * is already available in an implementation, there may be an advantage to choosing this approach. Furthermore, the algorithm Export Normal * as described in U.S. application Ser. No. 08/851,045 takes substantially the same approach as Export Normal By Gen *Eval , but the latter is presented here for completeness. - 3.2 Efficient External Shifting
- The present invention also provides an efficient method for shifting (e.g., doing a rotation) of an element's representation in the normal* basis. A claim that may be desirable to prove is that ξm=σ(q
m −1)/(q−1)=1. First, applying analysis similar to that by which ξ0, ξ1, . . . , ξm−1 were shown to be correct normal* basis elements, σ(σ(qm−1 −1)/(q−1))q=σ(qm −1)/(q−1)=ξm, and so - By definition of the dual basis, the sequence of values output by h0 as i varies forms the coefficients of ξm=σ(q
m −1)/(q−1) in the canonical normal* representation. The only nonzero output occurs for i=m, so ξm=σ(qm −1)/(q−1)=1=ξ0. (The output is the same for i=m as i=0 since γqm =γ.) - The following demonstrates the technique for shifting in the normal* basis.
- ε=B[0]η0 + . . . +B[m−2]ηm−2 +B[m−1]ηm−1
- ζε=B[0]ξ0 + . . . +B[m−2]ξm−2 +B[m−1]ξm−1
- σ(ζε)q =B[m−1]ξ0 +B[0]ξ1 + . . . +B[m−2]ξm−1
- ζ−1σ(ζε)q =B[m−1]η0 +B[0]η1 + . . . +B[m−2]ηm−1
- Another way to compute ζ−1σ(ζε)q is to compute ζq−1σεq. This provides a general technique for shifting in a normal* basis. Based on this, the algorithm S
hift Normal * is given as follows. - Input/Output:
- A, the internal representation to be shifted.
- Parameters:
- m, the degree of the finite field; q, the order of the ground field.
- Constants:
- SZ1−q where S is the internal representation of σ and Z is the internal representation of ζ−1, i.e., SZ1−q is the internal representation of ζq−1σ.
- Algorithm:
- proc S
hift Normal * - A←Aq
- A←A×SZ1−q
- endproc
- FIG. 9 shows a normal* basis external shifter which implements the procedure S
hift Normal *. Aninternal basis representation 61 is first raised to the power q (q, the order of the finite field, is a parameter) in anexponentiator 62, and is then multiplied by SZ1−q in amultiplier 63, where S is the internal representation of σ, and Z is the scaling factor. Theresult 64 is the shifted internal representation. - It should also be noted that S
hift Normal * can be used to make a new version of Gen Normal *. - Algorithm:
- iter G
en Normal *By Shift - T←Z
- yield T
- for i from 1 to m−1 do
- S
hift Normal *(Y) - yield T
- endfor
- enditer
- The algorithms G
en Normal * and Gen Normal *By Shift are similar in efficiency, and selection of one or the other involves a tradeoff between number of variables and parellelizability. Any of the algorithms using Gen Normal * would also work with Gen Normal *By Shift instead. Gen Normal *By Shift , as presented above, assumes that the scaling factor is the same in the dual basis being generated as in the shifter, but it is straightforward to adapt a shifter for a different scaling factor by multiplying the outputs of the shifter by a ratio of scaling factors. - FIG. 10 shows an alternative normal* basis generator which implements the iterator G
en Normal *By Shift . Its structure is exactly the analog of the structure of Gen Poly *By Shift . A scalingfactor 65 is stored in aregister 66, whose contents are yielded initially and for each iteration of a loopingmechanism 68. For each successive result, the contents of theregister 66 are shifted by anexternal shifter 67. The results are the normal* basis elements 69, and may be scaled by an additional multiplication. The basis generator of FIG. 10 could be used in any basis conversion application in which the basis converter of FIG. 8 could be used. Theexternal shifter 68 could be, for example, the external shifter shown in FIG. 9. - FIG. 11 shows an alternative external basis shifter which implements an alternative version of S
hift Normal *. This external shifter computes AqSZ1−q by first multiplying A by Z−1 using amultiplier 71, then raising the result to the qth power using anexponentiator 72, and finally, multiplying that result by SZ, using amultiplier 73. - It should be noted that in a case in which SZ1−q=I, the multiplication in the original version of S
hift Normal * given above may be suppressed, and if SZ=I, the multiplication may be suppressed in the above-noted alternative version of Shift Normal *. In this case, Z−1=S, so the first multiplication is by S. Moreover, the multiplication may be carried out in other ways in any case. It may, for example, be performed only before the exponentiation, e.g., by multiplying by a qth root of SZ1−q. - In general, the above and other forms of S
hift Normal * have the common characteristics of exponentiation and multiplication by a function of the generator of the dual basis, e.g., S. Multiplication by a function of a scaling factor may also be included. The ordering and specifics of these steps may vary in accordance with implementation preference, and the examples of Shift Normal * given above illustrate some of the possible orderings and specifics. Inasmuch as a version of Gen Normal * can be constructed from Shift Normal *, many of the approaches given above for Shift Normal * can be applied to Gen Normal * as well. - 3.2.1 Importing from a Normal* Basis by Shift-Insert
- The algorithm I
mport Normal *By Shift Insert converts from a normal*-basis representation to an internal representation over the same ground field, primarily with internal-basis operations. - Input:
- B[0], . . . , B[m−1], the external representation to be converted.
- Output:
- A, the corresponding internal representation
- Parameters:
- m, the degree of the finite field.
- Constants:
- Z, the internal representation of the scaling factor, and any other constants required for S
hift Normal *. - Algorithm:
- proc I
mport Normal *By Shift Insert - A←B[m−1]×Z
- for i from m−2 downto 0 do
- S
hift Normal *(A) - A←A+B[i]×Z
- endfor
- endproc
- The algorithm I
mport Normal *By Shift Insert may be implemented using the basis converter of FIG. 2A. The algorithm works by inserting one coefficient into the internal representation, externally rotating the internal representation to make space for another coefficient, and repeating. An improvement on this algorithm is to insert multiple coefficients per iteration, as in the basis converter of FIG. 2B. If the value V=ZS(qm/2 −1)/(q−1), the internal representation of ηm/2, were precomputed, assuming without loss of generality that m is even, the algorithm could be run this way: - Algorithm:
- proc I
mport Normal *By Shift Insert - A←B[m−1]×Z
- A←A+B[(m/2)−1]×V
- for i from m−2 downto m/2 do
- S
hift Normal *(A) - A←A+B[i]×Z
- A←A+B[i−(m/2)]×V
- endfor
- endproc
- This second version reduces the number of external shifts by a factor of 2. A similar improvement can be made with a factor of k, as mentioned previously, using the basis converter of FIG. 2B.
- Another version of the I
mport Normal *By Shift Insert algorithm is as follows: - Algorithm:
- proc I
mport Normal *By Shift Insert - A←0
- for i from m−1 downto (m/2) do
- S
hift Normal * (A) - A←A+B[i]×Z
- A←A+B[i−(m/2)]×V
- endfor
- endproc
- In this version of the algorithm, the loop is started at m−1 in order to reduce the number of statements in the algorithm.
- 3.2.2 Exporting to a Normal* Basis by Shift-Extract
- The algorithm E
xport Normal *By Shift Extract converts from an internal representation to an external representation in a dual basis of a normal basis over the same ground field, primarily with internal-basis operations. - Input:
- A, the internal representation to be converted.
- Output:
- B[0], . . . , B[m−1], the corresponding external representation.
- Parameters:
- m, the degree of the finite field, and any parameters required for S
hift Normal *. - Constants:
- Vm−1, an element such that if T=A×Vm−1, T[0]=B[m−1], and any constants required for S
hift Normal *. - Algorithm:
- proc E
xport Normal *By Shift Extract - for i from m−1 downto 0 do
- T←A×Vm−1
- B[i]←T[0]
- S
hift Normal *(A) - endfor
- endproc
- The algorithm E
xport Normal *By Shift Extract may be implemented using the basis converter of FIG. 4A. The algorithm works by successively extracting a coefficient from the external representation and rotating the external representation. This algorithm can be made more efficient by computing multiple coefficients at once and inserting them, as in the basis converter of FIG. 4B. That is, suppose m is divisible by 2, and Vm/2−1 is the element such that if T=A×Vm/2−1, T[0]=B[m/2−1], then this algorithm also works: - Algorithm:
- proc E
xport Normal *By Shift Extract - for i from m−1 downto m/2 do
- T←A×Vm−1
- B[i]←T[0]
- T←A×Vm/2−1
- B[i−m/2]←T[0]
- S
hift Normal *(A) - endfor
- endproc
- This is more efficient, since in the second version of the algorithm, there are half as many shifts as in the first version. A similar improvement can be made with a factor of k, as mentioned previously, using the basis converter of FIG. 4B. Another version of the algorithm may be implemented by excluding the shift the last time through the loop.
- It should be noted that the algorithms described above may be extended to the case in which the internal and external basis have different ground fields, as described in U.S. application Ser. No. 08/851,045. For example, if a ground field is represented in terms of polynomial* or normal* basis, the techniques described in U.S. application Ser. No. 08/851,045 can be applied to process subcoefficients during import and/or export operations.
- The basis converters described herein may be implemented in the form of a processor which operates in conjunction with a memory to control the processing operations of the basis converter. The processor and memory may be part of a user terminal in a cryptographic system such as those to be described in conjunction with FIGS. 12A and 12B below. The processor and memory may be implemented in a personal desktop or portable computer, a microcomputer, a mainframe computer, a workstation, telephone, facsimile machine, television set top box or any other type of processing or communications terminal or device. The processor may be a microprocessor, central processing unit (CPU), application-specific integrated circuit (ASIC) or any other suitable digital data processor. The basis converter and the elements thereof may be configured as software modules executed by the processor, as separate dedicated hardware modules, or as various combinations of software and hardware.
- The basis conversion techniques of the present invention can be implemented in a wide variety of cryptographic applications such as, for example, the applications described in U.S. application Ser. No. 08/851,045. The techniques of the present invention are particularly well suited for use in cryptographic applications which make use of elliptic curve cryptosystems and/or finite field arithmetic. Moreover, because the invention provides basis conversion techniques which require relatively little storage capacity as compared to conventional techniques, the invention is also well suited for use in memory-limited cryptographic applications.
- FIG. 12A shows a
communication system 100 in which user identification or digital signature techniques utilizing basis conversion in accordance with the invention may be implemented. Thesystem 100 is configured in the manner described in U.S. patent application Ser. No. 08/954,712 filed Oct. 20, 1997 and entitled “Secure User Identification Based on Constrained Polynomials,” which is incorporated by reference herein. Although the illustrative user identification and digital signature techniques described in application Ser. No. 08/954,712 did not make use of basis conversion, other similar techniques may be configured to utilize basis conversion. - The
system 100 includes a number of different users 112-i, i=1, 2, . . . N, which communicate with each other via acommunication network 114. The users 112-i may represent personal desktop or portable computers, microcomputers, mainframe computers, workstations, telephones, facsimile machines, personal communication devices, digital notepads, television set top boxes or any other type of communication terminals in various combinations. Thecommunication network 114 may represent a global computer network such as the Internet, a wide area network (WAN), a local area network (LAN), a satellite network, a telephone or cable network, or various combinations of these and other types of networks. The network may operate using conventional data transfer techniques including but not limited to asynchronous transfer mode (ATM), synchronous optical network/synchronous digital hierarchy (SONET/SDH) and/or transmission control protocol/Internet protocol (TCP/IP). - A particular one of the users112-i in the
system 100 is designated in this illustration as a prover 112-1. The prover 112-1 includes aprocessor 116 bidirectionally coupled to amemory 118. Another of the users 112-i in system 110 is designated a verifier 112-2. The verifier 112-2 includes aprocessor 120 bidirectionally coupled to a memory 122. Theprocessors memories 118, 122 store intermediate results and other information used in the identification and digital signature techniques. It should be noted that in general any of the users 112-i of system 110 may be acting as either a prover or a verifier or both at any given time. For example, the user 112-2 may be verifying user 112-1 while also acting as a prover to another user 112-i and a verifier of yet another user 112-i. Theprocessors respective memories 118, 122 may be used to implement any of the basis conversion operations illustrated in FIGS. 1 through 11 and described in the previous sections. - FIG. 12B shows another exemplary cryptographic system in which the basis conversion techniques of the invention may be implemented. In this embodiment, a
prover 130 andverifier 132 are configured to communicate as shown. Theprover 130 includes aprocessor 134 and amemory 136, and theverifier 132 includes aprocessor 138 and amemory 140. Theprover 130 may be implemented as a smart card, while theverifier 132 is a processing terminal with a card reader designed to receive the smart card. The interconnection between theprover 130 and theverifier 132 in FIG. 12B may therefore represent a temporary interconnection which is present when a smart card is inserted into a card reader. User identification and digital signature techniques similar to those described in U.S. application Ser. No. 08/954,712, as well as many other types of cryptographic techniques, may utilize the basis conversion operations of the present invention. Theprocessors respective memories - It should be emphasized that the basis conversion techniques described herein are exemplary and should not be construed as limiting the present invention to any particular embodiment or group of embodiments. Numerous alternative embodiments within the scope of the appended claims will be readily apparent to those skilled in the art.
Claims (50)
Priority Applications (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
US09/919,664 US20010056452A1 (en) | 1997-11-18 | 2001-07-31 | Efficient finite field basis conversion involving a dual basis |
Applications Claiming Priority (3)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
US6693797P | 1997-11-18 | 1997-11-18 | |
US09/195,346 US6286022B1 (en) | 1997-11-18 | 1998-11-18 | Efficient finite field basis conversion involving a dual basis |
US09/919,664 US20010056452A1 (en) | 1997-11-18 | 2001-07-31 | Efficient finite field basis conversion involving a dual basis |
Related Parent Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
US09/195,346 Continuation US6286022B1 (en) | 1997-11-18 | 1998-11-18 | Efficient finite field basis conversion involving a dual basis |
Publications (1)
Publication Number | Publication Date |
---|---|
US20010056452A1 true US20010056452A1 (en) | 2001-12-27 |
Family
ID=26747317
Family Applications (2)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
US09/195,346 Expired - Lifetime US6286022B1 (en) | 1997-11-18 | 1998-11-18 | Efficient finite field basis conversion involving a dual basis |
US09/919,664 Abandoned US20010056452A1 (en) | 1997-11-18 | 2001-07-31 | Efficient finite field basis conversion involving a dual basis |
Family Applications Before (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
US09/195,346 Expired - Lifetime US6286022B1 (en) | 1997-11-18 | 1998-11-18 | Efficient finite field basis conversion involving a dual basis |
Country Status (1)
Country | Link |
---|---|
US (2) | US6286022B1 (en) |
Cited By (3)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US20030135530A1 (en) * | 2001-09-20 | 2003-07-17 | Stmicroelectronics, Inc. | Flexible galois field multiplier |
US20040098437A1 (en) * | 2002-11-09 | 2004-05-20 | Weon-Il Jin | Method and apparatus for basis conversion in finite field |
US20090279693A1 (en) * | 2006-04-10 | 2009-11-12 | France Telecom | Method and a device for generating a pseudorandom string |
Families Citing this family (125)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CA2263056C (en) | 1999-02-26 | 2009-04-28 | Certicom Corp. | Method and apparatus for finite field basis conversion |
CA2265389C (en) * | 1999-03-12 | 2011-07-12 | Certicom Corp. | System and method for efficient basis conversion |
US6959085B1 (en) * | 1999-05-03 | 2005-10-25 | Ntru Cryptosystems, Inc. | Secure user identification based on ring homomorphisms |
US6662346B1 (en) | 2001-10-03 | 2003-12-09 | Marvell International, Ltd. | Method and apparatus for reducing power dissipation in finite field arithmetic circuits |
US8528078B2 (en) * | 2004-07-15 | 2013-09-03 | Anakam, Inc. | System and method for blocking unauthorized network log in using stolen password |
US8296562B2 (en) * | 2004-07-15 | 2012-10-23 | Anakam, Inc. | Out of band system and method for authentication |
US8533791B2 (en) | 2004-07-15 | 2013-09-10 | Anakam, Inc. | System and method for second factor authentication services |
ES2420158T3 (en) * | 2004-07-15 | 2013-08-22 | Anakam, Inc. | System and method to block an unauthorized network login using a stolen password |
US7676834B2 (en) * | 2004-07-15 | 2010-03-09 | Anakam L.L.C. | System and method for blocking unauthorized network log in using stolen password |
US20100100967A1 (en) * | 2004-07-15 | 2010-04-22 | Douglas James E | Secure collaborative environment |
US8226001B1 (en) | 2010-06-23 | 2012-07-24 | Fiteq, Inc. | Method for broadcasting a magnetic stripe data packet from an electronic smart card |
US8684267B2 (en) | 2005-03-26 | 2014-04-01 | Privasys | Method for broadcasting a magnetic stripe data packet from an electronic smart card |
JP5186359B2 (en) | 2005-03-26 | 2013-04-17 | プリバシーズ,インコーポレイテッド | Electronic financial transaction card and method |
EP1882229B1 (en) * | 2005-04-27 | 2014-07-23 | Privasys, Inc. | Electronic cards and methods for making same |
US7793851B2 (en) | 2005-05-09 | 2010-09-14 | Dynamics Inc. | Dynamic credit card with magnetic stripe and embedded encoder and methods for using the same to provide a copy-proof credit card |
US8060750B2 (en) * | 2007-06-29 | 2011-11-15 | Emc Corporation | Secure seed provisioning |
US8059814B1 (en) | 2007-09-28 | 2011-11-15 | Emc Corporation | Techniques for carrying out seed or key derivation |
US9010630B2 (en) | 2007-12-24 | 2015-04-21 | Dynamics Inc. | Systems and methods for programmable payment cards and devices with loyalty-based payment applications |
US8307210B1 (en) | 2008-05-02 | 2012-11-06 | Emc Corporation | Method and apparatus for secure validation of tokens |
US8579203B1 (en) | 2008-12-19 | 2013-11-12 | Dynamics Inc. | Electronic magnetic recorded media emulators in magnetic card devices |
US8931703B1 (en) | 2009-03-16 | 2015-01-13 | Dynamics Inc. | Payment cards and devices for displaying barcodes |
US9329619B1 (en) | 2009-04-06 | 2016-05-03 | Dynamics Inc. | Cards with power management |
US8622309B1 (en) | 2009-04-06 | 2014-01-07 | Dynamics Inc. | Payment cards and devices with budgets, parental controls, and virtual accounts |
US8590796B1 (en) | 2009-04-06 | 2013-11-26 | Dynamics Inc. | Cards having dynamic magnetic stripe communication devices fabricated from multiple boards |
US8393545B1 (en) | 2009-06-23 | 2013-03-12 | Dynamics Inc. | Cards deployed with inactivated products for activation |
US8511574B1 (en) | 2009-08-17 | 2013-08-20 | Dynamics Inc. | Advanced loyalty applications for powered cards and devices |
US9306666B1 (en) | 2009-10-08 | 2016-04-05 | Dynamics Inc. | Programming protocols for powered cards and devices |
US8727219B1 (en) | 2009-10-12 | 2014-05-20 | Dynamics Inc. | Magnetic stripe track signal having multiple communications channels |
US8523059B1 (en) | 2009-10-20 | 2013-09-03 | Dynamics Inc. | Advanced payment options for powered cards and devices |
US8393546B1 (en) | 2009-10-25 | 2013-03-12 | Dynamics Inc. | Games, prizes, and entertainment for powered cards and devices |
JP5866302B2 (en) | 2010-02-16 | 2016-02-17 | ダイナミックス インコーポレイテッド | System and method for drive circuit of dynamic magnetic stripe communication device |
US8348172B1 (en) | 2010-03-02 | 2013-01-08 | Dynamics Inc. | Systems and methods for detection mechanisms for magnetic cards and devices |
US10693263B1 (en) | 2010-03-16 | 2020-06-23 | Dynamics Inc. | Systems and methods for audio connectors for powered cards and devices |
AU2011255568A1 (en) | 2010-05-18 | 2012-12-06 | Dynamics Inc. | Systems and methods for cards and devices operable to communicate via light pulses and touch sensitive displays |
US8317103B1 (en) | 2010-06-23 | 2012-11-27 | FiTeq | Method for broadcasting a magnetic stripe data packet from an electronic smart card |
USD674013S1 (en) | 2010-07-02 | 2013-01-08 | Dynamics Inc. | Multiple button interactive electronic card with light sources |
USD672389S1 (en) | 2010-07-02 | 2012-12-11 | Dynamics Inc. | Multiple button interactive electronic card with light sources |
USD670759S1 (en) | 2010-07-02 | 2012-11-13 | Dynamics Inc. | Multiple button interactive electronic card with light sources |
USD652075S1 (en) | 2010-07-02 | 2012-01-10 | Dynamics Inc. | Multiple button interactive electronic card |
USD652449S1 (en) | 2010-07-02 | 2012-01-17 | Dynamics Inc. | Multiple button interactive electronic card |
USD652448S1 (en) | 2010-07-02 | 2012-01-17 | Dynamics Inc. | Multiple button interactive electronic card |
USD652867S1 (en) | 2010-07-02 | 2012-01-24 | Dynamics Inc. | Multiple button interactive electronic card |
USD687094S1 (en) | 2010-07-02 | 2013-07-30 | Dynamics Inc. | Multiple button interactive electronic card with light sources |
USD652076S1 (en) | 2010-07-09 | 2012-01-10 | Dynamics Inc. | Multiple button interactive electronic card with display |
USD651238S1 (en) | 2010-07-09 | 2011-12-27 | Dynamics Inc. | Interactive electronic card with display |
USD665447S1 (en) | 2010-07-09 | 2012-08-14 | Dynamics Inc. | Multiple button interactive electronic card with light source and display |
USD665022S1 (en) | 2010-07-09 | 2012-08-07 | Dynamics Inc. | Multiple button interactive electronic card with light source |
USD652450S1 (en) | 2010-07-09 | 2012-01-17 | Dynamics Inc. | Multiple button interactive electronic card |
USD792511S1 (en) | 2010-07-09 | 2017-07-18 | Dynamics Inc. | Display with font |
USD792513S1 (en) | 2010-07-09 | 2017-07-18 | Dynamics Inc. | Display with font |
USD653288S1 (en) | 2010-07-09 | 2012-01-31 | Dynamics Inc. | Multiple button interactive electronic card |
USD666241S1 (en) | 2010-07-09 | 2012-08-28 | Dynamics Inc. | Multiple button interactive electronic card with light source |
USD792512S1 (en) | 2010-07-09 | 2017-07-18 | Dynamics Inc. | Display with font |
USD651644S1 (en) | 2010-07-09 | 2012-01-03 | Dynamics Inc. | Interactive electronic card with display |
USD651237S1 (en) | 2010-07-09 | 2011-12-27 | Dynamics Inc. | Interactive electronic card with display |
USD643063S1 (en) | 2010-07-09 | 2011-08-09 | Dynamics Inc. | Interactive electronic card with display |
US8322623B1 (en) | 2010-07-26 | 2012-12-04 | Dynamics Inc. | Systems and methods for advanced card printing |
US9818125B2 (en) | 2011-02-16 | 2017-11-14 | Dynamics Inc. | Systems and methods for information exchange mechanisms for powered cards and devices |
US10055614B1 (en) | 2010-08-12 | 2018-08-21 | Dynamics Inc. | Systems and methods for advanced detection mechanisms for magnetic cards and devices |
US9053398B1 (en) | 2010-08-12 | 2015-06-09 | Dynamics Inc. | Passive detection mechanisms for magnetic cards and devices |
US10022884B1 (en) | 2010-10-15 | 2018-07-17 | Dynamics Inc. | Systems and methods for alignment techniques for magnetic cards and devices |
US8561894B1 (en) | 2010-10-20 | 2013-10-22 | Dynamics Inc. | Powered cards and devices designed, programmed, and deployed from a kiosk |
US9646240B1 (en) | 2010-11-05 | 2017-05-09 | Dynamics Inc. | Locking features for powered cards and devices |
US8567679B1 (en) | 2011-01-23 | 2013-10-29 | Dynamics Inc. | Cards and devices with embedded holograms |
US10095970B1 (en) | 2011-01-31 | 2018-10-09 | Dynamics Inc. | Cards including anti-skimming devices |
US9836680B1 (en) | 2011-03-03 | 2017-12-05 | Dynamics Inc. | Systems and methods for advanced communication mechanisms for magnetic cards and devices |
US8485446B1 (en) | 2011-03-28 | 2013-07-16 | Dynamics Inc. | Shielded magnetic stripe for magnetic cards and devices |
WO2012154915A1 (en) | 2011-05-10 | 2012-11-15 | Dynamics Inc. | Systems, devices, and methods for mobile payment acceptance, mobile authorizations, mobile wallets, and contactless communication mechanisms |
USD670329S1 (en) | 2011-05-12 | 2012-11-06 | Dynamics Inc. | Interactive display card |
USD670331S1 (en) | 2011-05-12 | 2012-11-06 | Dynamics Inc. | Interactive display card |
USD676904S1 (en) | 2011-05-12 | 2013-02-26 | Dynamics Inc. | Interactive display card |
USD670332S1 (en) | 2011-05-12 | 2012-11-06 | Dynamics Inc. | Interactive card |
USD670330S1 (en) | 2011-05-12 | 2012-11-06 | Dynamics Inc. | Interactive card |
US8628022B1 (en) | 2011-05-23 | 2014-01-14 | Dynamics Inc. | Systems and methods for sensor mechanisms for magnetic cards and devices |
US8827153B1 (en) | 2011-07-18 | 2014-09-09 | Dynamics Inc. | Systems and methods for waveform generation for dynamic magnetic stripe communications devices |
US11551046B1 (en) | 2011-10-19 | 2023-01-10 | Dynamics Inc. | Stacked dynamic magnetic stripe commmunications device for magnetic cards and devices |
US11409971B1 (en) | 2011-10-23 | 2022-08-09 | Dynamics Inc. | Programming and test modes for powered cards and devices |
US9619741B1 (en) | 2011-11-21 | 2017-04-11 | Dynamics Inc. | Systems and methods for synchronization mechanisms for magnetic cards and devices |
US8960545B1 (en) | 2011-11-21 | 2015-02-24 | Dynamics Inc. | Data modification for magnetic cards and devices |
US9064194B1 (en) | 2012-02-03 | 2015-06-23 | Dynamics Inc. | Systems and methods for spike suppression for dynamic magnetic stripe communications devices |
US9710745B1 (en) | 2012-02-09 | 2017-07-18 | Dynamics Inc. | Systems and methods for automated assembly of dynamic magnetic stripe communications devices |
US8888009B1 (en) | 2012-02-14 | 2014-11-18 | Dynamics Inc. | Systems and methods for extended stripe mechanisms for magnetic cards and devices |
US9916992B2 (en) | 2012-02-20 | 2018-03-13 | Dynamics Inc. | Systems and methods for flexible components for powered cards and devices |
US9734669B1 (en) | 2012-04-02 | 2017-08-15 | Dynamics Inc. | Cards, devices, systems, and methods for advanced payment game of skill and game of chance functionality |
US11961147B1 (en) | 2012-04-15 | 2024-04-16 | K. Shane Cupp | Cards, devices, systems, and methods for financial management services |
US11418483B1 (en) | 2012-04-19 | 2022-08-16 | Dynamics Inc. | Cards, devices, systems, and methods for zone-based network management |
US9033218B1 (en) | 2012-05-15 | 2015-05-19 | Dynamics Inc. | Cards, devices, systems, methods and dynamic security codes |
US9064195B2 (en) | 2012-06-29 | 2015-06-23 | Dynamics Inc. | Multiple layer card circuit boards |
USD687095S1 (en) | 2012-08-27 | 2013-07-30 | Dynamics Inc. | Interactive electronic card with buttons |
USD694322S1 (en) | 2012-08-27 | 2013-11-26 | Dynamics Inc. | Interactive electronic card with display buttons |
USD687490S1 (en) | 2012-08-27 | 2013-08-06 | Dynamics Inc. | Interactive electronic card with display and button |
USD687488S1 (en) | 2012-08-27 | 2013-08-06 | Dynamics Inc. | Interactive electronic card with buttons |
USD729869S1 (en) | 2012-08-27 | 2015-05-19 | Dynamics Inc. | Interactive electronic card with display and button |
USD729870S1 (en) | 2012-08-27 | 2015-05-19 | Dynamics Inc. | Interactive electronic card with display and button |
USD676487S1 (en) | 2012-08-27 | 2013-02-19 | Dynamics Inc. | Interactive electronic card with display and buttons |
USD828870S1 (en) | 2012-08-27 | 2018-09-18 | Dynamics Inc. | Display card |
USD675256S1 (en) | 2012-08-27 | 2013-01-29 | Dynamics Inc. | Interactive electronic card with display and button |
USD687487S1 (en) | 2012-08-27 | 2013-08-06 | Dynamics Inc. | Interactive electronic card with display and button |
USD730439S1 (en) | 2012-08-27 | 2015-05-26 | Dynamics Inc. | Interactive electronic card with buttons |
USD688744S1 (en) | 2012-08-27 | 2013-08-27 | Dynamics Inc. | Interactive electronic card with display and button |
USD730438S1 (en) | 2012-08-27 | 2015-05-26 | Dynamics Inc. | Interactive electronic card with display and button |
USD692053S1 (en) | 2012-08-27 | 2013-10-22 | Dynamics Inc. | Interactive electronic card with display and button |
USD695636S1 (en) | 2012-08-27 | 2013-12-17 | Dynamics Inc. | Interactive electronic card with display and buttons |
USD729871S1 (en) | 2012-08-27 | 2015-05-19 | Dynamics Inc. | Interactive electronic card with display and buttons |
USD673606S1 (en) | 2012-08-27 | 2013-01-01 | Dynamics Inc. | Interactive electronic card with display and buttons |
USD687887S1 (en) | 2012-08-27 | 2013-08-13 | Dynamics Inc. | Interactive electronic card with buttons |
USD687489S1 (en) | 2012-08-27 | 2013-08-06 | Dynamics Inc. | Interactive electronic card with buttons |
US11126997B1 (en) | 2012-10-02 | 2021-09-21 | Dynamics Inc. | Cards, devices, systems, and methods for a fulfillment system |
US9010647B2 (en) | 2012-10-29 | 2015-04-21 | Dynamics Inc. | Multiple sensor detector systems and detection methods of magnetic cards and devices |
US9659246B1 (en) | 2012-11-05 | 2017-05-23 | Dynamics Inc. | Dynamic magnetic stripe communications device with beveled magnetic material for magnetic cards and devices |
US9010644B1 (en) | 2012-11-30 | 2015-04-21 | Dynamics Inc. | Dynamic magnetic stripe communications device with stepped magnetic material for magnetic cards and devices |
US10949627B2 (en) | 2012-12-20 | 2021-03-16 | Dynamics Inc. | Systems and methods for non-time smearing detection mechanisms for magnetic cards and devices |
USD764584S1 (en) | 2013-03-04 | 2016-08-23 | Dynamics Inc. | Interactive electronic card with buttons |
USD750168S1 (en) | 2013-03-04 | 2016-02-23 | Dynamics Inc. | Interactive electronic card with display and button |
USD751640S1 (en) | 2013-03-04 | 2016-03-15 | Dynamics Inc. | Interactive electronic card with display and button |
USD765174S1 (en) | 2013-03-04 | 2016-08-30 | Dynamics Inc. | Interactive electronic card with button |
USD750166S1 (en) | 2013-03-04 | 2016-02-23 | Dynamics Inc. | Interactive electronic card with display and buttons |
USD765173S1 (en) | 2013-03-04 | 2016-08-30 | Dynamics Inc. | Interactive electronic card with display and button |
USD750167S1 (en) | 2013-03-04 | 2016-02-23 | Dynamics Inc. | Interactive electronic card with buttons |
USD751639S1 (en) | 2013-03-04 | 2016-03-15 | Dynamics Inc. | Interactive electronic card with display and button |
USD777252S1 (en) | 2013-03-04 | 2017-01-24 | Dynamics Inc. | Interactive electronic card with buttons |
USD767024S1 (en) | 2013-09-10 | 2016-09-20 | Dynamics Inc. | Interactive electronic card with contact connector |
USD737373S1 (en) | 2013-09-10 | 2015-08-25 | Dynamics Inc. | Interactive electronic card with contact connector |
US10108891B1 (en) | 2014-03-21 | 2018-10-23 | Dynamics Inc. | Exchange coupled amorphous ribbons for electronic stripes |
US10032049B2 (en) | 2016-02-23 | 2018-07-24 | Dynamics Inc. | Magnetic cards and devices for motorized readers |
Family Cites Families (15)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US4410989A (en) | 1980-12-11 | 1983-10-18 | Cyclotomics, Inc. | Bit serial encoder |
EP0080528A1 (en) | 1981-11-30 | 1983-06-08 | Omnet Associates | Computational method and apparatus for finite field arithmetic |
EP0096165B1 (en) | 1982-06-15 | 1988-06-08 | Kabushiki Kaisha Toshiba | Apparatus for dividing the elements of a galois field |
US4745568A (en) | 1986-12-16 | 1988-05-17 | Onyszchuk Ivan M | Computational method and apparatus for finite field multiplication |
US4994995A (en) | 1990-03-14 | 1991-02-19 | International Business Machines Corporation | Bit-serial division method and apparatus |
IL94449A (en) * | 1990-05-20 | 1994-06-24 | Fortress U & T 2000 Ltd | Method and apparatus for exponentiation over gf(2") |
KR940001147B1 (en) | 1991-03-20 | 1994-02-14 | 삼성전자 주식회사 | OPERATING METHOD AND APPARATUS FOR GF(2m) |
US5555516A (en) | 1993-11-04 | 1996-09-10 | Cirrus Logic, Inc. | Multipurpose error correction calculation circuit |
WO1995012845A1 (en) | 1993-11-04 | 1995-05-11 | Cirrus Logic, Inc. | Finite field inversion |
GB9627069D0 (en) * | 1996-12-30 | 1997-02-19 | Certicom Corp | A method and apparatus for finite field multiplication |
US5854759A (en) | 1997-05-05 | 1998-12-29 | Rsa Data Security, Inc. | Methods and apparatus for efficient finite field basis conversion |
US5931894A (en) * | 1997-11-07 | 1999-08-03 | National Science Council | Power-sum circuit for finite field GF(2m) |
US6009450A (en) | 1997-12-24 | 1999-12-28 | Motorola, Inc. | Finite field inverse circuit |
US5982895A (en) | 1997-12-24 | 1999-11-09 | Motorola, Inc. | Finite field inverse circuit for use in an elliptic curve processor |
US6052704A (en) * | 1998-01-12 | 2000-04-18 | National Science Council | Exponentiation circuit and inverter based on power-sum circuit for finite field GF(2m) |
-
1998
- 1998-11-18 US US09/195,346 patent/US6286022B1/en not_active Expired - Lifetime
-
2001
- 2001-07-31 US US09/919,664 patent/US20010056452A1/en not_active Abandoned
Cited By (6)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US20030135530A1 (en) * | 2001-09-20 | 2003-07-17 | Stmicroelectronics, Inc. | Flexible galois field multiplier |
US7133889B2 (en) * | 2001-09-20 | 2006-11-07 | Stmicroelectronics, Inc. | Flexible galois field multiplier |
US20040098437A1 (en) * | 2002-11-09 | 2004-05-20 | Weon-Il Jin | Method and apparatus for basis conversion in finite field |
US7346641B2 (en) | 2002-11-09 | 2008-03-18 | Samsung Electronics Co., Ltd. | Method and apparatus for basis conversion in finite field |
US20090279693A1 (en) * | 2006-04-10 | 2009-11-12 | France Telecom | Method and a device for generating a pseudorandom string |
US8416951B2 (en) * | 2006-04-10 | 2013-04-09 | France Telecom | Method and a device for generating a pseudorandom string |
Also Published As
Publication number | Publication date |
---|---|
US6286022B1 (en) | 2001-09-04 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
US6286022B1 (en) | Efficient finite field basis conversion involving a dual basis | |
US5854759A (en) | Methods and apparatus for efficient finite field basis conversion | |
US6199087B1 (en) | Apparatus and method for efficient arithmetic in finite fields through alternative representation | |
US6389442B1 (en) | Efficient finite field multiplication in normal basis | |
Silverman | The xedni calculus and the elliptic curve discrete logarithm problem | |
US8666062B2 (en) | Method and apparatus for performing finite field calculations | |
Bernstein | Pippenger’s exponentiation algorithm | |
US8086656B2 (en) | System and method for efficient basis conversion | |
US7580966B2 (en) | Method and device for reducing the time required to perform a product, multiplication and modular exponentiation calculation using the Montgomery method | |
EP0984357A1 (en) | Apparatus and method for elliptic-curve multiplication and recording medium having recorded thereon a program for implementing the method | |
EP0741355A1 (en) | Finite field multiple bit multiplier | |
US5270956A (en) | System and method for performing fast algebraic operations on a permutation network | |
US6957243B2 (en) | Block-serial finite field multipliers | |
Eriksen et al. | Deuring for the people: Supersingular elliptic curves with prescribed endomorphism ring in general characteristic | |
WO1999004332A1 (en) | Composite field multiplicative inverse calculation for elliptic curve cryptography | |
US8719324B1 (en) | Spectral modular arithmetic method and apparatus | |
Van Oorschot et al. | A geometric approach to root finding in GT (q/sup m/) | |
Kaliski Jr et al. | Storage-efficient finite field basis conversion | |
US20030112969A1 (en) | Method for reducing a value modulo a shared secret | |
US20020101987A1 (en) | Elliptic curve cryptographic methods and apparatus | |
US7543012B2 (en) | Method and apparatus to perform squaring operation in finite field | |
KR100257123B1 (en) | High-speed exponentiation method using a modified montgomery modular multiplication | |
Eriksen et al. | Computing Orientations from the Endomorphism Ring of Supersingular Curves and Applications | |
McIvor et al. | A high-speed, low latency RSA decryption silicon core | |
US7363336B1 (en) | Six-term Karatsuba-variant calculator |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
STCB | Information on status: application discontinuation |
Free format text: ABANDONED -- FAILURE TO RESPOND TO AN OFFICE ACTION |
|
AS | Assignment |
Owner name: RSA SECURITY HOLDING, INC., MASSACHUSETTS Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNOR:RSA SECURITY LLC;REEL/FRAME:023824/0721 Effective date: 20091222 Owner name: EMC CORPORATION, MASSACHUSETTS Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNOR:RSA SECURITY HOLDING, INC.;REEL/FRAME:023825/0011 Effective date: 20091231 Owner name: RSA SECURITY HOLDING, INC.,MASSACHUSETTS Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNOR:RSA SECURITY LLC;REEL/FRAME:023824/0721 Effective date: 20091222 Owner name: EMC CORPORATION,MASSACHUSETTS Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNOR:RSA SECURITY HOLDING, INC.;REEL/FRAME:023825/0011 Effective date: 20091231 |
|
AS | Assignment |
Owner name: RSA SECURITY LLC, MASSACHUSETTS Free format text: MERGER;ASSIGNOR:RSA SECURITY INC.;REEL/FRAME:023852/0500 Effective date: 20091221 Owner name: RSA SECURITY LLC,MASSACHUSETTS Free format text: MERGER;ASSIGNOR:RSA SECURITY INC.;REEL/FRAME:023852/0500 Effective date: 20091221 |