Keyword

binary field arithmetic

Description: Binary field arithmetic is computation in finite fields of characteristic two, used in cryptography, coding theory, and digital hardware.

Primary topic: Cryptography and Residue Arithmetic (89%)

OpenAlex ID: keywords/binary-field-arithmetic

Efficient Elliptic Curve Point Multiplication Using Digit-Serial Binary Field Operations

2012 · G.D. Sutter, J. Deschamps, et al. · IEEE Transactions on Industrial Electronics · 157

53 Gbps Native ${\rm GF}(2 ^{4}) ^{2}$ Composite-Field AES-Encrypt/Decrypt Accelerator for Content-Protection in 45 nm High-Performance Microprocessors

2011 · Sanu K. Mathew, Farhana Sheikh, et al. · IEEE Journal of Solid-State Circuits · 139

Efficient algorithm and architecture for elliptic curve cryptography for extremely constrained secure applications

2014 · Reza Azarderakhsh, Kimmo U. Jarvinen, et al. · IEEE Transactions on Circuits and Systems I Regular Papers · 109

On Parallelization of High-Speed Processors for Elliptic Curve Cryptography

2008 · K. Jarvinen, J. Skytta · IEEE Transactions on Very Large Scale Integration (VLSI) Systems · 88

A Cellular-Array Multiplier for GF(2m)

1971 · B.A. Laws, C.K. Rushforth · IEEE Transactions on Computers · 88

Fast Multiplication on Elliptic Curves over Small Fields of Characteristic Two

1998 · Volker Müller · Journal of Cryptology · 84

PDF

FPGA implementation of a microcoded elliptic curve cryptographic processor

2002 · K.H. Leung, K.W. Ma, et al. · IEEE Symposium on Field-Programmable Custom Computing Machines (FCCM) · 76

Bit Serial Multiplication in Finite Fields

1990 · Muzhong Wang, Ian F. Blake · SIAM Journal on Discrete Mathematics · 76

Solving linear equations over GF(2): block Lanczos algorithm

1993 · Don Coppersmith · Linear Algebra and its Applications · 74

PDF

A microcoded elliptic curve processor using FPGA technology

2002 · P.H.W. Leong, I.K.H. Leung · IEEE Transactions on Very Large Scale Integration (VLSI) Systems · 73

Montgomery multiplier and squarer for a class of finite fields

2002 · Huapeng Wu · IEEE Transactions on Computers · 68

A systolic power-sum circuit for GF(2/sup m/)

1994 · Shyue-Win Wei · IEEE Transactions on Computers · 67

Efficient implementation of elliptic curve cryptography in wireless sensors

2010 · Diego F. Aranha, Ricardo Dahab, et al. · Advances in Mathematics of Communications · 64

Arithmetic operations in GF(2m)

1993 · G. B. Agnew, T. Beth, et al. · Journal of Cryptology · 64

PDF

Low complexity bit-parallel systolic multiplier over GF(2m) using irreducible trinomials

2003 · Chiou-Yng Lee · IEE Proceedings - Computers and Digital Techniques · 58

Look-up table-based large finite field multiplication in memory constrained cryptosystems

2000 · M.A. Hasan · IEEE Transactions on Computers · 57

FPGA implementation of high performance elliptic curve cryptographic processor over

2008 · Chang Hoon Kim, Soonhak Kwon, et al. · Journal of Systems Architecture · 54

Matrix Factorization over $GF(2)$ and Trace-Orthogonal Bases of $GF(2^n )$

1975 · Abraham Lempel · SIAM Journal on Computing · 54

Fast Bit Parallel-Shifted Polynomial Basis Multipliers in $GF(2^{n})$

2006 · Haining Fan, M. Anwar Hasan · IEEE Transactions on Circuits and Systems I Fundamental Theory and Applications · 50

Speeding scalar multiplication over binary elliptic curves using the new carry-less multiplication instruction

2011 · Jonathan Taverne, Armando Faz-Hernández, et al. · Journal of Cryptographic Engineering · 48

An algorithm to design finite field multipliers using a self-dual normal basis

1989 · C.C. Wang · IEEE Transactions on Computers · 45

Architectures for exponentiation in GF(2/sup m/)

1988 · P.A. Scott, S.J. Simmons, et al. · IEEE Journal on Selected Areas in Communications · 44

Double-Base Number System for Multi-scalar Multiplications

2009 · Christophe Doche, David R. Kohel, et al. · Lecture notes in computer science · 43

Elliptic Curve Cryptography for Constrained Devices

2008 · Sandeep S. Kumar · Dokumentenrepositorium der RUB (Ruhr University Bochum) · 43

PDF

Fast point multiplication on Koblitz curves: Parallelization method and implementations

2008 · Kimmo Järvinen, Jorma Skyttä · Microprocessors and Microsystems · 42

Works count: 561

Citation count: 3,990