On the Number of Trace-One Elements in Polynomial Bases for $$\mathbb{F}

On the Number of Trace-One Elements in Polynomial Bases for $$\mathbb{F}_{2^n}$$

Published:2005-12 Issue:3 Volume:37 Page:493-507
ISSN:0925-1022
Container-title:Designs, Codes and Cryptography
language:en
Short-container-title:Des Codes Crypt

Author:

Ahmadi Omran,Menezes Alfred

Publisher

Springer Science and Business Media LLC

Subject

Applied Mathematics,Computer Science Applications

Link

http://link.springer.com/content/pdf/10.1007/s10623-004-4039-4.pdf

Reference14 articles.

1. ANSI X9.62, Public Key Cryptography for the Financial Services Industry: The Elliptic Curve Digital Signature Algorithm (ECDSA), American National Standards Institute (1999).

2. ANSI X9.63, Public Key Cryptography for the Financial Services Industry: Key Agreement and Key Transport Using Elliptic Curve Cryptography, American National Standards Institute (2001).

3. Constructive problems for irreducible polynomials over finite fields

4. A. Bluher, A Swan-like Theorem, Finite Fields and their Applications, to appear.

5. FIPS 186-2, Digital Signature Standard (DSS), Federal Information Processing Standards Publication 186-2, National Institute of Standards and Technology (2000).

Cited by 11 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. On the Polynomial Basis ofGF(2n)Having a Small Number of Trace-One Elements;Mathematical Problems in Engineering;2016

2. The Reducibility of a Special Binary Pentanomial;Algebra;2014-09-02

3. Binary fields on limited systems;Acta Scientiarum Mathematicarum;2014

4. Cryptography;Handbook of Finite Fields;2013-06-17

5. Addendum to Sidelʼnikov sequences over nonprime fields;Information Processing Letters;2013-05