Turnitin
降AI改写
早检测系统
早降重系统
Turnitin-UK版
万方检测-期刊版
维普编辑部版
Grammarly检测
Paperpass检测
checkpass检测
PaperYY检测
A new approach to subquadratic space complexity parallel multipliers for extended binary fields
Based on Toeplitz matrix-vector products and coordinate transformation techniques, we
present a new scheme for subquadratic space complexity parallel multiplication in GF (2 n) …
present a new scheme for subquadratic space complexity parallel multiplication in GF (2 n) …
Bit-parallel systolic multipliers for GF (2/sup m/) fields defined by all-one and equally spaced polynomials
CY Lee, EH Lu, JY Lee - IEEE Transactions on Computers, 2001 - ieeexplore.ieee.org
Two operations, the cyclic shifting and the inner product, are defined by the properties of
irreducible all one polynomials. An effective algorithm is proposed for computing …
irreducible all one polynomials. An effective algorithm is proposed for computing …
A new construction of Massey-Omura parallel multiplier over GF (2/sup m/)
The Massey-Omura multiplier of GF (2/sup m/) uses a normal basis and its bit parallel
version is usually implemented using m identical combinational logic blocks whose inputs …
version is usually implemented using m identical combinational logic blocks whose inputs …
[HTML][HTML] A survey of some recent bit-parallel GF (2n) multipliers
This paper surveys bit-parallel multipliers for finite field GF (2 n) according to i) quadratic and
subquadratic arithmetic complexities of the underlying algorithms, ii) various bases used for …
subquadratic arithmetic complexities of the underlying algorithms, ii) various bases used for …
Hardware architectures for public key cryptography
This paper presents an overview of hardware implementations for the two commonly used
types of public key cryptography, ie RSA and elliptic curve cryptography, both based on …
types of public key cryptography, ie RSA and elliptic curve cryptography, both based on …
Parallel multipliers based on special irreducible pentanomials
The state-of-the-art Galois field GF (2/sup m/) multipliers offer advantageous space and time
complexities when the field is generated by so special irreducible polynomial. To date, the …
complexities when the field is generated by so special irreducible polynomial. To date, the …
Fast bit-parallel GF (2/sup n/) multiplier for all trinomials
H Fan, Y Dai - IEEE Transactions on Computers, 2005 - ieeexplore.ieee.org
Based on a new representation of GF (2/sup n/), we present two multipliers for all irreducible
trinomials. Space complexities of the multipliers match the best results. The time complexity …
trinomials. Space complexities of the multipliers match the best results. The time complexity …
Concurrent Error Detection in Montgomery Multiplication over GF(2m)
Because fault-based attacks on cryptosystems have been proven effective, fault diagnosis
and tolerance in cryptography have started a new surge of research and development …
and tolerance in cryptography have started a new surge of research and development …
Low complexity bit-parallel systolic multiplier over GF(2m) using irreducible trinomials
CY Lee - IEE Proceedings-Computers and Digital Techniques, 2003 - IET
A bit-parallel systolic multiplier in the finite field GF (2 m) over the polynomial basis, where
irreducible trinomials xm+ xn+ 1 generate the fields GF (2 m) is presented. The latency of the …
irreducible trinomials xm+ xn+ 1 generate the fields GF (2 m) is presented. The latency of the …
Concurrent Error Detection in a Polynomial Basis Multiplier over GF(2m)
CY Lee, CW Chiou, JM Lin - Journal of Electronic Testing, 2006 - Springer
Eliminating cryptographic computation errors is vital for preventing attacks. A simple
approach is to verify the correctness of the cipher before outputting it. The multiplication is …
approach is to verify the correctness of the cipher before outputting it. The multiplication is …