Efficient generation of random nonsingular matrices

DOI10.1002/rsa.3240040108zbMath0793.65032OpenAlexW2006181434MaRDI QIDQ4034712

Dana Randall

Publication date: 16 May 1993

Published in: Random Structures & Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/rsa.3240040108

zbMATH Keywords

algorithmfinite fieldrandom matrixnonsingulargeneration of random nonsingular matrices

Mathematics Subject Classification ID

Matrices over special rings (quaternions, finite fields, etc.) (15B33) Random matrices (algebraic aspects) (15B52)

Related Items

Take your MEDS: digital signatures from matrix code equivalence, Unnamed Item, Computer algebra tales on Goppa codes and McEliece cryptography, Self-testing/correcting with applications to numerical problems