Difference between revisions of "MAME"
From The ECRYPT Hash Function Website
Mschlaeffer (talk | contribs) |
(→Best Known Results) |
||
| (3 intermediate revisions by 2 users not shown) | |||
| Line 1: | Line 1: | ||
== Specification == | == Specification == | ||
| + | * digest size: 256 bits | ||
<!-- | <!-- | ||
| − | |||
* max. message length: < 2<sup>64</sup> bits | * max. message length: < 2<sup>64</sup> bits | ||
| − | |||
--> | --> | ||
| − | * Specification: http:// | + | * compression function: 256-bit message block, 256-bit chaining variable |
| + | * Specification: [http://www.sdl.hitachi.co.jp/english/news/2007/ches/ MAME], [http://dx.doi.org/10.1007/978-3-540-74735-2_11 CHES07] | ||
<bibtex> | <bibtex> | ||
| − | @ | + | @inproceedings{chesYoshidaWOKWKP07, |
| − | author = {Hirotaka Yoshida and Dai Watanabe and Katsuyuki Okeya and Jun Kitahara and Hongjun Wu and Ozgul Kucuk and Bart Preneel}, | + | author = {Hirotaka Yoshida and Dai Watanabe and Katsuyuki Okeya and Jun Kitahara and Hongjun Wu and Ozgul Kucuk and Bart Preneel}, |
| − | title = {MAME: A | + | title = {MAME: A Compression Function with Reduced Hardware Requirements}, |
| − | + | booktitle = {CHES}, | |
| − | + | year = {2007}, | |
| − | abstract = {This paper describes a new compression function, MAME designed for hardware-oriented hash functions which can be used in applications reduced hardware requirements. MAME takes a 256-bit message block and a 256-bit chaining variable as input and produces a 256-bit output. | + | pages = {148-165}, |
| − | + | url = {http://dx.doi.org/10.1007/978-3-540-74735-2_11}, | |
| + | editor = {Pascal Paillier and Ingrid Verbauwhede}, | ||
| + | publisher = {Springer}, | ||
| + | series = {LNCS}, | ||
| + | volume = {4727}, | ||
| + | isbn = {978-3-540-74734-5}, | ||
| + | abstract = {This paper describes a new compression function, MAME designed for hardware-oriented hash functions which can be used in applications with reduced hardware requirements. MAME takes a 256-bit message block and a 256-bit chaining variable as input and produces a 256-bit output. In the light of recent attacks on MD5 and SHA-1, our design strategy is very conservative, and we show that our compression function is secure against various kinds of widely known attacks with very large security margins. The simple logical operations and the hardware efficient S-boxes are used to achieve a hardware implementation of MAME requiring only 8.1 Kgates on 0.18 $\micro m$ technology.}, | ||
} | } | ||
</bibtex> | </bibtex> | ||
| Line 23: | Line 29: | ||
=== Best Known Results === | === Best Known Results === | ||
| − | + | No attacks known. | |
---- | ---- | ||
Latest revision as of 12:51, 10 November 2008
Contents
1 Specification
- digest size: 256 bits
- compression function: 256-bit message block, 256-bit chaining variable
- Specification: MAME, CHES07
Hirotaka Yoshida, Dai Watanabe, Katsuyuki Okeya, Jun Kitahara, Hongjun Wu, Ozgul Kucuk, Bart Preneel - MAME: A Compression Function with Reduced Hardware Requirements
- CHES 4727:148-165,2007
- http://dx.doi.org/10.1007/978-3-540-74735-2_11
BibtexAuthor : Hirotaka Yoshida, Dai Watanabe, Katsuyuki Okeya, Jun Kitahara, Hongjun Wu, Ozgul Kucuk, Bart Preneel
Title : MAME: A Compression Function with Reduced Hardware Requirements
In : CHES -
Address :
Date : 2007
2 Cryptanalysis
2.1 Best Known Results
No attacks known.
