Finding (good) normal bases in finite fields
ISSAC '91 Proceedings of the 1991 international symposium on Symbolic and algebraic computation
Low Complexity Bit-Parallel Multipliers for a Class of Finite Fields
IEEE Transactions on Computers
Montgomery Multiplication in GF(2^k
Designs, Codes and Cryptography
Discrete Logarithm Based Cryptosystems in Quadratic FunctionFields of Characteristic 2
Designs, Codes and Cryptography
On-Line Error Detection for Bit-Serial Multipliers in GF(2m)
Journal of Electronic Testing: Theory and Applications
Computing special powers in finite fields: extended abstract
ISSAC '99 Proceedings of the 1999 international symposium on Symbolic and algebraic computation
Fast Arithmetic for Public-Key Algorithms in Galois Fields with Composite Exponents
IEEE Transactions on Computers
The State of Elliptic Curve Cryptography
Designs, Codes and Cryptography - Special issue on towards a quarter-century of public key cryptography
Efficient Normal Basis Multipliers in Composite Fields
IEEE Transactions on Computers
A New Construction of Massey-Omura Parallel Multiplier over GF(2^{m})
IEEE Transactions on Computers
Cybernetics and Systems Analysis
GF(2m) Multiplication and Division Over the Dual Basis
IEEE Transactions on Computers
Bit-Parallel Finite Field Multiplier and Squarer Using Polynomial Basis
IEEE Transactions on Computers
Finite Field Multiplier Using Redundant Representation
IEEE Transactions on Computers
Efficient Software Implementation for Finite Field Multiplication in Normal Basis
ICICS '01 Proceedings of the Third International Conference on Information and Communications Security
On Complexity of Polynomial Basis Squaring in F2m
SAC '00 Proceedings of the 7th Annual International Workshop on Selected Areas in Cryptography
Fast Normal Basis Multiplication Using General Purpose Processors
SAC '01 Revised Papers from the 8th Annual International Workshop on Selected Areas in Cryptography
CM-Curves with Good Cryptographic Properties
CRYPTO '91 Proceedings of the 11th Annual International Cryptology Conference on Advances in Cryptology
On Efficient Normal Basis Multiplication
INDOCRYPT '00 Proceedings of the First International Conference on Progress in Cryptology
High-Speed Software Multiplication in F2m
INDOCRYPT '00 Proceedings of the First International Conference on Progress in Cryptology
Elliptic Curve Public-Key Cryptosystems - An Introduction
State of the Art in Applied Cryptography, Course on Computer Security and Industrial Cryptography - Revised Lectures
Exploration of Design Space in ECDSA
FPL '02 Proceedings of the Reconfigurable Computing Is Going Mainstream, 12th International Conference on Field-Programmable Logic and Applications
A New Aspect of Dual Basis for Efficient Field Arithmetic
PKC '99 Proceedings of the Second International Workshop on Practice and Theory in Public Key Cryptography
Redundant Representation of Finite Fields
PKC '01 Proceedings of the 4th International Workshop on Practice and Theory in Public Key Cryptography: Public Key Cryptography
Low Complexity Bit-Parallel Finite Field Arithmetic Using Polynomial Basis
CHES '99 Proceedings of the First International Workshop on Cryptographic Hardware and Embedded Systems
Highly Regular Architectures for Finite Field Computation Using Redundant Basis
CHES '99 Proceedings of the First International Workshop on Cryptographic Hardware and Embedded Systems
Efficient Multiplication Beyond Optimal Normal Bases
IEEE Transactions on Computers
FPGA Implementation of a Microcoded Elliptic Curve Cryptographic Processor
FCCM '00 Proceedings of the 2000 IEEE Symposium on Field-Programmable Custom Computing Machines
Architectures for Arithmetic over GF(2^m)
VLSID '97 Proceedings of the Tenth International Conference on VLSI Design: VLSI in Multimedia Applications
Hardware architectures for public key cryptography
Integration, the VLSI Journal
Fast Normal Basis Multiplication Using General Purpose Processors
IEEE Transactions on Computers
Fast arithmetic with general Gauß periods
Theoretical Computer Science - Algebraic and numerical algorithm
Efficient digit-serial normal basis multipliers over binary extension fields
ACM Transactions on Embedded Computing Systems (TECS)
Low Complexity Word-Level Sequential Normal Basis Multipliers
IEEE Transactions on Computers
Efficient Algorithms and Architectures for Field Multiplication Using Gaussian Normal Bases
IEEE Transactions on Computers
A new characterization of dual bases in finite fields and its applications
Discrete Applied Mathematics
IEEE Transactions on Computers
WG: A family of stream ciphers with designed randomness properties
Information Sciences: an International Journal
The trace of an optimal normal element and low complexity normal bases
Designs, Codes and Cryptography
Efficient Multiplication Using Type 2 Optimal Normal Bases
WAIFI '07 Proceedings of the 1st international workshop on Arithmetic of Finite Fields
Using Normal Bases for Compact Hardware Implementations of the AES S-Box
SCN '08 Proceedings of the 6th international conference on Security and Cryptography for Networks
Improved throughput bit-serial multiplier for GF(2m) fields
Integration, the VLSI Journal
Combined circuit architecture for computing normal basis and montgomery multiplications over GF(2m)
Mobility '08 Proceedings of the International Conference on Mobile Technology, Applications, and Systems
Unified parallel systolic multiplier over GF(2m)
Journal of Computer Science and Technology
A high-speed word level finite field multiplier in F2m using redundant representation
IEEE Transactions on Very Large Scale Integration (VLSI) Systems
An extension of TYT inversion algorithm in polynomial basis
Information Processing Letters
Fast arithmetic architectures for public-key algorithms over Galois fields GF((2n)m)
EUROCRYPT'97 Proceedings of the 16th annual international conference on Theory and application of cryptographic techniques
Public-key cryptosystems with very small key lengths
EUROCRYPT'92 Proceedings of the 11th annual international conference on Theory and application of cryptographic techniques
EUROCRYPT'99 Proceedings of the 17th international conference on Theory and application of cryptographic techniques
Efficient inversion algorithm for optimal normal bases type II
ICCSA'03 Proceedings of the 2003 international conference on Computational science and its applications: PartI
An efficient algorithm for computing inverses in GF(2m) using dual bases
ICCS'03 Proceedings of the 2003 international conference on Computational science
Whirlwind: a new cryptographic hash function
Designs, Codes and Cryptography
A modified low complexity digit-level Gaussian normal basis multiplier
WAIFI'10 Proceedings of the Third international conference on Arithmetic of finite fields
Type-II optimal polynomial bases
WAIFI'10 Proceedings of the Third international conference on Arithmetic of finite fields
Customizable elliptic curve cryptosystems
IEEE Transactions on Very Large Scale Integration (VLSI) Systems
Combined circuit architecture for computing normal basis and Montgomery multiplications over GF(2m)
International Journal of Autonomous and Adaptive Communications Systems
Scalar multiplication on elliptic curves defined over fields of small odd characteristic
INDOCRYPT'05 Proceedings of the 6th international conference on Cryptology in India
Gauss periods as constructions of low complexity normal bases
Designs, Codes and Cryptography
Pseudorandom number generator using optimal normal basis
ICCSA'06 Proceedings of the 2006 international conference on Computational Science and Its Applications - Volume Part III
On the (im)possibility of practical and secure nonlinear filters and combiners
SAC'05 Proceedings of the 12th international conference on Selected Areas in Cryptography
An Efficient Finite Field Multiplier Using Redundant Representation
ACM Transactions on Embedded Computing Systems (TECS)
Elliptic periods for finite fields
Finite Fields and Their Applications
Finite field arithmetic using quasi-normal bases
Finite Fields and Their Applications
Low complexity of a class of normal bases over finite fields
Finite Fields and Their Applications
Rings of Low Multiplicative Complexity
Finite Fields and Their Applications
Abelian Groups, Gauss Periods, and Normal Bases
Finite Fields and Their Applications
Scalable Gaussian Normal Basis Multipliers over GF(2m) Using Hankel Matrix-Vector Representation
Journal of Signal Processing Systems
| Hi-index | 0.08 |