Method of generating irreducible polynomials over GF(3) on the basis of trinomials

Authors:
Grzegorz Borowik;Andrzej Paszkiewicz
Affiliations:
Institute of Telecommunications, Warsaw, Poland;Institute of Telecommunications, Warsaw, Poland
Venue:
EUROCAST'11 Proceedings of the 13th international conference on Computer Aided Systems Theory - Volume Part II
Year:
2011

Citing 3
Cited 0

Irreducible trinomials over finite fields

Proceedings of the 2001 international symposium on Symbolic and algebraic computation
Handbook of Applied Cryptography

Handbook of Applied Cryptography
Cryptanalysis of alleged A5 stream cipher

EUROCRYPT'97 Proceedings of the 16th annual international conference on Theory and application of cryptographic techniques

Quantified Score

Hi-index	0.00

Visualization

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.