|
|

Kristin Lauter
Senior Researcher
Manager,
Cryptography group
Kristin Lauter is a Senior
Researcher and the head of the Cryptography Group at Microsoft Research.
She directs the group's research activities in theoretical and applied
cryptography and in the related math fields of number theory and algebraic
geometry. Group members publish basic research in prestigious journals and
conferences and collaborate with academia through joint publications, and by
helping to organize conferences and serve on program committees. The group also works closely with product groups, providing consulting services
and technology transfer. The group maintains an active program of
post-docs, interns, and visiting scholars. Her personal research interests include
algorithmic number theory, elliptic curve cryptography, hash functions, and
security protocols.
Conferences organized:
Program committees:
Crypto
2007, ICISC 2007,
ANTS 2008,
Pairings 2008,
Crypto 2008,
SAC 2008
Recent talks
Elliptic Curve Cryptography
Recent papers:
Cryptography
-
Stronger Security of Authenticated Key Exchange,
by Brian LaMacchia, Kristin Lauter,
Anton Mityagin, in
ProvSec2007,
submitted version,
published version.
-
Signatures for Network Coding,
by Denis Charles, Kamal Jain, Kristin Lauter,
Invited paper for
CISS06,
to appear in Int. J.
Information and Coding Theory (IJICoT)
-
Security Analysis of KEA
Authenticated Key Exchange, by
Kristin Lauter and Anton Mityagin,
In
PKC2006
-
Cryptographic hash
functions from expander graphs,
by Denis Charles, Eyal Goren, Kristin Lauter,
Second NIST Hash Function Workshop to appear in Journal of
Cryptology.
Arithmetic Geometry
-
The distance between
superspecial abelian varieties with real multiplication,
by Eyal Goren, Kristin Lauter,
submitted.
-
Families of Ramanujan
graphs and quaternion algebras, by Denis Charles, Eyal Goren, Kristin Lauter,
to appear in AMS-CRM volume
"Groups
and Symmetries" in honor of John McKay.
-
Computing
the Cassels pairing on Kolyvagin classes in the
Shafarevich-Tate group, by Kirsten Eisentraeger, Dimitar Jetchev, Kristin Lauter,
submitted,
data file for example.
-
Evil Primes and
Superspecial Moduli,
by Eyal Goren,
Kristin Lauter,
International Mathematics Research Notices, volume 2006, Article
ID 53864, pages 1–19.
(http://arxiv.org/abs/math/0512472)
-
Class invariants of quartic CM fields,
by Eyal Goren,
Kristin Lauter,
Annales de
l'Institut Fourier, Vol.
57 no.
2 (2007),
p. 457-480.
(http://www.arxiv.org/math.NT/0404378)
-
Primes in the denominators of Igusa class polynomials,
by
Kristin Lauter.
(http://www.arxiv.org/math.NT/0301240)
Cryptographic implementation
improvements
-
Trading Inversions for Multiplications in Elliptic Curve Cryptography,
by Mathieu Ciet, Marc Joye, Kristin Lauter and Peter L. Montgomery,
In Designs, Codes, and Cryptography.
Published
version. http://eprint.iacr.org/2003/257/
-
Fast Elliptic Curve Arithmetic and Improved Weil Pairing Evaluation,
by K.
Eisentraeger,
K. Lauter, P.L. Montgomery,
In: Topics in Cryptology - CT-RSA 2003, M. Joye (Ed.): LNCS 2612, 343-354, Springer, Berlin 2003.
-
The equivalence of the geometric and algebraic group laws for
Jacobians of genus 2 curves,
by K. Lauter,
Topics in Algebraic and Noncommutative Geometry,
AMS Contemporary Mathematics Series 324 (2003) 165--171.
Algorithmic number theory
-
Computing Hilbert class polynomials,
by Juliana Belding, Reinier
Broker, Andreas Enge, Kristin Lauter, submitted.
-
Computing endomorphism rings
of Jacobians of genus 2 curves over finite fields, by David
Freeman, Kristin Lauter,
to appear in the Proceedings of SAGA 2007,
Number Theory and its applications, World Scientific.
(http://www.arxiv.org/math.NT/0701305)
.-
Computing Modular Polynomials,
by Denis Charles, Kristin Lauter,
London Math Society Journal of Computation and Mathematics,
The LMS
JCM,
(8)
195-204.
-
A CRT algorithm for constructing
genus 2 curves over finite fields,
by Kirsten
Eisentraeger, Kristin Lauter, to appear in Proceedings of AGCT
2005.
(http://www.arxiv.org/math.NT/0405305)
-
Constructing elliptic curves with a known number of points over a prime field,
by A.
Agashe, K. Lauter, R.
Venkatesan, High Primes and Misdemeanours: lectures in honour of the 60th birthday of Hugh Cowie Williams, Fields Institute Communications Series, Volume 42, pp. 1-17.
Number of points on curves over
finite fields
|