Computing the modular inverses is as simple as computing the GCDs

ASIA unversity > 資訊學院 > 行動商務與多媒體應用學系 > 期刊論文 > Item 310904400/8566

jsp.display-item.identifier=請使用永久網址來引用或連結此文件: http://asiair.asia.edu.tw/ir/handle/310904400/8566

题名:	Computing the modular inverses is as simple as computing the GCDs
作者:	Liu, CL (Liu, Chao-Liang);Horng, G (Horng, Gwoboa);Liu, HY (Liu, Hsin-Yu)
贡献者:	Department of Information Science and Applications
关键词:	cryptology;extended euclidean algorithm;finite fields;modular inverse;EUCLID ALGORITHM
日期:	2008-01
上传时间:	2010-03-26 03:03:11 (UTC+0)
出版者:	Asia University
摘要:	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.
關聯:	FINITE FIELDS AND THEIR APPLICATIONS 14 (1): 65-75
显示于类别:	[行動商務與多媒體應用學系] 期刊論文

文件中的档案:

档案	描述	大小	格式	浏览次数
440.docx		0Kb	Unknown	279	检视/开启
310904400-8566.doc		39Kb	Microsoft Word	270	检视/开启

在ASIAIR中所有的数据项都受到原著作权保护.