Primitive polynomials of degree 301 through 500
Journal of Electronic Testing: Theory and Applications
Constructive problems for irreducible polynomials over finite fields
Proceedings of the third Canadian workshop on Information theory and applications
High Speed Ring Generators and Compactors of Test Data
VTS '03 Proceedings of the 21st IEEE VLSI Test Symposium
Embedded Deterministic Test for Low-Cost Manufacturing Test
ITC '02 Proceedings of the 2002 IEEE International Test Conference
Cellular automata-based test pattern generators with phase shifters
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Scalable and Systolic Montgomery Multipliers over GF(2m)
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
Trojan Side-Channels: Lightweight Hardware Trojans through Side-Channel Engineering
CHES '09 Proceedings of the 11th International Workshop on Cryptographic Hardware and Embedded Systems
MOLES: malicious off-chip leakage enabled by side-channels
Proceedings of the 2009 International Conference on Computer-Aided Design
High volume diagnosis in memory BIST based on compressed failure data
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Proceedings of the 15th Symposium on International Database Engineering & Applications
| Hi-index | 0.00 |
New tables of primitive polynomials of degree up to 660 over the Galois field of 2 elements are provided. These polynomials have been obtained for ring generators—a new class of linear feedback shift registers featuring enhanced properties over conventional shift registers. For each degree polynomials with five, seven and nine nonzero coefficients are presented. The coefficients are uniformly separated from each other so that the resulting implementations are highly modular.