Generating large non-singular matrices over an arbitrary field with blocks of full rank
classification
🧮 math.RA
keywords
matricesblocksfullgeneratinglargenon-singularrankalgorithms
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.