Storage-eecient Finite Field Basis Conversion
نویسندگان
چکیده
The problem of nite eld basis conversion is to convert from the representation of a eld element in one basis to the representation of the element in another basis. This paper presents new algorithms for the problem that require much less storage than previous solutions. For the nite eld GF(2 m), for example, the storage requirement of the new algorithms is only O(m) bits, compared to O(m 2) for previous solutions. With the new algorithms, it is possible to extend an implementation in one basis to support other bases with little additional cost, thereby providing the desired interoperability in many cryptographic applications.
منابع مشابه
Constructing Composite Field Representations for Efficient Conversion
This paper describes a method of construction of a composite field representation from a given binary field representation. We derive the conversion (change of basis) matrix. The special case of when the degree of the ground field is relatively prime to the extension degree, where the irreducible polynomial generating the composite field has its coefficients from the binary prime field rather t...
متن کاملCompatibility of High-Moisture Storage for Biochemical Conversion of Corn Stover: Storage Performance at Laboratory and Field Scales
Citation: Wendt LM, Murphy JA, Smith WA, Robb T, Reed DW, Ray AE, Liang L, He Q, Sun N, Hoover AN and Nguyen QA (2018) Compatibility of High-Moisture Storage for Biochemical Conversion of Corn Stover: Storage Performance at Laboratory and Field Scales. Front. Bioeng. Biotechnol. 6:30. doi: 10.3389/fbioe.2018.00030 compatibility of high-Moisture storage for Biochemical conversion of corn stover:...
متن کاملEfficient Bit Serial Multipliers of Berlekamp Type In
Using good properties of an optimal normal basis of type I in a finite field F2m , we present a design of a bit serial multiplier of Berlekamp type, which is very effective in computing xy. It is shown that our multiplier does not need a basis conversion process and a squaring operation is a simple permutation in our basis. Therefore our multiplier provides a fast and an efficient hardware arch...
متن کاملEecient Diierential Timeslice Computation
Transaction-time databases record all previous database states and are ever-groving, leading to potentially huge quantities of data. For that reason, eecient query processing is of particular importance. Due to the large size of transaction-time relations, it is advantageous to utilize cheap write-once storage media for storage. This is facilitated by adopting a log-based storage structure. Tim...
متن کاملAn Adaptive H-refinement Finite Element Method for Parabolic Differential Systems in Three Space Dimensions
I describe an adaptive h-reenement method for solving systems of parabolic partial diierential equations in three space dimensions on hexahedral grids. These grids typically have irregular (hanging) nodes. Solutions are calculated using Galerkin's method with a piecewise trilinear basis in space and a BDF code in time. New a posteriori error indicators based on interpolation error estimates for...
متن کامل