Zobrazeno 1 - 10
of 52
pro vyhledávání: '"Boris S Verkhovsky"'
Autor:
Boris S Verkhovsky
Integer Algorithms in Cryptology and Information Assurance is a collection of the author's own innovative approaches in algorithms and protocols for secret and reliable communication. It concentrates on the “what” and “how” behind implementin
Autor:
Boris S. Verkhovsky
Publikováno v:
International Journal of Communications, Network and System Sciences. :77-81
This paper describes an algorithm for secure transmission of information via open communication channels based on the discrete logarithm problem. The proposed algorithm also provides sender identification (digital signature). It is twice as fast as t
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::7fc9a7b93a293d35e8ec33ee04b623b2
https://doi.org/10.4236/ijcns.2013.62009
https://doi.org/10.4236/ijcns.2013.62009
Autor:
Boris S. Verkhovsky
Publikováno v:
International Journal of Communications, Network and System Sciences. :437-445
Several algorithms based on homogeneous polynomials for multiplication of large integers are described in the paper. The homogeneity of polynomials provides several simplifications: reduction of system of equations and elimination of necessity to eva
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::b40dd9b272e12d4fa969fbf967ba860c
https://doi.org/10.4236/ijcns.2012.58054
https://doi.org/10.4236/ijcns.2012.58054
Autor:
Boris S. Verkhovsky
Publikováno v:
International Journal of Communications, Network and System Sciences. :715-719
Primitive elements play important roles in the Diffie-Hellman protocol for establishment of secret communication keys, in the design of the ElGamal cryptographic system and as generators of pseudo-random numbers. In general, a deterministic algorithm
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::0faa020dbd51c77fb88330300cfc1a97
https://doi.org/10.4236/ijcns.2012.511074
https://doi.org/10.4236/ijcns.2012.511074
Autor:
Boris S. Verkhovsky
Publikováno v:
International Journal of Communications, Network and System Sciences. :513-519
Prime integers and their generalizations play important roles in protocols for secure transmission of information via open channels of telecommunication networks. Generation of multidigit large primes in the design stage of a cryptographic system is
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::e04458491536b4506effce446d901955
https://doi.org/10.4236/ijcns.2012.59062
https://doi.org/10.4236/ijcns.2012.59062
Autor:
Boris S. Verkhovsky
Publikováno v:
International Journal of Communications, Network and System Sciences. :1-6
This paper provides several generalizations of Gauss theorem that counts points on special elliptic curves. It is demonstrated how to implement these generalizations for computation of complex primes, which are applicable in several protocols providi
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::4f1102db5bf0c0b7dc9b48db75488433
https://doi.org/10.4236/ijcns.2012.51001
https://doi.org/10.4236/ijcns.2012.51001
Autor:
Roberto D. Rubino, Boris S. Verkhovsky
Publikováno v:
Int'l J. of Communications, Network and System Sciences. :245-252
Securing large corporate communication networks has become an increasingly difficult task. Sensitive information routinely leaves the company network boundaries and falls into the hands of unauthorized users. New techniques are required in order to c
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::a7b348f3628c2aeb7c627dac95959810
https://doi.org/10.4236/ijcns.2012.55033
https://doi.org/10.4236/ijcns.2012.55033
Autor:
Boris S. Verkhovsky
Publikováno v:
International Journal of Communications, Network and System Sciences. :549-561
In this paper we consider a parallel algorithm that detects the maximizer of unimodal function f(x) computable at every point on unbounded interval (0, ∞). The algorithm consists of two modes: scanning and detecting. Search diagrams are introduced
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::953bf3fb53410427625be106d739f855
https://doi.org/10.4236/ijcns.2011.49066
https://doi.org/10.4236/ijcns.2011.49066
Autor:
Boris S. Verkhovsky
Publikováno v:
International Journal of Communications, Network and System Sciences. :197-204
There are settings where encryption must be performed by a sender under a time constraint. This paper de-scribes an encryption/decryption algorithm based on modular arithmetic of complex integers called Gaus-sians. It is shown how cubic extractors op
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::0b6d80867ac545ff8785728d91eeab14
https://doi.org/10.4236/ijcns.2011.44024
https://doi.org/10.4236/ijcns.2011.44024
Autor:
Boris S. Verkhovsky
Publikováno v:
International Journal of Communications, Network and System Sciences. :475-481
In this paper an encryption-decryption algorithm based on two moduli is described: one in the real field of integers and another in the field of complex integers. Also the proper selection of cryptographic system parameters is described. Several nume
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::3a16a0e68d30f06dd8d4db4b7b746e7b
https://doi.org/10.4236/ijcns.2011.47058
https://doi.org/10.4236/ijcns.2011.47058