Titlebook: Arithmetic of Finite Fields; First International Claude Carlet,Berk Sunar Conference proceedings 2007 Springer-Verlag Berlin Heidelberg 20

GOLF

书目名称Arithmetic of Finite Fields影响因子(影响力)




书目名称Arithmetic of Finite Fields影响因子(影响力)学科排名




书目名称Arithmetic of Finite Fields网络公开度




书目名称Arithmetic of Finite Fields网络公开度学科排名




书目名称Arithmetic of Finite Fields被引频次




书目名称Arithmetic of Finite Fields被引频次学科排名




书目名称Arithmetic of Finite Fields年度引用




书目名称Arithmetic of Finite Fields年度引用学科排名




书目名称Arithmetic of Finite Fields读者反馈




书目名称Arithmetic of Finite Fields读者反馈学科排名

Bouquet

Efficient Multiplication Using Type 2 Optimal Normal Bases bases of type 2 from . reported by Gao et al. (2000) to .(.) + .(. log.) operations in ., where .(.) is the number of .-operations to multiply two polynomials of degree . − 1 over .. We show that this cost is also smaller than other proposed multipliers for . > 160, values which are used in ellipti

匍匐

Effects of Optimizations for Software Implementations of Small Binary Field Arithmetics of different sizes without worrying about penalties introduced by field arithmetic and concentrating on the curve arithmetic itself. Moreover, the cost of field inversion is very low, making the use of affine coordinates in curve arithmetic more interesting. These applications will be mentioned.

革新

Introduction to the Oracle9, Architectureults show that the FU allows to accelerate the execution of 128-bit AES by up to 78% compared to a conventional software implementation using only native SPARC V8 instructions. Moreover, the custom instructions reduce the code size by up to 87.4%. The FU increases the silicon area of the Leon2 core

责任

https://doi.org/10.1007/978-1-4302-0773-3 bases of type 2 from . reported by Gao et al. (2000) to .(.) + .(. log.) operations in ., where .(.) is the number of .-operations to multiply two polynomials of degree . − 1 over .. We show that this cost is also smaller than other proposed multipliers for . > 160, values which are used in ellipti

right-atrium

飞镖

Expert Oracle and Java Securityonstructed from a difference-balanced .-form function. Although neither of the inversions of Klapper A.′. and No J. S.′. main theorems is true, we prove that a difference-balanced .-form function can be obtained by the cyclic relative difference set and the cyclic difference set introduced by these

眼界

User Management and Database Securityd on pairings have appeared in the literature. Software implementations being rather slow, the study of hardware architectures became an active research area. Beuchat . proposed for instance a coprocessor which computes the characteristic three .. pairing, from which the Tate pairing can easily be d

交响乐

Introduction to the Oracle9, Architecturethis paper we present the design of a functional unit (FU) for accelerating the execution of cryptographic software on 32-bit processors. The FU is basically a multiply-accumulate (MAC) unit able to perform multiplications and MAC operations on integers and binary polynomials. Polynomial arithmetic

Lacunar-Stroke

https://doi.org/10.1007/978-1-4302-0773-3on to convert the normal basis representations of elements of . to suitable polynomials of degree at most . over .. These polynomials are multiplied using any method which is suitable for the implementation platform, then the product is converted back to the normal basis using the inverse of the abo