Name
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. |
Year | DOI | Venue |
|---|---|---|
2005 | 10.1007/s10623-004-3988-y | Des. Codes Cryptography |
Keywords | DocType | Volume |
algebraic solution,hash function,MRD Hashing,special extension field,hashing functions,new class,general field extension,galois fields,Maximum Rank Distance,intended operational range,mrd codes,system setup phase | Journal | 37 |
Issue | Citations | PageRank |
2 | 0 | 0.34 |
References | Authors | |
10 | 2 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| R. Safavi-Naini | 1 | 173 | 17.60 |
| C. Charnes | 2 | 7 | 2.38 |