• DocumentCode
    3095933
  • Title

    CAIRN: Dedicated Integer Factoring Devices

  • Author

    Izu, Tetsuya ; Kogure, Jun ; Shimoyama, Takeshi

  • Author_Institution
    FUJITSU Labs. Ltd., Kawasaki, Japan
  • fYear
    2010
  • fDate
    14-16 Sept. 2010
  • Firstpage
    558
  • Lastpage
    563
  • Abstract
    The integer factoring problem is known as one of the hard problem in cryptology, and some public-key cryptosystems including RSA are designed based of this fact. Recently, several dedicated integer factoring devices have been proposed, however, no implementational or even experimental results are not shown. This paper proposes a novel design of a dedicated integer factoring device. In order to verify the do ability of the design, we actually developed the dedicated integer factoring devices CAIRN 1, 2 and 3. CAIRN 1 is the first and concept proof device implemented on DAP-DNA2, while CAIRN 2 is implemented on Xilinx´s FPGA and succeeded factoring a 128-bit composite integer whose factor was unknown at that time. CAIRN 3 is also implemented on Xilinx´s FPGA, and is about 38 times faster than CAIRN 2 in the experimental sieving for a 768-bit integer (RSA 768). It is estimated that the full sieving for RSA 768 requires about 270 years with single CAIRN 3.
  • Keywords
    field programmable gate arrays; number theory; public key cryptography; 128 bit composite integer; 768 bit integer; CAIRN; DAP-DNA2; RSA 768; RSA cryptosystem; Xilinx FPGA; integer factoring device; integer factoring problem; public key cryptosystem; Barium; DNA; Field programmable gate arrays; Lattices; Polynomials; SDRAM; Hardware; Integer Factoring; RSA;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Network-Based Information Systems (NBiS), 2010 13th International Conference on
  • Conference_Location
    Takayama
  • ISSN
    2157-0418
  • Print_ISBN
    978-1-4244-8053-1
  • Electronic_ISBN
    2157-0418
  • Type

    conf

  • DOI
    10.1109/NBiS.2010.60
  • Filename
    5636272