Boris S. Verkhovsky

According to our database1, Boris S. Verkhovsky authored at least 21 papers between 2008 and 2011.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of five.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2011
A Pseudo-Random Pixel Rearrangement Algorithm Based on Gaussian Integers for Image Watermarking.
J. Inf. Hiding Multim. Signal Process., 2011

Algorithms for Integer Factorization Based on Counting Solutions of Various Modular Equations.
Int. J. Commun. Netw. Syst. Sci., 2011

Integer Factorization of Semi-Primes Based on Analysis of a Sequence of Modular Elliptic Equations.
Int. J. Commun. Netw. Syst. Sci., 2011

Parallel Minimax Searching Algorithm for Extremum of Unimodal Unbounded Function.
Int. J. Commun. Netw. Syst. Sci., 2011

Astronomical Algorithms: Amended Multi-Millennia Calendar.
Int. J. Commun. Netw. Syst. Sci., 2011

Double-Moduli Gaussian Encryption/Decryption with Primary Residues and Secret Controls.
Int. J. Commun. Netw. Syst. Sci., 2011

Space Complexity of Algorithm for Modular Multiplicative Inverse.
Int. J. Commun. Netw. Syst. Sci., 2011

Protection of Sensitive Messages Based on Quadratic Roots of Gaussians: Groups with Complex Modulus.
Int. J. Commun. Netw. Syst. Sci., 2011

Cubic Root Extractors of Gaussian Integers and Their Application in Fast Encryption for Time-Constrained Secure Communication.
Int. J. Commun. Netw. Syst. Sci., 2011

Information Protection Based on Extraction of Square Roots of Gaussian Integers.
Int. J. Commun. Netw. Syst. Sci., 2011

Scheme for Secure Communication via Information Hiding Based on Key Exchange and Decomposition Protocols.
Int. J. Commun. Netw. Syst. Sci., 2011

2010
Enhanced Euclid Algorithm for Modular Multiplicative Inverse and Its Application in Cryptographic Protocols.
Int. J. Commun. Netw. Syst. Sci., 2010

Service Networks Topological Design.
Int. J. Commun. Netw. Syst. Sci., 2010

Winning Strategies and Complexity of Nim-Type Computer Game on Plane.
Int. J. Commun. Netw. Syst. Sci., 2010

Potential Vulnerability of Encrypted Messages: Decomposability of Discrete Logarithm Problems.
Int. J. Commun. Netw. Syst. Sci., 2010

Hybrid Authentication Cybersystem Based on Discrete Logarithm, Factorization and Array Entanglements.
Int. J. Commun. Netw. Syst. Sci., 2010

Design of Optimal Topology of Satellite-Based Terrestrial Communication Networks
CoRR, 2010

2009
Internal Corporative Security: Protocols Preventing Leakage of Sensitive Information and Assuring Authorized Network Traffic in the Domain of Gaussian Integers.
Proceedings of the 18th International Conference on Software Engineering and Data Engineering (SEDE-2009), 2009

2008
Information Assurance and Secure Streaming Algorithm Based on Cubic Roots of Integers.
Proceedings of the Fifth International Conference on Information Technology: New Generations (ITNG 2008), 2008

Cryptosystem Based on Extraction of Square Roots of Complex Integers.
Proceedings of the Fifth International Conference on Information Technology: New Generations (ITNG 2008), 2008

Analysis of RSA over Gaussian Integers Algorithm.
Proceedings of the Fifth International Conference on Information Technology: New Generations (ITNG 2008), 2008


  Loading...