Počet záznamů: 1
Remarks on Gödel's Code as a Hash Function
- 1.
SYSNO ASEP 0351385 Druh ASEP J - Článek v odborném periodiku Zařazení RIV J - Článek v odborném periodiku Poddruh J Článek ve WOS Název Remarks on Gödel's Code as a Hash Function Tvůrce(i) Mikuš, M. (SK)
Savický, Petr (UIVT-O) SAI, RID, ORCIDZdroj.dok. Tatra Mountains Mathematical Publications. - : Matematický ústav SAV - ISSN 1210-3195
Roč. 47, č. 3 (2010), s. 67-80Poč.str. 14 s. Jazyk dok. eng - angličtina Země vyd. SK - Slovensko Klíč. slova Gödel numbering function ; hash function ; rational reconstruction ; integer relation algorithm Vědní obor RIV BA - Obecná matematika CEP GAP202/10/1333 GA ČR - Grantová agentura ČR CEZ AV0Z10300504 - UIVT-O (2005-2011) UT WOS 000314316900004 DOI 10.2478/v10127-010-0031-8 Anotace In this paper we analyze a simple hash function introduced in a popular book PopCo by Scarlett Thomas that is based on well known Gödel's numbering function. The numbering function is very slow for practical use, however it is widely used in foundations of logic and computability theory. We show that the properties of the suggested hash function (computing the hash as a "shorter digest" of the long Gödel's number code) are not sufficient for cryptography. We introduce two ways how to construct meaningful collisions and in special cases also second-preimages. Further we propose a simple improvement of this hash function which prevents the simpler of the attacks, however this hasn't been successful for the second attack. Pracoviště Ústav informatiky Kontakt Tereza Šírová, sirova@cs.cas.cz, Tel.: 266 053 800 Rok sběru 2012 Elektronická adresa http://www.sav.sk/journals/uploads/0317151904m-s.pdf
Počet záznamů: 1