rsa-prime-factorization - Prime factorization is known as a way to crack the RSA cryptosystem code. Currently, most of the best modern factoring algorithms are based on the idea behind Fermat's method of factorization. This project explain how to use Fermat's method to find the prime factorization of a number.
M. Müller-Prove. Good Tags – Bad Tags. Social Tagging in der Wissensorganisation, том 47 из Medien in der Wissenschaft, стр. 15-22. Münster, New York, München, Berlin, Waxmann, (2008)
K. Tso-Sutter, L. Marinho, и L. Schmidt-Thieme. Proceedings of 23rd Annual ACM Symposium on Applied Computing (SAC'08), Fortaleza, Brazil, стр. 1995-1999. New York, NY, USA, ACM, (2008)
R. Jäschke, L. Marinho, A. Hotho, L. Schmidt-Thieme, и G. Stumme. Knowledge Discovery in Databases: PKDD 2007, 11th European Conference on Principles and Practice of Knowledge Discovery in Databases, том 4702 из Lecture Notes in Computer Science, стр. 506-514. Berlin, Heidelberg, Springer, (2007)
M. Blank, T. Bopp, T. Hampel, и J. Schulte. Good Tags - Bad Tags. Social Tagging in der Wissensorganisation, 47, стр. 85-97. Münster, New York, München, Berlin, Waxmann Verlag GmbH, (2008)