The polynomial factorization over GF($2^n$)

    ,
Vol. 9, No. 3, pp. 3-12, Jun. 1999
10.13089/JKIISC.1999.9.3.3, Full Text:
Keywords:
Abstract

The public key crytptosystem is represented by RSA based on the difficulty of integer factorization and ElGamal cryptosystem based on the intractability of the discrete logarithm problem in a cyclic group G. The index-calculus algorithm for discrete logarithms in GF${$q^n$}^+$ requires an polynomial factorization. The Niederreiter recently developed deterministic facorization algorithm for polynomial over GF$q^n$ In this paper we implemented the arithmetic of finite field with c-language and gibe an implementation of the Niederreiter's algorithm over GF$2^n$ using normal bases.

Statistics
Show / Hide Statistics

Statistics (Cumulative Counts from December 1st, 2017)
Multiple requests among the same browser session are counted as one view.
If you mouse over a chart, the values of data points will be shown.


Cite this article
[IEEE Style]
김창한, "The polynomial factorization over GF($2^n$)," Journal of The Korea Institute of Information Security and Cryptology, vol. 9, no. 3, pp. 3-12, 1999. DOI: 10.13089/JKIISC.1999.9.3.3.

[ACM Style]
김창한. 1999. The polynomial factorization over GF($2^n$). Journal of The Korea Institute of Information Security and Cryptology, 9, 3, (1999), 3-12. DOI: 10.13089/JKIISC.1999.9.3.3.