Paper 2017/556
Multiplication and Division over Extended Galois Field GF( ): A new Approach to find Monic Irreducible Polynomials over any Galois Field GF( ).
Sankhanil Dey and Ranjan Ghosh
Abstract
Irreducible Polynomials (IPs) have been of utmost importance in generation of substitution boxes in modern cryptographic ciphers. In this paper an algorithm entitled Composite Algorithm using both multiplication and division over Galois fields have been demonstrated to generate all monic IPs over extended Galois Field GF(
Note: To Sankhanil Dey and Ranjan Ghosh
Dear authors,
Please use basic Latex commands in the abstract, e.g.,
Metadata
- Available format(s)
-
PDF
- Category
- Foundations
- Publication info
- Preprint.
- Keywords
- Galois FieldFinite fieldIrreducible Polynomials (IPs)Monic IPs.
- Contact author(s)
- sankhanil12009 @ gmail com
- History
- 2017-06-08: received
- Short URL
- https://ia.cr/2017/556
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2017/556, author = {Sankhanil Dey and Ranjan Ghosh}, title = {Multiplication and Division over Extended Galois Field {GF}($p^q$): A new Approach to find Monic Irreducible Polynomials over any Galois Field {GF}($p^q$).}, howpublished = {Cryptology {ePrint} Archive, Paper 2017/556}, year = {2017}, url = {https://eprint.iacr.org/2017/556} }