CryptoDB
Generating Large Non-Singular Matrices over an Arbitrary Field with Blocks of Full Rank
Authors: | |
---|---|
Download: | |
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. |
BibTeX
@misc{eprint-2002-11619, title={Generating Large Non-Singular Matrices over an Arbitrary Field with Blocks of Full Rank}, booktitle={IACR Eprint archive}, keywords={foundations / foundations}, url={http://eprint.iacr.org/2002/096}, note={ yongxin.zhou@cloakware.com 11884 received 15 Jul 2002, last revised 16 Jul 2002}, author={James Xiao and Yongxin Zhou}, year=2002 }