ECC2K-130
Upcoming SlideShare
Loading in...5
×
 

ECC2K-130

on

  • 633 views

 

Statistics

Views

Total Views
633
Views on SlideShare
632
Embed Views
1

Actions

Likes
0
Downloads
0
Comments
0

1 Embed 1

http://translate.googleusercontent.com 1

Accessibility

Categories

Upload Details

Uploaded via as Apple Keynote

Usage Rights

© All Rights Reserved

Report content

Flagged as inappropriate Flag as inappropriate
Flag as inappropriate

Select your reason for flagging this presentation as inappropriate.

Cancel
  • Full Name Full Name Comment goes here.
    Are you sure you want to
    Your message goes here
    Processing…
Post Comment
Edit your comment
  • <br />
  • <br />
  • <br />
  • <br />
  • <br />
  • <br />
  • <br />
  • <br />
  • <br />
  • <br />

ECC2K-130 ECC2K-130 Presentation Transcript

  • Implementing a feasible attack against ECC2K-130 with use of grid computing Ahmad Lavasani <sahosse@math.ucalgary.ca> Reza Mohammadi <reza@teeleh.ir> Sunday, May 17, 2009 @ CC of SUT
  • Certicom Challenges Elliptic Curves Employed in Cryptography (1980s) Certicom $ 20,000 for ECC2K-130 ECC2K-108 (Apr 4, 2000 - After 166000 Machine Days)
  • Large Scale Computing [SC] Using multi-processing is NOT the easiest way! SuperComputer Does not necessarily use multi-processing Penultimate easiest way because of integration So costly
  • Large Scale Computing [Cluster] Cluster Many CPUs Requires fast networking equipment (costly) Not applicable on so sequential algorithms Standardized infrastructure Message Passing Interface
  • Large Scale Computing [Grid] No special equipment (cheaper) For algorithms with minimum message passing LHC Computing Grid Berkeley Open Infrastructure for Network Computing
  • ECC2K-130 Challenge Underlying Field: GF(2 131) Irreducible Polynomial: f(t) = t131 + t13 + t2 + t + 1 The Curve: y2 + xy = x3 +1 Special definition of add operation The Problem: Knowing P and Q , find n such that Q = nP over the curve.
  • Attack against ECC2K-130 Effectiveness with relatively short key length Pollard’s Rho Birthday attack Walk until collision Minimum message passing
  • Implementation BOINC Since 2002 Open Source Communication over HTTP Multi-platform Utilities & UIs
  • Steps 1. Setup & configuration of BOINC server 2. Client(s) 3. Assimilator 4. Work generator
  • http://boinc.math.ucalgary.ca/sheti/ Any Question?