Nothing Special   »   [go: up one dir, main page]

Mozhi et al., 2016 - Google Patents

Efficient bit-parallel systolic multiplier over GF (2 m)

Mozhi et al., 2016

Document ID
13191474639069577969
Author
Mozhi S
Ramya P
Publication year
Publication venue
2016 International Conference on Electrical, Electronics, and Optimization Techniques (ICEEOT)

External Links

Snippet

A bit parallel systolic multiplier in the finite field GF (2 m) over the polynomial basis where irreducible polynomial generate the field GF (2 m) is presented. The complexity of the proposed multiplier is compared in terms of area, latency and speed. The proposed …
Continue reading at ieeexplore.ieee.org (other versions)

Classifications

    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F7/00—Methods or arrangements for processing data by operating upon the order or content of the data handled
    • G06F7/60—Methods or arrangements for performing computations using a digital non-denominational number representation, i.e. number representation without radix; Computing devices using combinations of denominational and non-denominational quantity representations, e.g. using difunction pulse trains, STEELE computers, phase computers
    • G06F7/72—Methods or arrangements for performing computations using a digital non-denominational number representation, i.e. number representation without radix; Computing devices using combinations of denominational and non-denominational quantity representations, e.g. using difunction pulse trains, STEELE computers, phase computers using residue arithmetic
    • G06F7/724—Finite field arithmetic
    • G06F7/726—Inversion; Reciprocal calculation; Division of elements of a finite field
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F7/00—Methods or arrangements for processing data by operating upon the order or content of the data handled
    • G06F7/38—Methods or arrangements for performing computations using exclusively denominational number representation, e.g. using binary, ternary, decimal representation
    • G06F7/48—Methods or arrangements for performing computations using exclusively denominational number representation, e.g. using binary, ternary, decimal representation using non-contact-making devices, e.g. tube, solid state device; using unspecified devices
    • G06F7/52—Multiplying; Dividing
    • G06F7/523—Multiplying only
    • G06F7/53—Multiplying only in parallel-parallel fashion, i.e. both operands being entered in parallel
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F7/00—Methods or arrangements for processing data by operating upon the order or content of the data handled
    • G06F7/60—Methods or arrangements for performing computations using a digital non-denominational number representation, i.e. number representation without radix; Computing devices using combinations of denominational and non-denominational quantity representations, e.g. using difunction pulse trains, STEELE computers, phase computers
    • G06F7/72—Methods or arrangements for performing computations using a digital non-denominational number representation, i.e. number representation without radix; Computing devices using combinations of denominational and non-denominational quantity representations, e.g. using difunction pulse trains, STEELE computers, phase computers using residue arithmetic
    • G06F7/724—Finite field arithmetic
    • G06F7/725—Finite field arithmetic over elliptic curves
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F7/00—Methods or arrangements for processing data by operating upon the order or content of the data handled
    • G06F7/38—Methods or arrangements for performing computations using exclusively denominational number representation, e.g. using binary, ternary, decimal representation
    • G06F7/48—Methods or arrangements for performing computations using exclusively denominational number representation, e.g. using binary, ternary, decimal representation using non-contact-making devices, e.g. tube, solid state device; using unspecified devices
    • G06F7/50—Adding; Subtracting
    • G06F7/505—Adding; Subtracting in bit-parallel fashion, i.e. having a different digit-handling circuit for each denomination
    • H—ELECTRICITY
    • H03—BASIC ELECTRONIC CIRCUITRY
    • H03M—CODING; DECODING; CODE CONVERSION IN GENERAL
    • H03M13/00—Coding, decoding or code conversion, for error detection or error correction; Coding theory basic assumptions; Coding bounds; Error probability evaluation methods; Channel models; Simulation or testing of codes
    • H03M13/03—Error detection or forward error correction by redundancy in data representation, i.e. code words containing more digits than the source words
    • H03M13/05—Error detection or forward error correction by redundancy in data representation, i.e. code words containing more digits than the source words using block codes, i.e. a predetermined number of check bits joined to a predetermined number of information bits
    • H03M13/13—Linear codes
    • H03M13/15—Cyclic codes, i.e. cyclic shifts of codewords produce other codewords, e.g. codes defined by a generator polynomial, Bose-Chaudhuri-Hocquenghem [BCH] codes
    • H03M13/151—Cyclic codes, i.e. cyclic shifts of codewords produce other codewords, e.g. codes defined by a generator polynomial, Bose-Chaudhuri-Hocquenghem [BCH] codes using error location or error correction polynomials
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F2207/00—Indexing scheme relating to methods or arrangements for processing data by operating upon the order or content of the data handled
    • G06F2207/38—Indexing scheme relating to groups G06F7/38 - G06F7/575
    • G06F2207/3804—Details
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
    • G06F17/10—Complex mathematical operations
    • G06F17/16—Matrix or vector computation, e.g. matrix-matrix or matrix-vector multiplication, matrix factorization
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
    • G06F17/50—Computer-aided design
    • G06F17/5009—Computer-aided design using simulation
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F2207/00—Indexing scheme relating to methods or arrangements for processing data by operating upon the order or content of the data handled
    • G06F2207/72—Indexing scheme relating to groups G06F7/72 - G06F7/729
    • G06F2207/7209—Calculation via subfield, i.e. the subfield being GF(q) with q a prime power, e.g. GF ((2**m)**n) via GF(2**m)

