Cryptology ePrint Archive: Report 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.
Category / Keywords: foundations / foundations
Date: received 15 Jul 2002, last revised 16 Jul 2002
Contact author: yongxin zhou at cloakware com
Available format(s): Postscript (PS) | Compressed Postscript (PS.GZ) | PDF | BibTeX Citation
Version: 20020716:153836 (All versions of this report)
Short URL: ia.cr/2002/096
Discussion forum: Show discussion | Start new discussion
[ Cryptology ePrint archive ]