Permutation-Based Hashing Beyond the Birthday Bound
It is known that the sponge construction is tightly indifferentiable from a random oracle up to around 2c/2 queries, where c is the capacity. In particular, it cannot provide generic security better than half of the underlying permutation size. In this paper, we aim to achieve hash function securit...
Збережено в:
| Автори: | , |
|---|---|
| Формат: | Artigo |
| Мова: | Inglês |
| Опубліковано: |
Ruhr-Universität Bochum
2024-03-01
|
| Серія: | IACR Transactions on Symmetric Cryptology |
| Предмети: | |
| Онлайн доступ: | https://tosc.iacr.org/index.php/ToSC/article/view/11402 |
| Теги: |
Немає тегів, Будьте першим, хто поставить тег для цього запису!
|