Scott et al., 2002 - Google Patents
Architectures for exponentiation in GF (2/sup m/)Scott et al., 2002
- Document ID
- 9214460516577782086
- Author
- Scott P
- Simmons S
- Tavares S
- Peppard L
- Publication year
- Publication venue
- IEEE journal on selected areas in communications
External Links
Snippet
Several VLSI architectures for performing exponentiation in GF (2/sup m/) are presented. Two approaches to the architecture design are taken. In the first, all intermediate products of the exponentiation are computed in a sequential fashion to minimize the silicon area. In the …
- 230000001360 synchronised effect 0 abstract description 14
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
- 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
- G06F2207/386—Special constructional features
- G06F2207/388—Skewing
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06F—ELECTRICAL DIGITAL DATA PROCESSING
- G06F15/00—Digital computers in general; Data processing equipment in general
- G06F15/76—Architectures of general purpose stored programme computers
- G06F15/78—Architectures of general purpose stored programme computers comprising a single central processing unit
-
- 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/5045—Circuit design
-
- 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)
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06F—ELECTRICAL DIGITAL DATA PROCESSING
- G06F9/00—Arrangements for programme control, e.g. control unit
- G06F9/06—Arrangements for programme control, e.g. control unit using stored programme, i.e. using internal store of processing equipment to receive and retain programme
- G06F9/30—Arrangements for executing machine-instructions, e.g. instruction decode
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06F—ELECTRICAL DIGITAL DATA PROCESSING
- G06F1/00—Details of data-processing equipment not covered by groups G06F3/00 - G06F13/00, e.g. cooling, packaging or power supply specially adapted for computer application
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Kim et al. | A digit-serial multiplier for finite field GF (2/sup m/) | |
| Scott et al. | Architectures for exponentiation in GF (2/sup m/) | |
| Scott et al. | A fast VLSI multiplier for GF (2 m) | |
| Brunner et al. | On computing multiplicative inverses in GF (2/sup m/) | |
| Song et al. | Low-energy digit-serial/parallel finite field multipliers | |
| Meher et al. | Low-Latency, Low-Area, and Scalable Systolic-Like Modular Multipliers for $ GF (2^{m}) $ Based on Irreducible All-One Polynomials | |
| Wang | Bit-level systolic array for fast exponentiation in gf (2/sup m/) | |
| Alam et al. | Exact stochastic computing multiplication in memristive memory | |
| Huang et al. | An ising model-based annealing processor with 1024 fully connected spins for combinatorial optimization problems | |
| KR100478974B1 (en) | Serial finite-field multiplier | |
| WO2000065433A9 (en) | Method for multiplication in galois fields using programmable circuits | |
| Louie et al. | On digit-recurrence division implementations for field programmable gate arrays | |
| CN118034643B (en) | Carry-free multiplication and calculation array based on SRAM | |
| Namin et al. | A Fully Serial-In Parallel-Out Digit-Level Finite Field Multiplier in $\mathbb {F} _ {2^{m}} $ Using Redundant Representation | |
| Basiri | Efficient hardware implementations of Lopez–Dahab projective co-ordinate based scalar multiplication of ECC | |
| Kessels | VLSI programming of a low-power asynchronous Reed-Solomon decoder for the DCC player | |
| Martinez et al. | Hardware implementation of the binary method for exponentiation in GF (2/sup m/) | |
| KR100450750B1 (en) | Finite field multiplier having improved structure of linear feedback shift register | |
| Saqib et al. | A parallel architecture for computing scalar multiplication on hessian elliptic curves | |
| Namin et al. | High-speed architectures for multiplication using reordered normal basis | |
| Addabbo et al. | Efficient implementation of pseudochaotic piecewise linear maps with high digitization accuracies | |
| Guo et al. | A low-complexity power-sum circuit for GF (2/sup m/) and its applications | |
| Jalaja et al. | High speed VLSI architecture for squaring algorithm using retiming approach | |
| US20240394067A1 (en) | Fully homomorphic encrypted processing acceleration | |
| US20230205491A1 (en) | System and Method for Big Number Hardware Multiplication for Cryptography |