Chiou et al., 2017 - Google Patents

Gaussian normal basis multiplier over GF (2m) using hybrid subquadratic‐and‐quadratic TMVP approach for elliptic curve cryptography

Chiou et al., 2017

View PDF @Full View

Document ID: 16824635451216642572
Author: Chiou C; Sun Y; Lee C; Lin J; Chuang T; Lee C
Publication year: 2017
Publication venue: IET Circuits, Devices & Systems

External Links

Cited by

Snippet

In recent years, subquadratric‐and‐quadratric Toeplitz matrix–vector product (TMVP) computations are widely used for the implementation of binary field multiplication in elliptic curve cryptography. Pure subquadratric TMVP structure involves significantly less space …

Continue reading at ietresearch.onlinelibrary.wiley.com (PDF) (other versions)

238000000354 decomposition reaction 0 abstract description 2

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
- 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
- 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
- G06F7/00—Methods or arrangements for processing data by operating upon the order or content of the data handled
- G06F7/58—Random or pseudo-random number generators
- 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
- 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
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L9/00—Cryptographic mechanisms or cryptographic arrangements for secret or secure communication
- H04L9/30—Public key, i.e. encryption algorithm being computationally infeasible to invert or user's encryption keys not requiring secrecy
- 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
- 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/37—Decoding methods or techniques, not specific to the particular type of coding provided for in groups H03M13/03 - H03M13/35
- H03M13/39—Sequence estimation, i.e. using statistical methods for the reconstruction of the original codes
- H03M13/3966—Sequence estimation, i.e. using statistical methods for the reconstruction of the original codes based on architectures providing a highly parallelized implementation, e.g. based on systolic arrays

Similar Documents

Publication	Publication Date	Title
Pan et al.	2019	Novel systolization of subquadratic space complexity multipliers based on toeplitz matrix–vector product approach
Hossain et al.	2017	High‐performance elliptic curve cryptography processor over NIST prime fields
Lee et al.	2005	Low-complexity bit-parallel systolic Montgomery multipliers for special classes of GF (2/sup m/)
Imran et al.	2019	Throughput/area optimised pipelined architecture for elliptic curve crypto processor
Asif et al.	2017	High‐throughput multi‐key elliptic curve cryptosystem based on residue number system
Rashidi et al.	2017	High‐performance and high‐speed implementation of polynomial basis itoh–tsujii inversion algorithm over GF (2m)
Rashidi et al.	2017	Efficient and low‐complexity hardware architecture of Gaussian normal basis multiplication over GF (2m) for elliptic curve cryptosystems
Yan Hua et al.	2013	Low space‐complexity digit‐serial dual basis systolic multiplier over Galois field GF (2m) using Hankel matrix and Karatsuba algorithm
Morales‐Sandoval et al.	2016	Scalable GF (p) Montgomery multiplier based on a digit–digit computation approach
Pan et al.	2018	Efficient digit‐serial modular multiplication algorithm on FPGA
Mathe et al.	2017	Design and Implementation of a Sequential Polynomial Basis Multiplier over GF (2m).
Mathe et al.	2018	Bit‐parallel systolic multiplier over for irreducible trinomials with ASIC and FPGA implementations
Hu et al.	2022	A high speed processor for elliptic curve cryptography over NIST prime field
Shah et al.	2020	LUT‐based high‐speed point multiplier for Goldilocks‐Curve448
Rashidi	2020	Efficient and flexible hardware structures of the 128 bit CLEFIA block cipher
Fatemi et al.	2019	Efficient implementation of digit‐serial Montgomery modular multiplier architecture
Rashidi	2020	Throughput/area efficient implementation of scalable polynomial basis multiplication
Petra et al.	2007	A novel architecture for galois fields GF (2^ m) multipliers based on mastrovito scheme
Chen et al.	2016	FPGA realization of low register systolic all-one-polynomial multipliers over $ GF (2^{m}) $ and their applications in trinomial multipliers
Azarderakhsh et al.	2015	High-performance two-dimensional finite field multiplication and exponentiation for cryptographic applications
Lee	2003	Low-latency bit-parallel systolic multiplier for irreducible x m+ x n+ 1 with gcd (m, n)= 1
Chiou et al.	2018	High‐throughput Dickson basis multiplier with a trinomial for lightweight cryptosystems
Niras et al.	2016	Fast sign‐detection algorithm for residue number system moduli set {2n− 1, 2n, 2n+ 1− 1}
Banerjee et al.	2016	A New Squarer design with reduced area and delay
Rashidi et al.	2016	Efficient implementation of bit‐parallel fault tolerant polynomial basis multiplication and squaring over GF (2m)