Similar Documents

Publication Publication Date Title
Reyhani-Masoleh Efficient algorithms and architectures for field multiplication using Gaussian normal bases
Drolet A new representation of elements of finite fields GF (2/sup m/) yielding small complexity arithmetic circuits
Lee et al. Scalable Gaussian normal basis multipliers over GF (2 m) using Hankel matrix-vector representation
Lee Low complexity bit-parallel systolic multiplier over GF (2m) using irreducible trinomials
Hariri et al. Concurrent error detection in montgomery multiplication over binary extension fields
Namin et al. A word-level finite field multiplier using normal basis
Chen et al. Scalable and systolic dual basis multiplier over GF (2m)
El-Razouk et al. New architectures for digit-level single, hybrid-double, hybrid-triple field multiplications and exponentiation using Gaussian normal bases
Pillutla et al. Area-efficient low-latency polynomial basis finite field GF (2m) systolic multiplier for a class of trinomials
Mathe et al. Design and implementation of a sequential polynomial basis multiplier over GF (2 m)
Daneshbeh et al. A class of unidirectional bit serial systolic architectures for multiplicative inversion and division over GF (2/sup m/)
Petra et al. A novel architecture for galois fields GF (2^ m) multipliers based on mastrovito scheme
Reyhani-Masoleh A new bit-serial architecture for field multiplication using polynomial bases
Lee et al. Area-efficient subquadratic space-complexity digit-serial multiplier for type-II optimal normal basis of $ GF (2^{m}) $ using symmetric TMVP and block recombination techniques
Mozhi et al. Efficient bit-parallel systolic multiplier over GF (2 m)
Rashidi et al. Efficient implementation of bit‐parallel fault tolerant polynomial basis multiplication and squaring over GF (2m)
Meher et al. Analysis of systolic penalties and design of efficient digit-level systolic-like multiplier for binary extension fields
Lee et al. Low-complexity bit-parallel systolic architectures for computing A (x) B2 (x) over GF (2m)
Mohaghegh et al. Low-power and area-efficient finite field multiplier architecture based on irreducible all-one polynomials
Lee et al. Low area-delay complexity digit-level parallel-in serial-out multiplier over gf (2m) based on overlap-free karatsuba algorithm
Kadu et al. Hardware implementation of efficient elliptic curve scalar multiplication using vedic multiplier
Devi et al. A low complexity bit parallel polynomial basis systolic multiplier for general irreducible polynomials and trinomials
Mozhi et al. High Speed Bit-Parallel Systolic Multiplier over GF (2 m) for Cryptographic Application
Sargunam et al. High speed bit-parallel systolic multiplier over GF (2 m) for cryptographic application
Chiou et al. Digit-serial systolic Karatsuba multiplier for special classes over GF (2m)