Why I need to learn so muchmath for my PhD research            Marisa W. Paryasto    School of Electrical Engineering and ...
My Researchq  Title: Elliptic Curve Cryptography    Algorithm Implementation and    Design for Constrained Devicesq  Tar...
Math Foundation neededq  Number Theory q  Finite Fieldsq  Algebra           ⣄  Basic Properties   ⣄    Groups          ...
What is Elliptic Curve                Cryptography?q     Point multiplication Q = kPq     Repeated point addition and   ...
Hierarchical Model for Elliptic Curve Cryptography
Research Questionsq  Implementing ECC is not simple.    Especially in constrained devices.q  How do you know that it s s...
More problemsq  There is no guide yet for    implementing ECC efficientlyq  There is no tools to predict certain    config...
Hypothesisq  There is exist some (generic)    algorithm to implement ECC.q  Different implementation algorithms    deter...
Methods (to solve the problems)q   Improve an architecture to be    resistance against side channel    attacks   ⣄  Async...
Contribution               Efficient               software                 Attack of ECC                            Hardwa...
Upcoming SlideShare
Loading in …5
×

Why i need to learn so much math for my phd research

410 views

Published on

Published in: Education
0 Comments
0 Likes
Statistics
Notes
  • Be the first to comment

  • Be the first to like this

No Downloads
Views
Total views
410
On SlideShare
0
From Embeds
0
Number of Embeds
5
Actions
Shares
0
Downloads
4
Comments
0
Likes
0
Embeds 0
No embeds

No notes for slide

Why i need to learn so much math for my phd research

  1. 1. Why I need to learn so muchmath for my PhD research Marisa W. Paryasto School of Electrical Engineering and Informatics ITB July 23rd, 2009
  2. 2. My Researchq  Title: Elliptic Curve Cryptography Algorithm Implementation and Design for Constrained Devicesq  Target: Make it fits constrained devices [constrained devices = some tiny little spaces about 1mm2]
  3. 3. Math Foundation neededq  Number Theory q  Finite Fieldsq  Algebra ⣄  Basic Properties ⣄  Groups ⣄  Field Extensions ⣄  Rings ⣄  Roots of ⣄  Fields Irreducible Polynomials ⣄  Polynomial ⣄  Bases of Finite Fields ⣄  Finite Fields GF (2m)
  4. 4. What is Elliptic Curve Cryptography?q  Point multiplication Q = kPq  Repeated point addition and doubling: 9P = 2(2(2P)) + Pq  Public key operation: Q(x,y) = kP(x,y) Q = public key P = base point (curve parameter) k = private key n = order of Pq  Elliptic curve discrete logarithm Given public key kP, find private key kq  Best known attack: Pollard s rho method with running time: ((πn)½))/2
  5. 5. Hierarchical Model for Elliptic Curve Cryptography
  6. 6. Research Questionsq  Implementing ECC is not simple. Especially in constrained devices.q  How do you know that it s secure and being implemented securely?
  7. 7. More problemsq  There is no guide yet for implementing ECC efficientlyq  There is no tools to predict certain configurations of ECC and its level of security
  8. 8. Hypothesisq  There is exist some (generic) algorithm to implement ECC.q  Different implementation algorithms determine different level of security. (Notes: metric of security?)
  9. 9. Methods (to solve the problems)q  Improve an architecture to be resistance against side channel attacks ⣄  Asynchronous circuits implementationq  Develop a configurable, integrated ECC modules (to measure security/ efficiency/space/speed)
  10. 10. Contribution Efficient software Attack of ECC Hardware implementati hardware Efficient implementati on of ECC/ implementatiimplementati on of ECC on Reconfigurabl on on on of ECC constrained e ECC constrained devices implementati device on basis various   smart attack conversion library circuit algorithm     synthesis math software hardware math / foundation

×