🚀 go-pugleaf

Dear fellows,

The project: The implementation of UFC (Ultra Fast Crypt) on UNI-C's
CM200 is now finished.

The work was done by Michael Glad, who is also the auther of UFC.
The CM200 is a small Connection Mashine (parallel computer)
with 8K CPUs from Thinking Machines Corporation.

Below are the results:

  - The C* (C-star) version of UFC can crypt 55,000 words pr. second.
    It is higly optimized and uses special PARIS functions in all the
    time comsuming parts.

  - The Fortran version af UFC can "only" crypt 25,000 words pr. second.

  - The C* version implemented as the standard crypt() function
    can crypt 53,000 words pr. second.
        
The task is embarrassing parallel and is therefore linarly scalable.
So on the largest CM200 (64 K processors) the crypt() function can
crypt 424,000 words pr. second.

At the moment, the Fortran version of UFC can crypt 85,000 words pr.
second on a small CM-5 (128 nodes) with vector units and it is NOT
optimized yet.


Does anyone know who is running the fastest password cracking program
(crypt() function) on a SINGLE machine?

Please do * NOT * respond if your answer cant'be documented or verified!
There are just too many rumors around . . .


Thanks in advance
Jorgen Bo Madsen

+-----------------------------------------------------------------------+
!   Jorgen Bo Madsen,  Security Consultant                              !
!   UNI-C Lyngby,  Danish Computing Centre for Research and Education   !
!   DTH,  Building 305,  DK - 2800 Lyngby,                              !
!   Phone  : +45-45-938355                                              !
!   Telefax: +45-45-930220                                              !
!   E-Mail : Jorgen.Bo.Madsen@uni-c.dk                                  !
+-----------------------------------------------------------------------+