Weimar-DM: A Highly Secure Double-Length Compression Function-Reference-Cited by-同舟云学术

Weimar-DM: A Highly Secure Double-Length Compression Function

Published:2012 Issue: Volume: Page:152-165
ISSN:0302-9743
Container-title:Information Security and Privacy
language:
Short-container-title:

Author:

Fleischmann Ewan,Forler Christian,Lucks Stefan,Wenzel Jakob

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-642-31448-3_12.pdf

Reference43 articles.

1. Lecture Notes in Computer Science;F. Armknecht,2011

2. Lecture Notes in Computer Science;J.A. Black,2002

3. Lecture Notes in Computer Science;J.W. Bos,2011

4. Lecture Notes in Computer Science,1995

5. Brachtl, B., Coppersmith, D., Hyden, M.M., Meyer, C.H., Matyas, S.M., Oseas, J., Pilpel, S., Schilling, M.: Data authentication using modification detection codes based on a public one way encryption function. U.S. Patent No. 4,908,861, March 13 (1990)

Cited by 9 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. On the Security of the Double-Block-Length Hash Function NCASH;Applications and Techniques in Information Security;2019

2. Optimally Indifferentiable Double-Block-Length Hashing Without Post-processing and with Support for Longer Key Than Single Block;Progress in Cryptology – LATINCRYPT 2019;2019

3. Indifferentiability of Double-Block-Length Hash Function Without Feed-Forward Operations;Information Security and Privacy;2017

4. Variable message encryption through blockcipher compression function;Concurrency and Computation: Practice and Experience;2016-10-12

5. An Efficient Construction of a Compression Function for Cryptographic Hash;Lecture Notes in Computer Science;2016