|
|||||
|
|
MRD Hashing |
|
| Authors: | R.?Safavi-naini mailto:rei@uow.edu.au" title=" rei@uow.edu.au" itemprop=" email" data-track=" click" data-track-action=" Email author" data-track-label=" " >Email author,C.?Charnes |
| Affiliation: | (1) School of IT and CS, University of Wollongong, Northfields Avenue, Wollongong, N.S.W, 2522, Australia;(2) School of Information Technology, Deakin University, 221 Burwood Highway, Burwood, Vic., 3125, Australia |
| Abstract: | We propose two new classes of hash functions which are motivated by Maximum Rank Distance (MRD) codes. We analise the security of these schemes. The system setup phase is computationally expensive for general field extensions. To overcome this limitation we derive an algebraic solution which avoids computations in special extension fields in the intended operational range of the hash functions. |
| Keywords: | MRD codes hashing functions Galois fields |
| 本文献已被 SpringerLink 等数据库收录！ | |