# NEW TYPE OF OPTIMAL EXTENSION FIELDS AND ITS APPLICATIONS

@inproceedings{Park2001NEWTO, title={NEW TYPE OF OPTIMAL EXTENSION FIELDS AND ITS APPLICATIONS}, author={J. Park and J. H. Cheon and S. Hahn}, year={2001} }

In this paper, we introduce a new type of Optimal Extension Fields (OEFs) which extends the notion of previous OEF. An OEF is the class of fields Fpn , for p a Mersenne prime and n a positive integer with an irreducible binomial p(x) = x − ω over Fp. Instead of the condition of the existence of an irreducible binomial, we append the other condition of the existence of an irreducible All One Polynomial, which implies the existence of an optimal normal basis over Fp. In this case, we may choose… CONTINUE READING

One Citation

#### References

##### Publications referenced by this paper.

SHOWING 1-10 OF 22 REFERENCES

Two Efficient Algorithms for Arithmetic of Elliptic Curves Using Frobenius Map

- Computer Science, Mathematics
- 1998

11

A New Representation of Elements of Finite Fields GF(2m) Yielding Small Complexity Arithmetic Circuits

- Computer Science, Mathematics
- 1998

81

Highly Regular Architectures for Finite Field Computation Using Redundant Basis

- Computer Science
- 1999

19

Fast Elliptic Curve Algorithm Combining Frobenius Map and Table Reference to Adapt to Higher Characteristic

- Computer Science, Mathematics
- 1999

59

On "A New Representation of Elements of Finite Fields GF (2^m) Yielding Small Complexity Arithmetic Circuits"

- Computer Science
- 2002

22

An Elliptic Curve Implementation of the Finite Field Digital Signature Algorithm

- Computer Science
- 1998

100