MRD hashing
Data(s) |
01/11/2005
|
---|---|
Resumo |
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.<br /> |
Identificador | |
Idioma(s) |
eng |
Publicador |
Springer |
Relação |
http://dro.deakin.edu.au/eserv/DU:30008915/n20051531.pdf http://dx.doi.org/10.1007/s10623-004-3988-y |
Direitos |
2005, Springer Science + Business Media Ιnc. |
Palavras-Chave | #MRD codes #hashing functions #Galois fields |
Tipo |
Journal Article |