Sankhanil Dey

We don’t have enough information about this author to calculate their statistics. If you think this is an error let us know.
Learn More
Irreducible Polynomials over GF(pm) and the multiplicative inverses under it are important in cryptography. Presently the method of deriving irreducible polynomials of a particular prime modulus is very primitive and time consuming. In this paper, in order to find all irreducible polynomials, be it monic or non-monic, of all prime moduli p with all its(More)
This is an open-access article distributed under the terms of the Creative Commons Attribution License 4.0, which permits unrestricted use, distribution, and reproduction in any medium, provided the original author and source are credited. ABSTRACT Bitwise-Xor of two 4-bit patterns is the 4-bit difference between them which carries useful information in(More)
  • 1