Corpus ID: 3265031

Explicit formulas for efficient multiplication in F_{3^{6m}}

@article{Gorla2007ExplicitFF,
  title={Explicit formulas for efficient multiplication in F_\{3^\{6m\}\}},
  author={Elisa Gorla and Christoph Puttmann and Jamshid Shokrollahi},
  journal={ArXiv},
  year={2007},
  volume={abs/0708.3014}
}
  • Elisa Gorla, Christoph Puttmann, Jamshid Shokrollahi
  • Published in ArXiv 2007
  • Mathematics, Computer Science
  • Efficient computation of the Tate pairing is an important part of pairing-based cryptography. Recently with the introduction of the Duursma-Lee method special attention has been given to the fields of characteristic 3. Especially multiplication in F36m, where m is prime, is an important operation in the above method. In this paper we propose a new method to reduce the number of F3m-multiplications for multiplication in F36m from 18 in recent implementations to 15. The method is based on the… CONTINUE READING

    Create an AI-powered research feed to stay up to date with new papers like this posted to ArXiv

    Tables and Topics from this paper.

    Citations

    Publications citing this paper.
    SHOWING 1-10 OF 22 CITATIONS

    A Refined Algorithm for the etaT Pairing Calculation in Characteristic Three

    VIEW 9 EXCERPTS
    CITES METHODS
    HIGHLY INFLUENCED

    Karatsuba-like formulae and their associated techniques

    • Murat Cenk
    • Mathematics, Computer Science
    • Journal of Cryptographic Engineering
    • 2017

    Hardware processors for pairing-based cryptography

    VIEW 2 EXCERPTS
    CITES METHODS

    Efficient Hardware Architecture of $\eta_{T}$ Pairing Accelerator Over Characteristic Three

    VIEW 1 EXCERPT
    CITES METHODS

    References

    Publications referenced by this paper.
    SHOWING 1-10 OF 17 REFERENCES

    Efficient FPGA-Based Karatsuba Multipliers for Polynomials over F2

    VIEW 1 EXCERPT

    Five, six, and seven-term Karatsuba-like formulae

    VIEW 1 EXCERPT

    The Art of Computer Programming, vol

    • D. E. Knuth
    • 2, Seminumerical Algorithms. 3rd edn. Addison-Wesley, Reading MA
    • 1998
    VIEW 1 EXCERPT

    Algebraic complexity theory

    VIEW 2 EXCERPTS