• No se han encontrado resultados

Discrete logarithms in small characteristic finite fields: attacking Type 1 pairing-based cryptography

N/A
N/A
Protected

Academic year: 2017

Share "Discrete logarithms in small characteristic finite fields: attacking Type 1 pairing-based cryptography"

Copied!
143
0
0

Texto completo

Loading

Figure

Table 3.1 compares the running time Cqon the running time of the QPA algorithm for computing discrete logarithms inpersmith’s algorithm for computing discrete logarithms in ≈(q) = exp(1.526(log 24q)1/3(log log 24q)2/3) of Cop- F24q, and the lower bound q2
Table 3.2: Estimated costs of the main steps of the new DLP algorithm for computing
Figure 3.1: A typical path of the descent tree for computing an individual logarithm in F312·509(q = 36)
Table 3.3: Estimated costs of the main steps of the new DLP algorithm for computing discrete
+7

Referencias

Documento similar

In the specific case of the activity tested in this research, a contextualized activity based on a virtual lab, our results allow us to affirm that this type of activities provide

The results of Experiment 1 showed that repeatedly pairing neutral faces with positive or negative emotional expressions (happy and angry) is effective to change the pattern

The characteristics of this occurrence differ from those of fluid-deposited vein-type graphite mineralization in that: (1) graphite flakes are oriented parallel to the vein walls;

In the attempt to overcome some of these limitations, we report here the on-surface synthesis of a discrete and structurally- precise Por-GNR hybrid (1) formed via

(1) the analysis of the sentiments of Chinese tourists obtained from e-WoM; (2) the use of new models to measure the quality of a destination based on information from Chinese

In each panel, we show two MDFs derived from the simulations: one based upon the use of all star particles belonging to the bulge, after ap- plication of the kinematic

Calculated energy splittings E(I )-E(I − 2) in MeV in the ground band of 44 Ti as a function of the strength of the (a) isoscalar pairing interaction and of the (b) isovector

(Notice that A is of Kleinian type if and only if every simple quotient of A is of Kleinian type.) Then we use this characterization and results from [8] to characterize the