Search for Monic Irreducible Polynomials with Decimal Equivalents of Polynomials over Galois Field GF(pq)

Journals Menu

Follow SCIRP

ISSN Print: 2161-7635
ISSN Online: 2161-7643
www.scirp.org/journal/ojdm
E-mail: ojdm@scirp.org

"Search for Monic Irreducible Polynomials with Decimal Equivalents of Polynomials over Galois Field GF(p^q)"
written by Sankhanil Dey, Ranjan Ghosh,
published by Open Journal of Discrete Mathematics, Vol.8 No.1, 2018

has been cited by the following article(s):

[1]	Composite Algorithm: A new algorithm to search for monic irreducible polynomials over extended Galois Field GF (pq).
	2020

[2]	Division Algorithm to search for monic irreducible polynomials over extended Galois Field GF (p^ q).
	2020

[3]	A new algorithm to find monic irreducible polynomials over extended Galois field GF(pq) using positional arithmetic
	2020

[4]	A New Algorithm to Find Monic Irreducible Polynomials over Extended Galois field GF prime p and extension q using Positional Arithmetic
	Cryptology ePrint Archive, 2020

[5]	Composite Algorithm The New Algorithm to Search for Monic Irreducible Polynomials over Extended Galois Fields
	Cryptology ePrint Archive, 2020

Follow SCIRP