Efficient hardware implementation of finite fields with applications to cryptography
From MaRDI portal
Recommendations
- Efficient software-implementation of finite fields with applications to cryptography
- Efficient implementations of Gaussian elimination in finite fields on ASICs for MQ cryptographic systems
- Rapid hardware design for cryptographic modules with filtering structures over small finite fields
- Fault-Tolerant Finite Field Computation in the Public Key Cryptosystems
- scientific article; zbMATH DE number 1878332
- Efficient arithmetic in finite field extensions with application in elliptic curve cryptography.
- On the Construction of Composite Finite Fields for Hardware Obfuscation
- Revisiting homomorphic encryption schemes for finite fields
- The computational efficacy of finite-field arithmetic
- Efficient hardware implementation of elliptic curve cryptosystems
Cites work
- scientific article; zbMATH DE number 5296403 (Why is no real title available?)
- scientific article; zbMATH DE number 3812999 (Why is no real title available?)
- scientific article; zbMATH DE number 1302857 (Why is no real title available?)
- scientific article; zbMATH DE number 1302866 (Why is no real title available?)
- scientific article; zbMATH DE number 1024494 (Why is no real title available?)
- scientific article; zbMATH DE number 1088245 (Why is no real title available?)
- scientific article; zbMATH DE number 1135075 (Why is no real title available?)
- scientific article; zbMATH DE number 1962149 (Why is no real title available?)
- scientific article; zbMATH DE number 1979307 (Why is no real title available?)
- scientific article; zbMATH DE number 2077085 (Why is no real title available?)
- scientific article; zbMATH DE number 1504803 (Why is no real title available?)
- scientific article; zbMATH DE number 1759282 (Why is no real title available?)
- scientific article; zbMATH DE number 1759315 (Why is no real title available?)
- scientific article; zbMATH DE number 1759768 (Why is no real title available?)
- scientific article; zbMATH DE number 954401 (Why is no real title available?)
- scientific article; zbMATH DE number 2086895 (Why is no real title available?)
- scientific article; zbMATH DE number 1842494 (Why is no real title available?)
- scientific article; zbMATH DE number 3269473 (Why is no real title available?)
- scientific article; zbMATH DE number 3303655 (Why is no real title available?)
- scientific article; zbMATH DE number 3422259 (Why is no real title available?)
- A Computer Algorithm for Calculating the Product AB Modulo M
- A fast algorithm for computing multiplicative inverses in \(\text{GF}(2^ m)\) using normal bases
- A low-complexity combinatorial RNS multiplier
- A method for obtaining digital signatures and public-key cryptosystems
- A redundant representation of GF(q<sup>n</sup>) for designing arithmetic circuits
- Bit Serial Multiplication in Finite Fields
- Efficient arithmetic in finite field extensions with application in elliptic curve cryptography.
- Efficient bit-serial multiplication and the discrete-time Wiener-Hopf equation over finite fields
- Elliptic Curve Cryptosystems
- Elliptic curve cryptosystems over small fields of odd characteristic
- Fast combinatorial RNS processors for DSP applications
- Hyperelliptic cryptosystems
- Irreducible trinomials over finite fields
- Itoh-Tsujii inversion in standard basis and its application in cryptography and codes
- Modular Multiplication Without Trial Division
- New directions in cryptography
- Novel approaches to the design of VLSI RNS multipliers
- On primitive trinomials (Mod 2)
- On primitive trinomials (mod 2), II
- On the polynomial residue number system (digital signal processing)
- On xn + x + 1 over GF(2)
- Progress in Cryptology - INDOCRYPT 2003
- Residue Number Scaling and Other Operations Using ROM Arrays
- The Montgomery inverse and its applications
Cited in
(22)- scientific article; zbMATH DE number 1857519 (Why is no real title available?)
- Efficient implementations of Gaussian elimination in finite fields on ASICs for MQ cryptographic systems
- Efficient hardware implementations of brw polynomials and tweakable enciphering schemes
- Bit-parallel arithmetic implementations over finite fields \(\text{GF}(2^m)\) with reconfigurable hardware
- scientific article; zbMATH DE number 1878332 (Why is no real title available?)
- Look-up table-based large finite field multiplication in memory constrained cryptosystems
- scientific article; zbMATH DE number 5066607 (Why is no real title available?)
- scientific article; zbMATH DE number 1424173 (Why is no real title available?)
- Efficient systolic multiplications in composite fields for cryptographic systems
- Very Compact Hardware Implementations of the Blockcipher CLEFIA
- Complexity of computation in finite fields
- Revisiting homomorphic encryption schemes for finite fields
- Efficient software-implementation of finite fields with applications to cryptography
- Hardware implementation of finite-field division
- A new bit-serial multiplier over \(GF(pm)\) using irreducible trinomials
- A survey of some recent bit-parallel \(\mathrm{GF}(2^n)\) multipliers
- scientific article; zbMATH DE number 545390 (Why is no real title available?)
- Cryptography arithmetic. Algorithms and hardware architectures
- scientific article; zbMATH DE number 1979305 (Why is no real title available?)
- Finite field arithmetic in large characteristic for classical and post-quantum cryptography
- Selected Areas in Cryptography
- Area-Time Efficient Computation of Niederreiter Encryption on QC-MDPC Codes for Embedded Hardware
This page was built for publication: Efficient hardware implementation of finite fields with applications to cryptography
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q850794)
