Efficient implementations of Gaussian elimination in finite fields on ASICs for MQ cryptographic systems

DOI10.1080/09720529.2018.1449354zbMath1481.94128OpenAlexW2804611337MaRDI QIDQ5031901

No author found.

Publication date: 16 February 2022

Published in: Journal of Discrete Mathematical Sciences and Cryptography (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/09720529.2018.1449354

zbMATH Keywords

finite fieldGaussian eliminationsolving systems of linear equationsapplication specific integrated circuit (ASIC)multivariate quadratic (MQ)

Mathematics Subject Classification ID

Cryptography (94A60) Combinatorial codes (94B25) Linear equations (linear algebraic aspects) (15A06)

Related Items (1)

Recursive construction of normal polynomials over 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
• Solving sparse linear systems of equations over finite fields using bit-flipping algorithm
• SEBSM-Based Iterative Method for Solving Large Systems of Linear Equations and Its Applications in Engineering Computation
• The NP-completeness column
• Solution to Fuzzy System of Linear Equations with Crisp Coefficients

This page was built for publication: Efficient implementations of Gaussian elimination in finite fields on ASICs for MQ cryptographic systems