Potential Vulnerability of Encrypted Messages: Decomposability of Discrete Logarithm Problems
نویسندگان
چکیده
منابع مشابه
Potential Vulnerability of Encrypted Messages: Decomposability of Discrete Logarithm Problems
This paper provides a framework that reduces the computational complexity of the discrete logarithm problem. The paper describes how to decompose the initial DLP onto several DLPs of smaller dimensions. Decomposability of the DLP is an indicator of potential vulnerability of encrypted messages transmitted via open channels of the Internet or within corporate networks. Several numerical examples...
متن کاملFusion Discrete Logarithm Problems
The Discrete Logarithm Problem is well-known among cryptographers, for its computational hardness that grants security to some of the most commonly used cryptosystems these days. Still, many of these are limited to a small number of candidate algebraic structures which permit implementing the algorithms. In order to extend the applicability of discrete-logarithm-based cryptosystems to a much ri...
متن کاملInteger factorization and discrete logarithm problems
These are notes for a lecture given at CIRM in 2014, for the Journées Nationales du Calcul Formel . We explain the basic algorithms based on combining congruences for solving the integer factorization and the discrete logarithm problems. We highlight two particular situations where the interaction with symbolic computation is visible: the use of Gröbner basis in Joux's algorithm for discrete lo...
متن کاملRemarks on Elliptic Curve Discrete Logarithm Problems
The MOV and FR algorithms, which are representative attacks on elliptic curve cryptosystems, reduce the elliptic curve discrete logarithm problem (ECDLP) to the discrete logarithm problem in a finite field. This paper studies these algorithms and introduces the following three results. First, we show an explicit condition under which the MOV algorithm can be applied to non-supersingular ellipti...
متن کاملEfficient construction of secure hyperelliptic discrete logarithm problems
Hyperelliptic curves have been used to de ne discrete logarithm problems as cryptographic one-way functions. However, no e cient algorithm for construction of secure hyperelliptic curves is known until now. In this paper, e cient algorithms are presented to construct secure discrete logarithm problems on hyperelliptic curves whose Jacobian varieties are either simple or isogenous to a product o...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Communications, Network and System Sciences
سال: 2010
ISSN: 1913-3715,1913-3723
DOI: 10.4236/ijcns.2010.38086