Corpus ID: 15198045

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}
}
  • J. Park, J. H. Cheon, S. Hahn
  • Published 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

    Tables from this paper.

    On the Performance of Provably Secure Hashing with Elliptic Curves
    3

    References

    Publications referenced by this paper.
    SHOWING 1-10 OF 22 REFERENCES
    Two Efficient Algorithms for Arithmetic of Elliptic Curves Using Frobenius Map
    11
    Algorithms for Exponentiation in Finite Fields
    88
    A New Representation of Elements of Finite Fields GF(2m) Yielding Small Complexity Arithmetic Circuits
    81
    Highly Regular Architectures for Finite Field Computation Using Redundant Basis
    19
    Fast Multiplication in Finite Fields GF(2N)
    60
    Fast Elliptic Curve Algorithm Combining Frobenius Map and Table Reference to Adapt to Higher Characteristic
    59
    CM-Curves with Good Cryptographic Properties
    416
    Fast Implementation of Elliptic Curve Arithmetic in GF(pn)
    82
    An Elliptic Curve Implementation of the Finite Field Digital Signature Algorithm
    100