Elliptic Curves and encryption

from the wikipedia article:

Public-key cryptography is based on the intractability of certain mathematical problems. Early public-key systems are secure assuming that it is difficult to factor a large integer composed of two or more large prime factors. For elliptic-curve-based protocols, it is assumed that finding the discrete logarithm of a random elliptic curve element with respect to a publicly known base point is infeasible. The size of the elliptic curve determines the difficulty of the problem.

We will be discussing the base concepts required for ECC - namely discrete log and finite fields (or modular number systems), followed by the application to cryptography. At the end, we will discuss the underpinnings that make ECC difficult to reverse and what could change that.

Join or login to comment.

  • Nile

    Great job, Chris, in the explanation and in answering all of the questions we had.

    February 17, 2013

  • chris

    we will be upstairs

    February 17, 2013

  • Heurihermilab

    I cannot guarantee my attendance, but this appears to be a rare opportunity to combine two life-long interests, math and cryptography. Thanks!

    February 11, 2013

14 went

People in this
Meetup are also in:

Create a Meetup Group and meet new people

Get started Learn more

I started the group because there wasn't any other type of group like this. I've met some great folks in the group who have become close friends and have also met some amazing business owners.

Bill, started New York City Gay Craft Beer Lovers

Sign up

Meetup members, Log in

By clicking "Sign up" or "Sign up using Facebook", you confirm that you accept our Terms of Service & Privacy Policy