scholarly journals Discrete logarithms in quasi-polynomial time in finite fields of fixed characteristic

2021 ◽  
pp. 1
Author(s):  
Thorsten Kleinjung ◽  
Benjamin Wesolowski
Keyword(s):  
Finite Fields ◽  
Polynomial Time ◽  
Discrete Logarithms

scholarly journals Traps to the BGJT-algorithm for discrete logarithms

2014 ◽  
Vol 17 (A) ◽  
pp. 218-229 ◽  
Author(s):  
Qi Cheng ◽  
Daqing Wan ◽  
Jincheng Zhuang
Keyword(s):  
Finite Fields ◽  
Polynomial Time ◽  
Time Complexity ◽  
Complexity Analysis ◽  
Discrete Logarithm ◽  
Polynomial Time Algorithm ◽  
Time Algorithm ◽  
New Approach ◽  
Discrete Logarithms ◽  
Polynomial Time Complexity

AbstractIn the recent breakthrough paper by Barbulescu, Gaudry, Joux and Thomé, a quasi-polynomial time algorithm is proposed for the discrete logarithm problem over finite fields of small characteristic. The time complexity analysis of the algorithm is based on several heuristics presented in their paper. We show that some of the heuristics are problematic in their original forms, in particular when the field is not a Kummer extension. We propose a fix to the algorithm in non-Kummer cases, without altering the heuristic quasi-polynomial time complexity. Further study is required in order to fully understand the effectiveness of the new approach.

scholarly journals Fast Constructive Recognition of Black-Box Unitary Groups

2003 ◽  
Vol 6 ◽  
pp. 162-197 ◽  
Author(s):  
Peter A. Brooksbank
Keyword(s):  
Homomorphic Image ◽  
Polynomial Time ◽  
Unitary Group ◽  
Black Box ◽  
Unitary Groups ◽  
Discrete Logarithms ◽  
Cyclic Groups

AbstractIn this paper, the author presents a new algorithm to recognise, constructively, when a given black-box group is a homomorphic image of the unitary group SU(d, q) for known d and q. The algorithm runs in polynomial time, assuming the existence of oracles for handling SL(2, q) subgroups, and for computing discrete logarithms in cyclic groups of order q ± 1.

scholarly journals Function Field Sieve Method for Discrete Logarithms over Finite Fields

1999 ◽  
Vol 151 (1-2) ◽  
pp. 5-16 ◽  
Author(s):  
Leonard M. Adleman ◽  
Ming-Deh A. Huang
Keyword(s):  
Finite Fields ◽  
Function Field ◽  
Sieve Method ◽  
Discrete Logarithms

Chromatic, Flow and Reliability Polynomials: The Complexity of their Coefficients

2002 ◽  
Vol 11 (4) ◽  
pp. 403-426 ◽  
Author(s):  
JAMES OXLEY ◽  
DOMINIC WELSH
Keyword(s):  
Finite Fields ◽  
Polynomial Time ◽  
Tutte Polynomial ◽  
Decision Problems ◽  
Approximation Schemes ◽  
Significant Difference ◽  
Classical Polynomials ◽  
Quasi Order

We study the complexity of computing the coefficients of three classical polynomials, namely the chromatic, flow and reliability polynomials of a graph. Each of these is a specialization of the Tutte polynomial Σtijxiyj. It is shown that, unless NP = RP, many of the relevant coefficients do not even have good randomized approximation schemes. We consider the quasi-order induced by approximation reducibility and highlight the pivotal position of the coefficient t10 = t01, otherwise known as the beta invariant.Our nonapproximability results are obtained by showing that various decision problems based on the coefficients are NP-hard. A study of such predicates shows a significant difference between the case of graphs, where, by Robertson–Seymour theory, they are computable in polynomial time, and the case of matrices over finite fields, where they are shown to be NP-hard.

scholarly journals PRIME NUMBERS AND CRYPTOSYSTEMS BASED ON DISCRETE LOGARITHMS

2014 ◽  
Vol 6 (2) ◽  
pp. 163-176
Author(s):  
Maciej GRZEŚKOWIAK
Keyword(s):  
Polynomial Time ◽  
Prime Numbers ◽  
Discrete Logarithms ◽  
Short Overview

In this paper, we give a short overview of algorithms of generating primes to a DL systems. The algorithms are probabilistic and works in a polynomial time.

Sign in / Sign up

Export Citation Format

Share Document