default search action
Boris S. Verkhovsky
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2011
- [j16]Boris S. Verkhovsky:
Scheme for Secure Communication via Information Hiding Based on Key Exchange and Decomposition Protocols. Int. J. Commun. Netw. Syst. Sci. 4(2): 77-81 (2011) - [j15]Boris S. Verkhovsky:
Information Protection Based on Extraction of Square Roots of Gaussian Integers. Int. J. Commun. Netw. Syst. Sci. 4(3): 133-138 (2011) - [j14]Boris S. Verkhovsky:
Cubic Root Extractors of Gaussian Integers and Their Application in Fast Encryption for Time-Constrained Secure Communication. Int. J. Commun. Netw. Syst. Sci. 4(4): 197-204 (2011) - [j13]Boris S. Verkhovsky:
Protection of Sensitive Messages Based on Quadratic Roots of Gaussians: Groups with Complex Modulus. Int. J. Commun. Netw. Syst. Sci. 4(5): 287-296 (2011) - [j12]Boris S. Verkhovsky:
Space Complexity of Algorithm for Modular Multiplicative Inverse. Int. J. Commun. Netw. Syst. Sci. 4(6): 357-363 (2011) - [j11]Boris S. Verkhovsky:
Double-Moduli Gaussian Encryption/Decryption with Primary Residues and Secret Controls. Int. J. Commun. Netw. Syst. Sci. 4(7): 475-481 (2011) - [j10]Boris S. Verkhovsky:
Astronomical Algorithms: Amended Multi-Millennia Calendar. Int. J. Commun. Netw. Syst. Sci. 4(8): 483-486 (2011) - [j9]Boris S. Verkhovsky:
Parallel Minimax Searching Algorithm for Extremum of Unimodal Unbounded Function. Int. J. Commun. Netw. Syst. Sci. 4(9): 549-561 (2011) - [j8]Boris S. Verkhovsky:
Integer Factorization of Semi-Primes Based on Analysis of a Sequence of Modular Elliptic Equations. Int. J. Commun. Netw. Syst. Sci. 4(10): 609-615 (2011) - [j7]Boris S. Verkhovsky:
Algorithms for Integer Factorization Based on Counting Solutions of Various Modular Equations. Int. J. Commun. Netw. Syst. Sci. 4(11): 675-682 (2011) - [j6]Aleksey Koval, Frank Y. Shih, Boris S. Verkhovsky:
A Pseudo-Random Pixel Rearrangement Algorithm Based on Gaussian Integers for Image Watermarking. J. Inf. Hiding Multim. Signal Process. 2(1) (2011) - 2010
- [j5]Boris S. Verkhovsky:
Hybrid Authentication Cybersystem Based on Discrete Logarithm, Factorization and Array Entanglements. Int. J. Commun. Netw. Syst. Sci. 3(7): 579-584 (2010) - [j4]Boris S. Verkhovsky:
Potential Vulnerability of Encrypted Messages: Decomposability of Discrete Logarithm Problems. Int. J. Commun. Netw. Syst. Sci. 3(8): 639-644 (2010) - [j3]Boris S. Verkhovsky:
Winning Strategies and Complexity of Nim-Type Computer Game on Plane. Int. J. Commun. Netw. Syst. Sci. 3(10): 793-800 (2010) - [j2]Boris S. Verkhovsky:
Service Networks Topological Design. Int. J. Commun. Netw. Syst. Sci. 3(11): 850-854 (2010) - [j1]Boris S. Verkhovsky:
Enhanced Euclid Algorithm for Modular Multiplicative Inverse and Its Application in Cryptographic Protocols. Int. J. Commun. Netw. Syst. Sci. 3(12): 901-906 (2010) - [i1]Boris S. Verkhovsky:
Design of Optimal Topology of Satellite-Based Terrestrial Communication Networks. CoRR abs/1002.3326 (2010)
2000 – 2009
- 2009
- [c4]Boris S. Verkhovsky, Roberto D. Rubino:
Internal Corporative Security: Protocols Preventing Leakage of Sensitive Information and Assuring Authorized Network Traffic in the Domain of Gaussian Integers. SEDE 2009: 244-249 - 2008
- [c3]Aleksey Koval, Boris S. Verkhovsky:
Analysis of RSA over Gaussian Integers Algorithm. ITNG 2008: 101-105 - [c2]Boris S. Verkhovsky:
Information Assurance and Secure Streaming Algorithm Based on Cubic Roots of Integers. ITNG 2008: 910-915 - [c1]Aleksey Koval, Boris S. Verkhovsky:
Cryptosystem Based on Extraction of Square Roots of Complex Integers. ITNG 2008: 1190-1191
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-20 23:02 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: