Open AccessFAST ALGORITHMS AND COMPUTING MEANS OF CRYPTOLOGICAL FUNCTIONS
Author(s) -
Andriy Horpenyuk
Publication year - 2014
Publication title -
computing
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.184
H-Index - 11
eISSN - 2312-5381
pISSN - 1727-6209
DOI - 10.47839/ijc.4.2.339
Subject(s) - computer science , domain (mathematical analysis) , cryptography , algorithm , limit (mathematics) , theoretical computer science , mathematics , mathematical analysis
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.