Generating large non-singular matrices over an arbitrary field with blocks of full rank

2002/07/12 by James Xiao, Xiao, James, Yongxin Zhou +1
Mathematics · #15A09 #FOS: Mathematics #Rings and Algebras (math.RA) #math.RA #msc:15A09

paper · pdf · doi:10.48550/arxiv.math/0207113

6

arxiv created 2002/07/12 · arxiv updated 2009/11/30

Abstract

This note describes a technique for generating large non-singular matrices with blocks of full rank. Our motivation to construct such matrices arises in the white-box implementation of cryptographic algorithms with S-boxes.

Related

• Black Box Linear Algebra: Extending Wiedemann's Analysis of a Sparse Matrix Preconditioner for Computations over Small Fields
• On matrices potentially useful for tree codes
• Generating matrices of highest order over a finite field
• High-Girth Matrices and Polarization
• Fooling-sets and rank in nonzero characteristic (extended abstract)