Generating Large Non-Singular Matrices over an Arbitrary Field with Blocks of Full Rank

James Xiao; Yongxin Zhou

Paper 2002/096

Generating Large Non-Singular Matrices over an Arbitrary Field with Blocks of Full Rank

James Xiao and Yongxin Zhou

Abstract

This note describes a technique for generating large non-singular matrices with blocks of full rank. While this may be of independent interest, our motivation arises in the white-box implementation of cryptographic algorithms with S-boxes.

Metadata

Available format(s): PDF PS
Category: Foundations
Publication info: Published elsewhere. Unknown where it was published
Keywords: foundations
Contact author(s): yongxin zhou @ cloakware com
History: 2002-07-16: revised; 2002-07-15: received; See all versions
Short URL: https://ia.cr/2002/096
License: CC BY

BibTeX

@misc{cryptoeprint:2002/096,
      author = {James Xiao and Yongxin Zhou},
      title = {Generating Large Non-Singular Matrices over an Arbitrary Field with Blocks of Full Rank},
      howpublished = {Cryptology ePrint Archive, Paper 2002/096},
      year = {2002},
      note = {\url{https://eprint.iacr.org/2002/096}},
      url = {https://eprint.iacr.org/2002/096}
}