FAST ALGORITHMS AND COMPUTING MEANS OF CRYPTOLOGICAL FUNCTIONS

Authors

  • Andriy Horpenyuk

DOI:

https://doi.org/10.47839/ijc.4.2.339

Keywords:

Asymmetric cryptology, encryption, decryption, cipher opening, digital differential analyzer, digital integrator, digital analogues, pulse-number functional converter

Abstract

The problems of speed of asymmetric cryptology computational algorithms are analyzed in the article. There has been offered for the greater speed to apply computing facilities of analytical principle of functioning together with algorithmic computing facilities. There have been given fundamentals of synthesis of such facilities, considered problems that limit domain of their application in cryptography. There have been given research results, which expose the prospects of application domain expansion of such facilities.

References

. W.Diffie and M.E.Hellman, “New Directions in Cryptography”, IEEE Transactions on Information Theory, v. IT-22, n.6, Nov 1976, pp.644-654.

. R.C.Merkle, “Secure Communication Over Insecure Channels”, Communication of the ACM, v. 21, n.4, 1978, pp.294-299.

. A.V.Lunin, A.A.Salnikov “The prospects of development and application of assymmetric cryptography algorithms”. Confident, №10 – 1999.

. Maksymovych V., Dudykevych V., Gorpeniuk A. “New hardware for pulse fluxes processing”, Proceedings of the X Polish national conference "Application of microprocessors in automatic control and measurements", v.2.- Warsaw, Poland, 1996.- p.150-157.

. Maksymovych V., Dudykevych V., Horpenyuk A., “New hardware for pulse fluxes processing”, Application of microprocessors in automatic control and measurements: Proceedings of the X of Polish National conference. Warsaw, Poland, 1996.- p.150-157.

. M.O.Rabin, “Digital Signatures and Public-Key Functions as Intractable as Factorization”, MIT Laboratory for Computer Science, Technical Report MIT/LCS/TR-212, Jan 1979.

. Andriy Horpenyuk “Reversible pulse-numerical functional converters”,- Manuscript. Thesis for a Ph.D. science degree in speciality 05.13.05 - elements and units of computer technique and control systems. - State University “Lvivska Polytechnica”, Lviv, 1998.

Downloads

Published

2014-08-01

How to Cite

Horpenyuk, A. (2014). FAST ALGORITHMS AND COMPUTING MEANS OF CRYPTOLOGICAL FUNCTIONS. International Journal of Computing, 4(2), 69-76. https://doi.org/10.47839/ijc.4.2.339

Issue

2005, Volume 4, Issue 2

Section

Articles

License

International Journal of Computing is an open access journal. Authors who publish with this journal agree to the following terms:
•    Authors retain copyright and grant the journal right of first publication with the work simultaneously licensed under a Creative Commons Attribution License that allows others to share the work with an acknowledgement of the work's authorship and initial publication in this journal.
•    Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgement of its initial publication in this journal.
•    Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work.