Abstract
The paper presents a concept design of hardware co-processor that could be used to generate irreducible primitive polynomials with coefficients over GF(3). The process of generating a primitive polynomial is done by replicating the other primitive polynomial which is fixed in the device. The implemented algorithm allows the unit to generate all possible primitive polynomials of the same degree as the stored polynomial. This approach allows us to extend the cryptographic power and capabilities of the existing cryptographic devices.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Anderson, R., Roe, M.: A5 (1994), http://jya.com/crack-a5.htm
Babbage, S.: A space/time trade-off in exhaustive search attacks on stream ciphers. In: European Convention on Security and Detection. IEE Conference Publication 408 (May 1995)
Briceno, M., Goldberg, I., Wagner, D.: A pedagogical implementation of A5/1 (1999), http://cryptome.org/jya/a51-pi.htm#PI
von zur Gathen, J.: Irreducible trinomials over finite fields. In: Proc. of the 2001 International Symposium on Symbolic and Algebraic Computation, pp. 332–336. ACM, New York (2001)
Golić, J.D.: Cryptanalysis of alleged A5 stream cipher. In: Fumy, W. (ed.) EUROCRYPT 1997. LNCS, vol. 1233, pp. 239–255. Springer, Heidelberg (1997)
Hellman, M.E.: A cryptoanalytic time-memory trade-off. IEEE Transactions on Information Theory IT-26(4), 401–406 (1980)
MacWilliams, F.J., Sloane, N.J.A.: The Theory of Error-Correcting Codes. North-Holland Mathematical Library. North-Holland, Amsterdam (1988)
Menezes, A.J., van Oorschot, P.C., Vanstone, S.A.: Handbook of Applied Cryptography. CRC Press, Boca Raton (2001), http://www.cacr.math.uwaterloo.ca/hac/
Paszkiewicz, A.: Irreducible pentanomials and their applications to effective implementations of arithmetic in binary fields. Electronics and Telecommunications Quarterly 55(2), 363–375 (2009)
Paszkiewicz, A.: On some properties of irreducible polynomials over small number fields. Telecommunications Review and Telecommunication News 4, 129–135 (2009) (in Polish)
Paszkiewicz, A.: Trinomials which are irreducible over the number field GF(3). Telecommunications Review and Telecommunication News 8-9, 1767–1774 (2009)
Paszkiewicz, A., Stolarek, P.: A modification of A5/1 algorithm. Telecommunication Review and Telecommunication News 12, 1073–1075 (2008) (in Polish)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Borowik, G., Paszkiewicz, A. (2012). Method of Generating Irreducible Polynomials over GF(3) on the Basis of Trinomials. In: Moreno-Díaz, R., Pichler, F., Quesada-Arencibia, A. (eds) Computer Aided Systems Theory – EUROCAST 2011. EUROCAST 2011. Lecture Notes in Computer Science, vol 6928. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-27579-1_43
Download citation
DOI: https://doi.org/10.1007/978-3-642-27579-1_43
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-27578-4
Online ISBN: 978-3-642-27579-1
eBook Packages: Computer ScienceComputer Science (R0)