搜索筛选:
搜索耗时0.1043秒,为你在为你在102,285,761篇论文里面共找到 17 篇相符的论文内容
发布年度:
[期刊论文] 作者：Boris S. Verkhovsky,
来源：通讯、网络与系统学国际期刊(英文) 年份：2011
Three new worldwide calendars are proposed and compared in this paper. None of them requires any departure from an existing tradition to divide years on lean an...
[期刊论文] 作者：Boris S. Verkhovsky,
来源：通讯、网络与系统学国际期刊(英文) 年份：2011
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...
[期刊论文] 作者：Boris S. Verkhovsky,
来源：通讯、网络与系统学国际期刊(英文) 年份：2012
Several algorithms based on homogeneous polynomials for multiplication of large integers are described in the paper. The homogeneity of polynomials provides sev...
[期刊论文] 作者：Boris S. Verkhovsky,
来源：通讯、网络与系统学国际期刊(英文) 年份：2011
In this paper is demonstrated a method for reduction of integer factorization problem to an analysis of a sequence of modular elliptic equations. As a result, t...
Enhanced Euclid Algorithm for Modular Multiplicative Inverse and Its Application in Cryptographic Pr
[期刊论文] 作者：Boris S. Verkhovsky,
来源：通讯、网络与系统学国际期刊(英文) 年份：2010
Numerous cryptographic algorithms (ElGamal, Rabin, RSA, NTRU etc) require multiple computations of modulo multiplicative inverses. This paper describes and vali...
[期刊论文] 作者：Boris S. Verkhovsky,
来源：通讯、网络与系统学国际期刊(英文) 年份：2010
Topological design of service networks is studied in the paper. Quantitative model and algorithm minimizing cost of processing and delivery is described. Algori...
[期刊论文] 作者：Boris S. Verkhovsky,
来源：通讯、网络与系统学国际期刊(英文) 年份：2010
A Nim-type computer game of strategy on plane is described in this paper. It is demonstrated that winning strategies of this two-person game are determined by a...
[期刊论文] 作者：Boris S. Verkhovsky,
来源：通讯、网络与系统学国际期刊(英文) 年份：2011
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 integer...
[期刊论文] 作者：Boris S. Verkhovsky,
来源：通讯、网络与系统学国际期刊(英文) 年份：2011
This paper considers three algorithms for the extraction of square roots of complex integers {called Gaussians} using arithmetic based on complex modulus p + iq...
[期刊论文] 作者：Boris S. Verkhovsky,
来源：通讯、网络与系统学国际期刊(英文) 年份：2010
This paper provides a framework that reduces the computational complexity of the discrete logarithm problem. The paper describes how to decompose the initial DL...
Scheme for Secure Communication via Information Hiding Based on Key Exchange and Decomposition Proto
[期刊论文] 作者：Boris S. Verkhovsky,
来源：通讯、网络与系统学国际期刊(英文) 年份：2011
This paper considers a decomposition framework as a mechanism for information hiding for secure communication via open network channels. Two varieties of this f...
Hybrid Authentication Cybersystem Based on Discrete Logarithm, Factorization and Array Entanglements
[期刊论文] 作者：Boris S. Verkhovsky,
来源：通讯、网络与系统学国际期刊(英文) 年份：2010
A hybrid cryptographic system providing digital authentication is described and analyzed in this paper. The proposed cryptosystem incorporates three features: c...
[期刊论文] 作者：Boris S. Verkhovsky,
来源：通讯、网络与系统学国际期刊(英文) 年份：2011
In certain computational systems the amount of space required to execute an algorithm is even more restrictive than the corresponding time necessary for solutio...
[期刊论文] 作者：Boris S. Verkhovsky,
来源：通讯、网络与系统学国际期刊(英文) 年份：2012
This paper provides several generalizations of Gauss theorem that counts points on special elliptic curves. It is demonstrated how to implement these generaliza...
[期刊论文] 作者：Boris S. Verkhovsky,
来源：通讯、网络与系统学国际期刊(英文) 年份：2011
A cryptosystem based on computation of square roots of complex integers modulo composite n is described in this paper. This paper provides an algorithm extracti...
[期刊论文] 作者：Boris S. Verkhovsky,
来源：通讯、网络与系统学国际期刊(英文) 年份：2011
This paper is a logical continuation of my recently-published paper. Security of modern communication based on RSA cryptographic protocols and their analogues i...
[期刊论文] 作者：Boris S. Verkhovsky,Roberto D.,
来源：通讯、网络与系统学国际期刊(英文) 年份：2012
Securing large corporate communication networks has become an increasingly difficult task. Sensitive information routinely leaves the company network boundaries...
相关搜索：
