Small FPGA Implementations for Solving Systems of Linear Equations in Finite Fields

被引:0
|
作者
Yi, Haibo [1 ]
Li, Weijian [2 ]
机构
[1] Shenzhen Polytech, Sch Comp Engn, Shenzhen, Guangdong, Peoples R China
[2] Guangdong Polytech Normal Univ, Sch Comp Sci, Guangzhou, Guangdong, Peoples R China
关键词
solving systems of linear equations; Gaussian elimination; finite field; composite field; Field Programmable Gate Array (FPGA); GAUSSIAN-ELIMINATION; HARDWARE;
D O I
暂无
中图分类号
TP31 [计算机软件];
学科分类号
081202 ; 0835 ;
摘要
Solving systems of linear equations in finite fields is among the most fundamental operations and used extensively in areas of cryptography, signal processing and clustered file system. In order to implement such systems, it is desirable to improve solving systems of linear equations. We propose FPGA implementations for Gaussian elimination in finite fields. Experimental results and comparisons show that our designs provide significant reductions in both area and clock-area product.
引用
收藏
页码:561 / 564
页数:4
相关论文
共 50 条
  • [1] Parallel implementations of randomized vector algorithm for solving large systems of linear equations
    Karl K. Sabelfeld
    Sergey Kireev
    Anastasiya Kireeva
    The Journal of Supercomputing, 2023, 79 : 10555 - 10569
  • [2] Parallel implementations of randomized vector algorithm for solving large systems of linear equations
    Sabelfeld, Karl K.
    Kireev, Sergey
    Kireeva, Anastasiya
    JOURNAL OF SUPERCOMPUTING, 2023, 79 (10): : 10555 - 10569
  • [3] On Solving Systems of Diagonal Polynomial Equations Over Finite Fields
    Ivanyos, Gabor
    Santha, Miklos
    FRONTIERS IN ALGORITHMICS (FAW 2015), 2015, 9130 : 125 - 137
  • [4] Solving systems of diagonal polynomial equations over finite fields
    Ivanyos, Gabor
    Santha, Miklos
    THEORETICAL COMPUTER SCIENCE, 2017, 657 : 73 - 85
  • [5] SOLVING SPARSE LINEAR-EQUATIONS OVER FINITE-FIELDS
    WIEDEMANN, DH
    IEEE TRANSACTIONS ON INFORMATION THEORY, 1986, 32 (01) : 54 - 62
  • [6] Solving sparse linear systems of equations over finite fields using bit-flipping algorithm
    Mofrad, Asieh A.
    Sadeghi, M-R
    Panario, D.
    LINEAR ALGEBRA AND ITS APPLICATIONS, 2013, 439 (07) : 1815 - 1824
  • [7] Systems of random linear equations with small number of non-zero coefficients in finite fields
    Kolchin, VF
    PROBABILISTIC METHODS IN DISCRETE MATHEMATICS, 1997, : 295 - 304
  • [8] A removal lemma for systems of linear equations over finite fields
    Daniel Kráľ
    Oriol Serra
    Lluís Vena
    Israel Journal of Mathematics, 2012, 187 : 193 - 207
  • [9] A removal lemma for systems of linear equations over finite fields
    Kral', Daniel
    Serra, Oriol
    Vena, Lluis
    ISRAEL JOURNAL OF MATHEMATICS, 2012, 187 (01) : 193 - 207
  • [10] Iterative methods for solving linear systems of equations on FPGA-based machines
    Xu, XZ
    Ziavras, SG
    COMPUTERS AND THEIR APPLICATIONS, 2003, : 472 - 475