On the Euclidean Algorithm of Polynomials (Special Section on Discrete Mathematics and Its Applications)

スポンサーリンク

概要

• 論文の詳細を見る

• In order to compute gcd of polynomials, the Euclidean algorithm is used. We estimate the complexities of known Euclidean algorithms. Further, we propose a heuristic Euclidean algorithm. This is faster than ordinary methods under some special conditions by the use of the recurrent Karatsuba multiplication.

• 社団法人電子情報通信学会の論文
• 2001-05-01

著者

• Futa Yuichi

  The Author Is With Matsushita Electric Industrial Co. Ltd.

• NAGAO Koh-ichi

  Faculty of Engineering, Kanto Gakuin University

• Nagao Koh-ichi

  Faculty Of Engineering Kanto Gakuin University

• NAGAO Koh-ichi

  The author is with Matsushita Electric Industrial Co., Ltd.

関連論文

• Analysis of Baby-Step Giant-Step Algorithms for Non-uniform Distributions (Fundamental) (Cryptography and Information Security)
• Generating Secure Genus Two Hyperelliptic Curves Using Elkies' Point Counting Algorithm
• On the Euclidean Algorithm of Polynomials (Special Section on Discrete Mathematics and Its Applications)

スポンサーリンク