Please use this identifier to cite or link to this item:
|標題:||Computing the modular inverses is as simple as computing the GCDs||作者:||Liu, C.L.
|關鍵字:||cryptology;extended euclidean algorithm;finite fields;modular inverse;euclid algorithm||Project:||Finite Fields and Their Applications||期刊/報告no：:||Finite Fields and Their Applications, Volume 14, Issue 1, Page(s) 65-75.||摘要:||
In 1997, Calvez, Azou, and Vilbe proposed a variation on Euclidean algorithm, which can calculate the greatest common divisors (GCDs) and inverses for polynomials. Inspired by their work, we propose a variation on the Euclidean algorithm, which uses only simple modulo operators, to compute the modular inverses. This variant only modifies the initial values and the termination condition of the Euclidean algorithm. Therefore, computing the modular inverses is as simple as computing the GCDs. (c) 2007 Elsevier Inc. All rights reserved.
|Appears in Collections:||資訊科學與工程學系所|
Show full item record
TAIR Related Article
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.