Titlebook: Arithmetic of Finite Fields; Second International Joachim Gathen,José Luis Ima?a,?etin Kaya Ko? Conference proceedings 2008 Springer-Verlag

審美家

書目名稱Arithmetic of Finite Fields影響因子(影響力)




書目名稱Arithmetic of Finite Fields影響因子(影響力)學(xué)科排名




書目名稱Arithmetic of Finite Fields網(wǎng)絡(luò)公開度




書目名稱Arithmetic of Finite Fields網(wǎng)絡(luò)公開度學(xué)科排名




書目名稱Arithmetic of Finite Fields被引頻次




書目名稱Arithmetic of Finite Fields被引頻次學(xué)科排名




書目名稱Arithmetic of Finite Fields年度引用




書目名稱Arithmetic of Finite Fields年度引用學(xué)科排名




書目名稱Arithmetic of Finite Fields讀者反饋




書目名稱Arithmetic of Finite Fields讀者反饋學(xué)科排名

hardheaded

disparage

Optimal Extension Field Inversion in the Frequency Domains the first time a frequency domain finite field inversion algorithm is proposed for elliptic curve cryptography. We believe the proposed algorithm would be well suited especially for efficient low-power hardware implementation of elliptic curve cryptography using affine coordinates in constrained s

Blemish

Efficient Finite Fields in the Maxima Computer Algebra Systemwe focused our efforts on efficient computation of primitive elements and modular roots. Our optimizations involve some heuristic methods that use “modular composition” and the generalized Tonelli-Shanks algorithm. Other open and free systems such as GP/Pari do not include in their standard packages

resilience

countenance

Digit-Serial Structures for the Shifted Polynomial Basis Multiplication over Binary Extension Fieldsch is known as the shifted polynomial basis, has been introduced. Current research shows that this new basis provides better performance in designing bit-parallel and subquadratic space complexity multipliers over binary extension fields. In this paper, we study digit-serial multiplication algorithm

tenuous

Some Theorems on Planar Mappingso planar functions are CCZ-equivalent exactly when they are EA-equivalent. We give a sharp lower bound on the size of the image set of a planar function. Further we observe that all currently known main examples of planar functions have image sets of that minimal size.

insecticide

Malcontent

EA and CCZ Equivalence of Functions over ,(2,)functions. We show that they can be related to subsets .[.] and .[.] of equivalence classes [.] of transversals, respectively, thus clarifying their relationship and providing a new approach to their study. We derive a formula which characterises when two CCZ-equivalent functions are EA-inequivalent

Melanocytes

On the Number of Two-Weight Cyclic Codes with Composite Parity-Check Polynomialsted in [4]. On the other hand, an explicit formula for the number of one-weight cyclic codes, when the length and dimension are given, was proved in [3]. By imposing some conditions on the finite field, we now combine both results in order to give a lower bound for the number of two-weight cyclic co