MIMD-Factorisation on Hypercubes

Damm, Frank and Heider, Franz-Peter and Wambach, Georg (1995) MIMD-Factorisation on Hypercubes.
Published In: Advances in Cryptology — EUROCRYPT'94 : Workshop on the Theory and Application of Cryptographic Techniques Perugia, Italy, May 9–12, 1994 Proceedings , Lecture notes in computer science. 950 Springer 1995, pp. 400-409.

Abstract

This paper describes the development and implementation of the MPQS factoring algorithm using multiple hypercubes customised to a MIMD parallel computer. The computationally most expensive steps ran on a Parsytec machine consisting of 1024 Inmos T805 microprocessors. General 100 decimal digit numbers can be factored in 1-2 days.


Actions:
Download: [img] Postscript - Preprinted Version
Download (192kB) | Preview
Editorial actions: View Item View Item (Login required)
Content information:
Item Type: Proceedings article
Citations: 2 (Google Scholar) |
Uncontrolled Keywords: factorization Hypercube MPQS MIMD Parallelisation
Subjects:
  • 94-XX Information and communication, circuits > 94Axx Communication, information > 94A60 Cryptography

  • 68-XX Computer science > 68Wxx Algorithms > 68W10 Parallel algorithms

  • 11-XX Number theory > 11Yxx Computational number theory > 11Y05 Factorization

    		•
    Divisions: Institute of Computer Science > Computer Science Department - Prof. Dr. Schrader
    Related URLs:
    Deposit Information:
    ZAIK Number: zpr94-149
    Depositing User: Archive Admin
    Date Deposited: 02 Apr 2001 00:00
    Last Modified: 19 Jan 2012 10:48
    URI: http://e-archive.informatik.uni-koeln.de/id/eprint/149