Generating large non-singular matrices over an arbitrary field with blocks of full rank
| dc.creator | Xiao, James | |
| dc.creator | Zhou, Yongxin | |
| dc.date | 2002-07-12 | |
| dc.date.accessioned | 2026-07-07T04:49:40Z | |
| dc.date.available | 2026-07-07T04:49:40Z | |
| dc.description | 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. | |
| dc.description | 6 | |
| dc.identifier | https://arxiv.org/abs/math/0207113 | |
| dc.identifier | http://arxiv.org/abs/math/0207113 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/64507 | |
| dc.subject | Rings and Algebras | |
| dc.subject | 15A09 | |
| dc.title | Generating large non-singular matrices over an arbitrary field with blocks of full rank | |
| dc.type | text |