Computing the modular inverses is as simple as computing the GCDs

ASIAIR > College of Computer Science > Department of Applied Informatics and Multimedia > Journal Article > Item 310904400/8566

Please use this identifier to cite or link to this item: http://asiair.asia.edu.tw/ir/handle/310904400/8566

Title:	Computing the modular inverses is as simple as computing the GCDs
Authors:	Liu, CL (Liu, Chao-Liang);Horng, G (Horng, Gwoboa);Liu, HY (Liu, Hsin-Yu)
Contributors:	Department of Information Science and Applications
Keywords:	cryptology;extended euclidean algorithm;finite fields;modular inverse;EUCLID ALGORITHM
Date:	2008-01
Issue Date:	2010-03-26 03:03:11 (UTC+0)
Publisher:	Asia University
Abstract:	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.
Relation:	FINITE FIELDS AND THEIR APPLICATIONS 14 (1): 65-75
Appears in Collections:	[Department of Applied Informatics and Multimedia] Journal Article

Files in This Item:

File	Description	Size	Format
440.docx		0Kb	Unknown	279	View/Open
310904400-8566.doc		39Kb	Microsoft Word	270	View/Open