Remarks on Gödel’s code as a hash function

[1] THOMAS, S.: PopCo. Fourth State, Edinburgh, 2004.Search in Google Scholar

[2] MENEZES, A.-VAN OORSCHOT, P. C.-VANSTONE, S. A.: Handbook of AppliedCryptography. CRC Press Ser. on Discrete Math. Appl., CRC Press, Boca Raton, FL, 1997.Search in Google Scholar

[3] WIENER, M. J.: Bounds on Birthday Attack Times. IACR Cryptology ePrint Archive, Report 2005/318, 2005, http://eprint.iacr.org/2005/318.Search in Google Scholar

[4] G¨odel, Wikipedia article, http://en.wikipedia.org/wiki/Goedel.Search in Google Scholar

[5] Integer relation, Wikipedia article, http://en.wikipedia.org/wiki/Integer relation.Search in Google Scholar

[6] SHOUP, V.: A Computational Introduction to Number Theory and Algebra. Cambridge University Press, Cambridge, 2005.10.1017/CBO9781139165464Search in Google Scholar

[7] SHOUP, V.: NTL: A Library for doing Number Theory, http://www.shoup.net/ntl.Search in Google Scholar

[8] YAP, CH. K.: Fundamental Problems in Algorithmic Algebra. Oxford University Press, Oxford, 2000.Search in Google Scholar

[9] LiDIA, a C++ Library for Computational Number Theory, http://www.cdc.informatik.tu-darmstadt.de/TI/LiDIA/.Search in Google Scholar

[10] KNUTH, D.: The Art of Computer Programming, Vol. 2: Seminumerical Algorithms (3rd ed.), Addison-Wesley Co., Reading, Massachusetts, 1997.Search in Google Scholar

[11] BARLOW, J. L.-BAREISS, E. H.: On roundoff error distributions in floating point and logarithmic arithmetic, Computing 34 (1985), 325-347.10.1007/BF02251833Search in Google Scholar