English  |  正體中文  |  简体中文  |  Items with full text/Total items : 56431/90260 (63%)
Visitors : 11697351      Online Users : 47
RC Version 7.0 © Powered By DSPACE, MIT. Enhanced by NTU Library & TKU 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://tkuir.lib.tku.edu.tw:8080/dspace/handle/987654321/59826

    Title: A simple approach for generating RSA keys
    Authors: Chang, Chin-chen;黃心嘉;Hwang, Shin-jia
    Contributors: 淡江大學資訊工程學系
    Keywords: Cryptography;Number theory;Algorithms
    Date: 1997-07
    Issue Date: 2011-10-05 22:18:58 (UTC+8)
    Publisher: Amsterdam:Elsevier BV
    Abstract: We propose a modification of Derome's method (1993) to compute the RSA secret data d = e−1 mod (P − 1)(Q − 1) by utilizing the modular arithmetic operations, when e is not prime. Here P and Q are two large prime numbers in RSA cryptosystem and e is the public data.
    Relation: Information processing letters 63(1), pp.19-21
    DOI: 10.1016/S0020-0190(97)00089-6
    Appears in Collections:[資訊工程學系暨研究所] 期刊論文

    Files in This Item:

    File SizeFormat

    All items in 機構典藏 are protected by copyright, with all rights reserved.

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