Security of Poseidon hash function against non-binary differential and linear attacks
In this work we build the security estimations of Poseidon hash function against non-binary linear and differential attacks. We adduce the general parameters for the Poseidon hash function that allow using this hash function in recurrent SNARK-proofs based on MNT-4 and MNT-6 triplets. We also analys...
Збережено в:
| Видавець: | Інститут кібернетики ім. В.М. Глушкова НАН України |
|---|---|
| Дата: | 2021 |
| Автори: | , , |
| Формат: | Стаття |
| Мова: | English |
| Опубліковано: |
Інститут кібернетики ім. В.М. Глушкова НАН України
2021
|
| Назва видання: | Кібернетика та системний аналіз |
| Теми: | |
| Онлайн доступ: | http://dspace.nbuv.gov.ua/handle/123456789/190653 |
| Теги: |
Додати тег
Немає тегів, Будьте першим, хто поставить тег для цього запису!
|
| Цитувати: | Security of Poseidon hash function against non-binary differential and linear attacks / L. Kovalchuk, R. Oliynykov, M. Rodinko // Кібернетика та системний аналіз. — 2021. — Т. 57, № 2. — С. 115–127. — Бібліогр.: 20 назв. — англ. |
Репозиторії
Digital Library of Periodicals of National Academy of Sciences of Ukraine| Резюме: | In this work we build the security estimations of Poseidon hash function against non-binary linear and differential attacks. We adduce the general parameters for the Poseidon hash function that allow using this hash function in recurrent SNARK-proofs based on MNT-4 and MNT-6 triplets. We also analysed how to choose S-boxes for such function for this choice to be optimal from the point of view of the number of constraints and security. We also showed how many full rounds is sufficient to guarantee security of such hash function against non-binary linear and differential attacks and calculated the number of constraints per bit that is achieved in the proposed realizations demonstrating a considerable gain was demonstrated, as compared to the Pedersen hash function. |
|---|