Efficient implementations of Gaussian elimination in finite fields on ASICs for MQ cryptographic systems
From MaRDI portal
(Redirected from Publication:5031901)
Recommendations
- Efficient hardware implementation of finite fields with applications to cryptography
- Efficient software-implementation of finite fields with applications to cryptography
- scientific article; zbMATH DE number 1962149
- Efficient bit-parallel multipliers over finite fields GF(2ᵐ)
- scientific article; zbMATH DE number 2058638
- Efficient finite field multiplication for isogeny based post quantum cryptography
- EFFICIENT PARALLEL GAUSSIAN NORMAL BASES MULTIPLIERS OVER FINITE FIELDS
- Efficient Implementation of Punctured Parallel Finite Field Multipliers
- Bit-parallel arithmetic implementations over finite fields \(\text{GF}(2^m)\) with reconfigurable hardware
- Low complexity bit-parallel multipliers for a class of finite fields
Cites work
- MaxMinMax problem and sparse equations over finite fields
- Parallel direct solver for solving systems of linear equations resulting from finite element method on multi-core desktops and workstations
- SEBSM-Based Iterative Method for Solving Large Systems of Linear Equations and Its Applications in Engineering Computation
- Solution to fuzzy system of linear equations with crisp coefficients
- Solving sparse linear systems of equations over finite fields using bit-flipping algorithm
- The NP-completeness column
Cited in
(4)- Area-Time Efficient Computation of Niederreiter Encryption on QC-MDPC Codes for Embedded Hardware
- Efficient Implementations of MQPKS on Constrained Devices
- Recursive construction of normal polynomials over finite fields
- Efficient hardware implementation of finite fields with applications to cryptography
This page was built for publication: Efficient implementations of Gaussian elimination in finite fields on ASICs for MQ cryptographic systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5031901)
