Pollard Rho Attack against Public Key ECC

Pollard Rho cryptanalysis attack is considered as the most powerful attack against elliptic curve discrete logarithm problem. Requirement for running Pollard Rho attack is quiet easy to get. The public key only is sufficient. In ECC using El-Gamal scenario the public key consist of:

  1. the curve equation including: the finite field Fp, curve coefficient: a and b
  2. the point generator in the elliptic curve
  3. the generated point in the elliptic curve

Pollard Rho run through three work phases which are:

  1. obtain the public key
  2. simulate a random walk inside the finite field Fp to find a cycle
  3. calculate the private key

(not done yet will be continued later)

 

Nyanyian Hati

Bapak-bapak, Ibu-ibu siapa yang baik hati bantu aku

aku yang sedang malu

sama teman-temanku

karna cuma tesisku

yang ga maju-maju

Understanding Pollard Rho for Elliptic Curve Discrete Logarithm Problem Overnight. Possible?

understanding pollard rho for elliptic curve discrete logarithm problem overnight, is it possible for crypto new comer?

well, i’ll let you know how much i understand tomorrow :)

err, today is yesterday’s tomorrow so the result of my overnight study is: none

the lecturer who’s also a student

Didn’t seem to understand what the lecturer said in the classroom

Attending classes just to kill time and strive for your thesis or final project

I’m rather lucky to experience both currently as a graduate student

They kind of remind me about my own students current state

What’s in their head during my lecture?

Do they understand things i’ve teach taught them?
Sigh…. better evaluate my teaching method

The Problem, The Goal, The Way

The Problem:

  1. No ECC cryptosystem included in Android SDK: they actually use the famous BouncyCastle security and cryptography library but they strip out el-gamal and ecc from it
  2. Pollard rho is currently the fastest cryptanalysis attack for ECC (CMIIW), it can be parallelized, and some random walks can speed up the breaking process just like Teske did with adding and mixed walk

The Goal:

  1. Improve ECC strength against Pollard Rho for ECDLP (Elliptic Curve Discrete Logarithm Problem) with adding or mixed walk (still in choosing process) by reducing their speed up up to 10%
  2. Implement the improved ECC in android SDK

The Way:

  1. Find out how Pollard Rho with adding or mixed walk works, what are their specialities, what are their special cases, and so on,
  2. Modify the ECC (curve, base field, key length, etc.) to nullify the Pollard Rho specialities
  3. Implement and test the curve
  4. Re-modify the ECC if test result indicate failure

Currently:

  1. Stuck in learning Pollard Rho for ECDLP
  2. To much browsing about what android phone to buy
  3. Can’t take the 37 hours a week work in classroom
  4. Nervous about the wedding
  5. Discomforted by the fact that my belly overlaps my career

Cryptography is….

1. 5 hours reading number theories and algebraic structure a week yet re-read the same chapter the following week …

2. useless when you need to decrypt your bosses encrypted handwriting … (you need their secretary to decrypt it)

3. useful when you need to hide forbidden suspicious talk material from your bosses, wife, and client

4. major stress factor in certain science department

5. my thesis topic

Ikuti

Get every new post delivered to your Inbox.