Art

J-GLOBAL ID：200902202452016439   Reference number：07A0969377

Indifferentiability of Single-Block-Length and Rate-1 Compression Functions

単一ブロック長およびレート1圧縮関数の識別不能性

Author (2)： KUWAKADO Hidenori (Kobe Univ., Kobe-shi, JPN) ,  MORII Masakatu (Kobe Univ., Kobe-shi, JPN)
Material： IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences (Institute of Electronics, Information and Communication Engineers)  (IEICE Trans Fundam Electron Commun Comput Sci (Inst Electron Inf Commun Eng))
Volume： E90-A  Issue： 10  Page： 2301-2308  Publication year： Oct. 01, 2007 
JST Material Number： F0699C  ISSN： 0916-8508  Document type： Article
Article type： 原著論文  Country of issue： Japan (JPN)  Language： ENGLISH (EN)

Thesaurus term： cryptogram ,...
Semi thesaurus term： computational complexity

   To see more with JDream III (charged).   {{ this.onShowAbsJLink("http://jdream3.com/lp/jglobal/index.html?docNo=07A0969377&from=J-GLOBAL&jstjournalNo=F0699C") }}

JST classification (1)： Code theory  (ND02030R)

Reference (20)：

• KUWAKADO, H. Indifferentiability of single-block-length and rate-1 compression functions. Cryptology ePrint Archive Report 2006/485. 2006
• DAMGARD, I. B. Collision free hash functions and public key signature schemas. Advances in Cryptology-EUROCRYPT'87. 1988, 203-216
• MERKLE, R. C. One way hash functions and DES. Advances in Cryptology-CRYPTO'89. 1990, 428-446
• CORON, J. S. Merkle-Damgard revisited : How to construct a hash function. Advances in Cryptology-CRYPTO 2005. 2005, 430-448
• LUCKS, S. A failure-friendly design principle for hash functions. Advances in Cryptology-ASIACRYPT 2005. 2005, 474-494

Terms in the title (3)： レート ,  圧縮関数 ,  識別