Log in to save to my catalogue

New indifferentiability security proof of MDPH hash function

New indifferentiability security proof of MDPH hash function

https://devfeature-collection.sl.nsw.gov.au/record/TN_cdi_doaj_primary_oai_doaj_org_article_cb8b640e52d24b41965f34faf9f9f294

New indifferentiability security proof of MDPH hash function

About this item

Full title

New indifferentiability security proof of MDPH hash function

Publisher

John Wiley & Sons, Inc

Journal title

IET information security, 2022-07, Vol.16 (4), p.262-281

Language

English

Formats

Publication information

Publisher

John Wiley & Sons, Inc

More information

Scope and Contents

Contents

MDPH is a double‐block‐length hash function proposed by Naito at Latincrypt 2019. This is a combination of Hirose's compression function and the domain extender called Merkle–Damgård with permutation. When instantiated with an n‐bit block cipher, Naito proved that this achieves the (nearly) optimal indifferentiable security bound of O (n − log n)‐b...

Alternative Titles

Full title

New indifferentiability security proof of MDPH hash function

Authors, Artists and Contributors

Identifiers

Primary Identifiers

Record Identifier

TN_cdi_doaj_primary_oai_doaj_org_article_cb8b640e52d24b41965f34faf9f9f294

Permalink

https://devfeature-collection.sl.nsw.gov.au/record/TN_cdi_doaj_primary_oai_doaj_org_article_cb8b640e52d24b41965f34faf9f9f294

Other Identifiers

ISSN

1751-8709

E-ISSN

1751-8717

DOI

10.1049/ise2.12058

How to access this item