MJH: A faster alternative to MDC-2
| DC Field | Value | Language |
|---|---|---|
| dc.contributor.author | Lee, Jooyoung | ko |
| dc.contributor.author | Stam, Martijn | ko |
| dc.date.accessioned | 2017-08-02T08:46:39Z | - |
| dc.date.available | 2017-08-02T08:46:39Z | - |
| dc.date.created | 2017-07-20 | - |
| dc.date.created | 2017-07-20 | - |
| dc.date.issued | 2011-02-14 | - |
| dc.identifier.citation | 11th Cryptographers' Track at the RSA Conference 2011: Topics in Cryptology, CT-RSA 2011, pp.213 - 236 | - |
| dc.identifier.uri | http://hdl.handle.net/10203/224966 | - |
| dc.description.abstract | In this paper, we introduce a new class of double-block-length hash functions. In the ideal cipher model (for n-bit blocks), we prove that these hash functions, dubbed MJH, are provably collision resistant up to O(2 | - |
| dc.language | English | - |
| dc.publisher | RSA | - |
| dc.title | MJH: A faster alternative to MDC-2 | - |
| dc.type | Conference | - |
| dc.type.rims | CONF | - |
| dc.citation.beginningpage | 213 | - |
| dc.citation.endingpage | 236 | - |
| dc.citation.publicationname | 11th Cryptographers' Track at the RSA Conference 2011: Topics in Cryptology, CT-RSA 2011 | - |
| dc.identifier.conferencecountry | US | - |
| dc.identifier.conferencelocation | San Francisco, CA | - |
| dc.identifier.doi | 10.1007/978-3-642-19074-2_15 | - |
| dc.contributor.localauthor | Lee, Jooyoung | - |
| dc.contributor.nonIdAuthor | Stam, Martijn | - |
- Appears in Collection
- CS-Conference Papers(학술회의논문)
- Files in This Item
- There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.