Montgomery Multiplication in GF(2^k
Designs, Codes and Cryptography
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
Look-Up Table-Based Large Finite Field Multiplication in Memory Constrained Cryptosystems
IEEE Transactions on Computers - Special issue on computer arithmetic
Itoh-Tsujii Inversion in Standard Basis and Its Application in Cryptography and Codes
Designs, Codes and Cryptography
A New Addition Formula for Elliptic Curves over GF(2^n)
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
Faster Attacks on Elliptic Curve Cryptosystems
SAC '98 Proceedings of the Selected Areas in Cryptography
Improved Algorithms for Elliptic Curve Arithmetic in GF(2n)
SAC '98 Proceedings of the Selected Areas in Cryptography
High-Speed Software Multiplication in F2m
INDOCRYPT '00 Proceedings of the First International Conference on Progress in Cryptology
Design of Hyperelliptic Cryptosystems in Small Characteristic and a Software Implementation over F2n
ASIACRYPT '98 Proceedings of the International Conference on the Theory and Applications of Cryptology and Information Security: Advances in Cryptology
Efficient Elliptic Curve Exponentiation Using Mixed Coordinates
ASIACRYPT '98 Proceedings of the International Conference on the Theory and Applications of Cryptology and Information Security: Advances 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
Efficient Implementation of Elliptic Curve Cryptosystems on an ARM7 with Hardware Accelerator
ISC '01 Proceedings of the 4th International Conference on Information Security
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
Fast Multiplication on Elliptic Curves over GF(2m) without Precomputation
CHES '99 Proceedings of the First International Workshop on Cryptographic Hardware and Embedded Systems
Software Implementation of Elliptic Curve Cryptography over Binary Fields
CHES '00 Proceedings of the Second International Workshop on Cryptographic Hardware and Embedded Systems
CHES '02 Revised Papers from the 4th International Workshop on Cryptographic Hardware and Embedded Systems
Computer Standards & Interfaces
Constructing Composite Field Representations for Efficient Conversion
IEEE Transactions on Computers
A threshold signature scheme for group communications without a shared distribution center
Future Generation Computer Systems - Special issue: Computational science of lattice Boltzmann modelling
IEEE Transactions on Computers
An area-efficient bit-serial integer and GF(2n) multiplier
Microelectronic Engineering
SSYM'99 Proceedings of the 8th conference on USENIX Security Symposium - Volume 8
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
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
Generic GF(2m) arithmetic in software and its application to ECC
ACISP'03 Proceedings of the 8th Australasian conference on Information security and privacy
Efficient bit-parallel multipliers over finite fields GF(2m)
Computers and Electrical Engineering
Efficient software implementations of large finite fields GF(2n) for secure storage applications
ACM Transactions on Storage (TOS)
Efficient and secure elliptic curve point multiplication using double-base chains
ASIACRYPT'05 Proceedings of the 11th international conference on Theory and Application of Cryptology and Information Security
Secure and efficient AES software implementation for smart cards
WISA'04 Proceedings of the 5th international conference on Information Security Applications
Efficient hardware for the tate pairing calculation in characteristic three
CHES'05 Proceedings of the 7th international conference on Cryptographic hardware and embedded systems
Accelerating inverse of GF(2n) with precomputation
ISPEC'10 Proceedings of the 6th international conference on Information Security Practice and Experience
International Journal of Communication Networks and Distributed Systems
| Hi-index | 0.01 |