[go: up one dir, main page]
More Web Proxy on the site http://driver.im/

Hasan et al., 1998 - Google Patents

Efficient architectures for computations over variable dimensional Galois fields

Hasan et al., 1998

Document ID
12379185787526452140
Author
Hasan M
Ebtedaei M
Publication year
Publication venue
IEEE Transactions on Circuits and Systems I: Fundamental Theory and Applications

External Links

Snippet

The complexity of many reliability and security schemes, when implemented in hardware, depends on arithmetic operations in the fields over which the computations are performed. In this paper, a multiplier for fields GF (2/sup m/), 1< m/spl les/M, is presented which allows …
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/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/52—Multiplying; Dividing
    • G06F7/523—Multiplying only
    • G06F7/53—Multiplying only in parallel-parallel fashion, i.e. both operands being entered in parallel
    • 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
    • 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
    • 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
    • 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
Jain et al. Efficient semisystolic architectures for finite-field arithmetic
Drolet A new representation of elements of finite fields GF (2/sup m/) yielding small complexity arithmetic circuits
Scott et al. A fast VLSI multiplier for GF (2 m)
Hasan et al. Modular construction of low complexity parallel multipliers for a class of finite fields GF (2/sup m/)
Okada et al. Implementation of Elliptic Curve Cryptographic Coprocessor over GF (2 m) on an FPGA
Reyhani-Masoleh et al. A new construction of Massey-Omura parallel multiplier over GF (2/sup m/)
Wang et al. VLSI architectures for computing multiplications and inverses in GF (2 m)
US4745568A (en) Computational method and apparatus for finite field multiplication
Lee et al. Efficient design of low-complexity bit-parallel systolic Hankel multipliers to implement multiplication in normal and dual bases of GF (2 m)
Gao et al. Improved vlsi designs for multiplication and inversion in gf (2/sup m/) over normal bases
Hasan et al. Efficient architectures for computations over variable dimensional Galois fields
Taheri et al. High-speed signal processing using systolic arrays over finite rings
US6957243B2 (en) Block-serial finite field multipliers
KR100322739B1 (en) Finite Field Computation Method and Its Apparatus
Petra et al. A novel architecture for galois fields GF (2^ m) multipliers based on mastrovito scheme
US5931894A (en) Power-sum circuit for finite field GF(2m)
Frey On adaptive chaotic encoding
Wu Low complexity LFSR based bit-serial montgomery multiplier in GF (2 m)
Bharathwaj et al. An alternate approach to modular multiplication for finite fields [GF (2/sup m/)] using Itoh Tsujii algorithm
Lee et al. New bit-parallel systolic multipliers for a class of GF (2/sup m/)
Hasan et al. Sequential multiplier with sub-linear gate complexity
Pradhan et al. Reed-Muller like canonic forms for multivalued functions
Wei VLSI architectures of divider for finite field GF (2/sup m/)
KR20010068349A (en) Standard basis gf multiplier with the generalized basis cell and the fixed basic cell and squarer architecture
Furness et al. GF (2m) multiplication over triangular basis for design of Reed-Solomon codes