English  |  正體中文  |  简体中文  |  Items with full text/Total items : 90453/105672 (86%)
Visitors : 12025585      Online Users : 285
RC Version 6.0 © Powered By DSPACE, MIT. Enhanced by NTU Library IR team.
Scope Tips:
  • please add "double quotation mark" for query phrases to get precise results
  • please goto advance search for comprehansive author search
  • Adv. Search
    HomeLoginUploadHelpAboutAdminister Goto mobile version

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

    Title: Computing the modular inverses is as simple as computing the GCDs
    Authors: Liu, Chao-Liang;Horng, Gwoboa;Liu, Hsin-Yu
    Contributors: Department of Information Science and Applications
    Keywords: Algorithms;Numerical methods;Polynomials;Cryptology;Extended Euclidean algorithm;Finite fields;Greatest common divisors;Modular inverses
    Date: 2008
    Issue Date: 2010-04-07 21:34:17 (UTC+8)
    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. © 2007 Elsevier Inc. All rights reserved.
    Relation: Finite Fields and their Applications 14:65-75
    Appears in Collections:[行動商務與多媒體應用學系] 期刊論文

    Files in This Item:

    File Description SizeFormat
    440.doc34KbMicrosoft Word178View/Open

    All items in ASIAIR are protected by copyright, with all rights reserved.

    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library IR team Copyright ©   - Feedback