350 rub
Journal Highly available systems №3 for 2013 г.
Article in number:
Developing an algorithm for public key cryptography and its application for building a secure data storage
Authors:
N.E. Arykov - student, Novosibirsk State University, Department of Information Technology, intern in development Parallels, Inc. E-mail: nikita.arykov@gmail.com
S F. Krendelev - Ph.D. (Phys.-Math.), Associate Professor, Novosibirsk State University. E-mail: s.f.krendelev@gmail.com
E.O. Spitsyna - Student, Novosibirsk State University, Department of Information Technology, junior developer Parallels, Inc. E-mail: k.spitsyna@gmail.com
Abstract:
During this research the existing cryptographic solutions of protecting confidential data were analyzed and the basic their problem was formulated - a small number of secret parameters. This paper describes an algorithm that depends on a large number of secret parameters, based on one-to-one functions and two applications that allow to encrypt user passwords.
Pages: 14-18
References

  1. Varnovskij N. P.  Gomomorfnoe shifrovanie // Trudy' Instituta Sistemnogo Programmirovaniya. T.12. M.: ISP RAN. 2007. S. 27 - 36.
  2. Lidl R. Konechny'e polya. M.: Mir. 1988. 808 s.
  3. Boneh D., Lipton J.R. Algorithms for black-box fields and their application to cryptography // 16th Annual International Cryptology Conference. 1996. T. 1109. S. 283-297.
  4. Krendelev S.F., Spiczy'na E.O. Chislo 667. Proverka RSA na ustojchivost'. Variant kriptografii s otkry'ty'm klyuchom // Sistemy' vy'sokoj dostupnosti. 2011. T. 7. № 2. C. 34-38.
  5. Gosney J.M. Password Cracking HPC // Passwords^12 Security Conference. 2012. [E'lektronny'j resurs]. URL: http://passwords12.at.ifi.uio.no/ Jeremi_Gosney_Password_Cracking_HPC_Passwords12.pdf.