Elliptic Nets with Applications to Cryptography
An elliptic divisibility sequence is an integer recurrence sequence related to the multiples of a rational point on an elliptic curve. We generalise this definition to higher dimensions: an elliptic net is a map from Zn to Z encoding information about the Mordell-Weil group. This gives new methods of computation on elliptic curves, including a new algorithm to compute the Tate pairing for pairing-based cryptography.
Speaker Details
Katherine Stange is a student of Joseph Silverman at Brown University. She was born and grew up in the snows of Northern Ontario, Canada, and completed her Bachelor of Mathematics at the University of Waterloo. Her research interests include arithmetic and diophantine geometry, elliptic curves, number theory, sequences and – recently – cryptography. When not in the office, she’s on her bicycle.
- Date:
- Speakers:
- Katherine Stange
- Affiliation:
- Brown University
-
-
Jeff Running
-
