### Table 2: Complexity for practical field

2005

Cited by 1

### Table 8: The complexity for different curve operations over binary field.

"... In PAGE 10: ...10 To compare the complexity of the two methods, the equivalent numbers of inversions [i], squarings [s] and multiplications [m] for binary field are calculated based on Table8 [9,12]. The results are also included in Tables 4 to 6.... ..."

### Table 1: Non-supersingular elliptic curves for co-GDH Signatures. E is a curve over the prime field Fq and p is the largest prime dividing its order. The MOV reduction maps the curve onto the field Fq6. D is the discriminant of the complex multiplication field of E/Fq.

"... In PAGE 14: ... D is the discriminant of the complex multiplication field of E/Fq. Table1 gives some values of D that lead to suitable curves for our signature scheme. For example, we get a curve E/Fq where q is a 168-bit prime.... ..."

### Table 1: Non-supersingular elliptic curves for co-GDH Signatures. E is a curve over the prime field Fq and p is the largest prime dividing its order. The MOV reduction maps the curve onto the field Fq6. D is the discriminant of the complex multiplication field of E/Fq.

in Abstract

"... In PAGE 14: ... D is the discriminant of the complex multiplication field of E/Fq. Table1 gives some values of D that lead to suitable curves for our signature scheme. For example, we get a curve E/Fq where q is a 168-bit prime.... ..."

### Table 2. The complete area complexity in gates of the ECC processor for various fields and digit sizes

2006

Cited by 4

### Table 2.2: Suitable MNT curves. Here E is a curve over the prime field Fq and r is the largest prime dividing its order. The MOV reduction maps the curve onto the field Fq6. D is the discriminant of the complex multiplication field of E/Fq.

2005

Cited by 4

### Table 2.2: Suitable MNT curves. Here E is a curve over the prime field Fq and r is the largest prime dividing its order. The MOV reduction maps the curve onto the field Fq6. D is the discriminant of the complex multiplication field of E/Fq.

2005

### Table 1. The area complexity of MALU in gates of the ECC processor for various fields and digit sizes

2006

"... In PAGE 8: ... Therefore, we can assume that ECC over F2131 provides a good level of security for these applications. The results of the area complexity for various architectures with respect to the choice of fields and the size of d for the MALU are given in Table1... ..."

Cited by 4

### Table 3: Complexity of the back and forth conversion between extension field and floating point numbers

2007

"... In PAGE 10: ... But, if we are given the representations of H and L in the field, R is then equal to their addition inside the field, directly using the internal representations. Table3 recalls the respective complexities of conversion phase in the two presented algorithms. Alg.... ..."

Cited by 1