Distributed computing system which solve an elliptic curve discrete logarithm problem

Author

Aleksander, Marek ; Litawa, Grzegorz ; Karpinskyi, Volodymyr

Author_Institution

State Higher Vocational Sch. in Nowy Sacz, Inst. of Eng., Nowy Sacz, Poland

fYear

2009

fDate

24-28 Feb. 2009

Firstpage

378

Lastpage

380

Abstract

The paper describes computer system consisting of a central server and a distributed computing system composed of multiprocessor servers using the MPI, computer clusters, computers of the PC and dedicated FPGA units. The field programmable gate array (FPGA) units will be connected to the system through PC. The communication of computational units with the server is realized through Internet and LAN networks. The presented system executes a Pollard rho Parallel Algorithm. The system´s efficiency analysis let us estimate the time needed for breaking the ciphers with various key lengths and determine the level of security that they provide.

Keywords

Internet; field programmable gate arrays; local area networks; mathematics computing; multiprocessing systems; parallel algorithms; public key cryptography; Internet; LAN networks; MPI; Pollard rho Parallel Algorithm; ciphers; computer clusters; distributed computing system; elliptic curve discrete logarithm problem; field programmable gate array; multiprocessor servers; Communication system security; Computer networks; Distributed computing; Elliptic curves; Field programmable gate arrays; IP networks; Local area networks; Network servers; Parallel algorithms; Web server; ECC; ECDLP; FPGA; LAN; Pollard rho; computer system; elliptic curves;

fLanguage

English

Publisher

ieee

Conference_Titel

CAD Systems in Microelectronics, 2009. CADSM 2009. 10th International Conference - The Experience of Designing and Application of

Conference_Location

Lviv-Polyana

Print_ISBN

978-966-2191-05-9

Type

conf

Filename

4839856