Have a personal or library account? Click to login
Remarks on Gödel’s code as a hash function Cover
By: Michal Mikuš and  Petr Savicky  
Open Access
|Nov 2012

References

  1. [1] THOMAS, S.: PopCo. Fourth State, Edinburgh, 2004.
  2. [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.
  3. [3] WIENER, M. J.: Bounds on Birthday Attack Times. IACR Cryptology ePrint Archive, Report 2005/318, 2005, http://eprint.iacr.org/2005/318.
  4. [4] G¨odel, Wikipedia article, http://en.wikipedia.org/wiki/Goedel.
  5. [5] Integer relation, Wikipedia article, http://en.wikipedia.org/wiki/Integer relation.
  6. [6] SHOUP, V.: A Computational Introduction to Number Theory and Algebra. Cambridge University Press, Cambridge, 2005.10.1017/CBO9781139165464
  7. [7] SHOUP, V.: NTL: A Library for doing Number Theory, http://www.shoup.net/ntl.
  8. [8] YAP, CH. K.: Fundamental Problems in Algorithmic Algebra. Oxford University Press, Oxford, 2000.
  9. [9] LiDIA, a C++ Library for Computational Number Theory, http://www.cdc.informatik.tu-darmstadt.de/TI/LiDIA/.
  10. [10] KNUTH, D.: The Art of Computer Programming, Vol. 2: Seminumerical Algorithms (3rd ed.), Addison-Wesley Co., Reading, Massachusetts, 1997.
  11. [11] BARLOW, J. L.-BAREISS, E. H.: On roundoff error distributions in floating point and logarithmic arithmetic, Computing 34 (1985), 325-347.10.1007/BF02251833
DOI: https://doi.org/10.2478/v10127-010-0031-8 | Journal eISSN: 1338-9750 | Journal ISSN: 12103195
Language: English
Page range: 67 - 80
Published on: Nov 13, 2012
Published by: Slovak Academy of Sciences, Mathematical Institute
In partnership with: Paradigm Publishing Services
Publication frequency: 3 issues per year

© 2012 Michal Mikuš, Petr Savicky, published by Slovak Academy of Sciences, Mathematical Institute
This work is licensed under the Creative Commons License.