Cryptology ePrint Archive: Report 2008/355

An argument for rank metric

Vadym Fedyukovych

Abstract: A protocol is introduced to show an upper bound for rank of a square matrix

Category / Keywords: cryptographic protocols / Matrix rank, argument protocol, Schwartz-Zipel lemma, zero knowledge

Publication Info: unpublished

Date: received 16 Aug 2008, last revised 16 Aug 2008

Contact author: vf at unity net

Available format(s): Postscript (PS) | Compressed Postscript (PS.GZ) | PDF | BibTeX Citation

Version: 20080818:184553 (All versions of this report)

Discussion forum: Show discussion | Start new discussion

[ Cryptology ePrint archive ]