Elliptic Curve Cryptography (ECC)

설립: January 9, 2012

출판물

자료 보기:

- Affine Pairings on ARM
  
  Kristin Lauter, Tolga Acar, Michael Naehrig, Daniel Shumow, Dan Shumow
  
  Lecture Notes in Computer Science 7708, Pairing-based Cryptography -- Pairing 2012 | January 2013
  
  출판
- Improved CRT Algorithm for Class Polynomials in Genus 2
  
  Kristin Lauter, Damien Robert
  
  Algorithmic Number Theory Symposium, ANTS-X 2012 | January 2012
  
  출판 출판
- Modular polynomials via isogeny volcanoes
  
  Reinier Broker, Kristin Lauter, Andrew V. Sutherland
  
  Mathematics of Computation 81 (2012), 1201-1231 | January 2012, 제 81 권
  
  출판 출판 출판
- Affine Pairings on ARM
  
  Tolga Acar, Kristin Lauter, Michael Naehrig, Dan Shumow
  
  2011/43 | May 2011
  
  Cryptology ePrint Archive, Report 2011/243
  
  출판 출판
- Attractive Subfamilies of BLS Curves for Implementing High-Security Pairings
  
  Craig Costello, Kristin Lauter, Michael Naehrig
  
  Progress in Cryptology - INDOCRYPT 2011, Lecture Notes in Computer Science 7107 | January 2011
  
  Publication Publication
- A CM construction for curves of genus 2 and p-rank 1
  
  Laura Hitt O'Connor, Gary McGuire, Michael Naehrig
  
  Journal of Number Theory | January 2010
  
  doi:10.1016/j.jnt.2010.05.002
  
  출판
- An Analysis of Affine Coordinates for Pairing Computation
  
  Kristin Lauter, Peter Montgomery, Michael Naehrig
  
  Pairing 2010 | January 2010
  
  Pairing 2010
  
  출판
- Faster Computation of the Tate Pairing
  
  Christophe Arene, Tanja Lange, Michael Naehrig, Christophe Ritzenthaler
  
  Journal of Number Theory | January 2010
  
  doi:10.1016/j.jnt.2010.05.013
  
  출판
- Faster Pairing Computations on Curves with High-Degree Twists
  
  Craig Costello, Tanja Lange, Michael Naehrig
  
  Public Key Cryptography -- PKC 2010 | January 2010
  
  출판
- New Software Speed Records for Cryptographic Pairings
  
  Michael Naehrig, Ruben Niederhagen, Peter Schwabe
  
  LATINCRYPT 2010 | January 2010
  
  출판
- On compressible pairings and their computation
  
  Michael Naehrig, Paulo S. L. M. Barreto, Peter Schwabe
  
  Progress in Cryptology - AFRICACRYPT 2008 | January 2008
  
  Progress in Cryptology - AFRICACRYPT 2008
  
  출판
- The Elliptic Curve Discrete Logarithm Problem and Equivalent Hard Problems for Elliptic Divisibility Sequences
  
  Kristin Lauter, Katherine Stange
  
  Selected Areas in Cryptography 2008 | January 2008
  
  출판
- Computing endomorphism rings of Jacobians of genus 2 curves over finite fields
  
  David Freeman, Kristin Lauter
  
  Proceedings of SAGA 2007, Number Theory and Its Applications | January 2007
  
  Number Theory and Its Applications
  
  출판
- Pairing-friendly elliptic curves of prime order
  
  Paulo S. L. M. Barreto, Michael Naehrig
  
  Selected Areas in Cryptography - SAC 2005 | January 2006
  
  Selected Areas in Cryptography - SAC 2005
  
  출판
- Signatures for Network Coding
  
  Denis Xavier Charles, Kamal Jain, Kristin Lauter
  
  Invited paper: CISS 2006, appeared in: Int. J. Information and Coding Theory (IJICoT) | January 2006, 제 2006 권
  
  출판
- Signatures for Network Coding
  
  Denis Charles, Kamal Jain, Kristin Lauter
  
  MSR-TR-2005-159 | November 2005
  
  출판
- Computing Modular Polynomials
  
  Kristin Lauter, Denis Charles
  
  MSR-TR-2004-75 | August 2004
  
  출판
- Trading Inversions for Multiplications in Elliptic Curve Cryptography
  
  Mathieu Ciet, Marc Joye, Kristin Lauter, Peter Montgomery
  
  Designs, Codes, and Cryptography | December 2003, 제 2003 권: pp. 257
  
  출판
- Improved Weil and Tate pairings for elliptic and hyperelliptic curves
  
  Kirsten Eisenträger, Kristin Lauter, Peter Montgomery
  
  Algorithmic Number Theory - ANTS-VI, LNCS 3076 | November 2003
  
  LNCS 3076
  
  출판
- Fast Elliptic Curve Arithmetic and Improved Weil Pairing Evaluation
  
  Kirsten Eisenträger, Kristin Lauter, Peter Montgomery
  
  Topics in Cryptology - CT-RSA 2003 | January 2003
  
  Topics in Cryptology - CT-RSA 2003
  
  출판 출판
- Constructing elliptic curves with a given number of points over a finite field
  
  Amod Agashe, Kristin Lauter, Ramarathnam Venkatesan
  
  Fields Insitute Communications Series, Volume 42, High Primes and Misdemeanours: lectures in honour of the 60th birthday of Hugh Cowie Williams | January 2001
  
  출판

- Affine Pairings on ARM
  
  Kristin Lauter, Tolga Acar, Michael Naehrig, Daniel Shumow, Dan Shumow
  
  Lecture Notes in Computer Science 7708, Pairing-based Cryptography -- Pairing 2012 | January 2013
  
  출판
- Affine Pairings on ARM
  
  Tolga Acar, Kristin Lauter, Michael Naehrig, Dan Shumow
  
  2011/43 | May 2011
  
  Cryptology ePrint Archive, Report 2011/243
  
  출판 출판
- Constructing elliptic curves with a given number of points over a finite field
  
  Amod Agashe, Kristin Lauter, Ramarathnam Venkatesan
  
  Fields Insitute Communications Series, Volume 42, High Primes and Misdemeanours: lectures in honour of the 60th birthday of Hugh Cowie Williams | January 2001
  
  출판
- Modular polynomials via isogeny volcanoes
  
  Reinier Broker, Kristin Lauter, Andrew V. Sutherland
  
  Mathematics of Computation 81 (2012), 1201-1231 | January 2012, 제 81 권
  
  출판 출판 출판
- Improved CRT Algorithm for Class Polynomials in Genus 2
  
  Kristin Lauter, Damien Robert
  
  Algorithmic Number Theory Symposium, ANTS-X 2012 | January 2012
  
  출판 출판
- Attractive Subfamilies of BLS Curves for Implementing High-Security Pairings
  
  Craig Costello, Kristin Lauter, Michael Naehrig
  
  Progress in Cryptology - INDOCRYPT 2011, Lecture Notes in Computer Science 7107 | January 2011
  
  Publication Publication
- Faster Pairing Computations on Curves with High-Degree Twists
  
  Craig Costello, Tanja Lange, Michael Naehrig
  
  Public Key Cryptography -- PKC 2010 | January 2010
  
  출판
- Faster Computation of the Tate Pairing
  
  Christophe Arene, Tanja Lange, Michael Naehrig, Christophe Ritzenthaler
  
  Journal of Number Theory | January 2010
  
  doi:10.1016/j.jnt.2010.05.013
  
  출판
- On compressible pairings and their computation
  
  Michael Naehrig, Paulo S. L. M. Barreto, Peter Schwabe
  
  Progress in Cryptology - AFRICACRYPT 2008 | January 2008
  
  Progress in Cryptology - AFRICACRYPT 2008
  
  출판
- The Elliptic Curve Discrete Logarithm Problem and Equivalent Hard Problems for Elliptic Divisibility Sequences
  
  Kristin Lauter, Katherine Stange
  
  Selected Areas in Cryptography 2008 | January 2008
  
  출판
- Computing endomorphism rings of Jacobians of genus 2 curves over finite fields
  
  David Freeman, Kristin Lauter
  
  Proceedings of SAGA 2007, Number Theory and Its Applications | January 2007
  
  Number Theory and Its Applications
  
  출판
- Signatures for Network Coding
  
  Denis Xavier Charles, Kamal Jain, Kristin Lauter
  
  Invited paper: CISS 2006, appeared in: Int. J. Information and Coding Theory (IJICoT) | January 2006, 제 2006 권
  
  출판
- Signatures for Network Coding
  
  Denis Charles, Kamal Jain, Kristin Lauter
  
  MSR-TR-2005-159 | November 2005
  
  출판
- Trading Inversions for Multiplications in Elliptic Curve Cryptography
  
  Mathieu Ciet, Marc Joye, Kristin Lauter, Peter Montgomery
  
  Designs, Codes, and Cryptography | December 2003, 제 2003 권: pp. 257
  
  출판
- Improved Weil and Tate pairings for elliptic and hyperelliptic curves
  
  Kirsten Eisenträger, Kristin Lauter, Peter Montgomery
  
  Algorithmic Number Theory - ANTS-VI, LNCS 3076 | November 2003
  
  LNCS 3076
  
  출판
- Fast Elliptic Curve Arithmetic and Improved Weil Pairing Evaluation
  
  Kirsten Eisenträger, Kristin Lauter, Peter Montgomery
  
  Topics in Cryptology - CT-RSA 2003 | January 2003
  
  Topics in Cryptology - CT-RSA 2003
  
  출판 출판
- An Analysis of Affine Coordinates for Pairing Computation
  
  Kristin Lauter, Peter Montgomery, Michael Naehrig
  
  Pairing 2010 | January 2010
  
  Pairing 2010
  
  출판
- A CM construction for curves of genus 2 and p-rank 1
  
  Laura Hitt O'Connor, Gary McGuire, Michael Naehrig
  
  Journal of Number Theory | January 2010
  
  doi:10.1016/j.jnt.2010.05.002
  
  출판
- On compressible pairings and their computation
  
  Michael Naehrig, Paulo S. L. M. Barreto, Peter Schwabe
  
  Progress in Cryptology - AFRICACRYPT 2008 | January 2008
  
  Progress in Cryptology - AFRICACRYPT 2008
  
  출판
- Computing Modular Polynomials
  
  Kristin Lauter, Denis Charles
  
  MSR-TR-2004-75 | August 2004
  
  출판
- New Software Speed Records for Cryptographic Pairings
  
  Michael Naehrig, Ruben Niederhagen, Peter Schwabe
  
  LATINCRYPT 2010 | January 2010
  
  출판
- Computing Modular Polynomials
  
  Kristin Lauter, Denis Charles
  
  MSR-TR-2004-75 | August 2004
  
  출판
- Pairing-friendly elliptic curves of prime order
  
  Paulo S. L. M. Barreto, Michael Naehrig
  
  Selected Areas in Cryptography - SAC 2005 | January 2006
  
  Selected Areas in Cryptography - SAC 2005
  
  출판

- Constructing elliptic curves with a given number of points over a finite field
  
  Amod Agashe, Kristin Lauter, Ramarathnam Venkatesan
  
  Fields Insitute Communications Series, Volume 42, High Primes and Misdemeanours: lectures in honour of the 60th birthday of Hugh Cowie Williams | January 2001
  
  출판
- Affine Pairings on ARM
  
  Kristin Lauter, Tolga Acar, Michael Naehrig, Daniel Shumow, Dan Shumow
  
  Lecture Notes in Computer Science 7708, Pairing-based Cryptography -- Pairing 2012 | January 2013
  
  출판
- Improved CRT Algorithm for Class Polynomials in Genus 2
  
  Kristin Lauter, Damien Robert
  
  Algorithmic Number Theory Symposium, ANTS-X 2012 | January 2012
  
  출판 출판
- Attractive Subfamilies of BLS Curves for Implementing High-Security Pairings
  
  Craig Costello, Kristin Lauter, Michael Naehrig
  
  Progress in Cryptology - INDOCRYPT 2011, Lecture Notes in Computer Science 7107 | January 2011
  
  Publication Publication
- Faster Pairing Computations on Curves with High-Degree Twists
  
  Craig Costello, Tanja Lange, Michael Naehrig
  
  Public Key Cryptography -- PKC 2010 | January 2010
  
  출판
- An Analysis of Affine Coordinates for Pairing Computation
  
  Kristin Lauter, Peter Montgomery, Michael Naehrig
  
  Pairing 2010 | January 2010
  
  Pairing 2010
  
  출판
- New Software Speed Records for Cryptographic Pairings
  
  Michael Naehrig, Ruben Niederhagen, Peter Schwabe
  
  LATINCRYPT 2010 | January 2010
  
  출판
- On compressible pairings and their computation
  
  Michael Naehrig, Paulo S. L. M. Barreto, Peter Schwabe
  
  Progress in Cryptology - AFRICACRYPT 2008 | January 2008
  
  Progress in Cryptology - AFRICACRYPT 2008
  
  출판
- The Elliptic Curve Discrete Logarithm Problem and Equivalent Hard Problems for Elliptic Divisibility Sequences
  
  Kristin Lauter, Katherine Stange
  
  Selected Areas in Cryptography 2008 | January 2008
  
  출판
- Computing endomorphism rings of Jacobians of genus 2 curves over finite fields
  
  David Freeman, Kristin Lauter
  
  Proceedings of SAGA 2007, Number Theory and Its Applications | January 2007
  
  Number Theory and Its Applications
  
  출판
- Pairing-friendly elliptic curves of prime order
  
  Paulo S. L. M. Barreto, Michael Naehrig
  
  Selected Areas in Cryptography - SAC 2005 | January 2006
  
  Selected Areas in Cryptography - SAC 2005
  
  출판
- Improved Weil and Tate pairings for elliptic and hyperelliptic curves
  
  Kirsten Eisenträger, Kristin Lauter, Peter Montgomery
  
  Algorithmic Number Theory - ANTS-VI, LNCS 3076 | November 2003
  
  LNCS 3076
  
  출판
- Fast Elliptic Curve Arithmetic and Improved Weil Pairing Evaluation
  
  Kirsten Eisenträger, Kristin Lauter, Peter Montgomery
  
  Topics in Cryptology - CT-RSA 2003 | January 2003
  
  Topics in Cryptology - CT-RSA 2003
  
  출판 출판
- Modular polynomials via isogeny volcanoes
  
  Reinier Broker, Kristin Lauter, Andrew V. Sutherland
  
  Mathematics of Computation 81 (2012), 1201-1231 | January 2012, 제 81 권
  
  출판 출판 출판
- Faster Computation of the Tate Pairing
  
  Christophe Arene, Tanja Lange, Michael Naehrig, Christophe Ritzenthaler
  
  Journal of Number Theory | January 2010
  
  doi:10.1016/j.jnt.2010.05.013
  
  출판
- A CM construction for curves of genus 2 and p-rank 1
  
  Laura Hitt O'Connor, Gary McGuire, Michael Naehrig
  
  Journal of Number Theory | January 2010
  
  doi:10.1016/j.jnt.2010.05.002
  
  출판
- Signatures for Network Coding
  
  Denis Xavier Charles, Kamal Jain, Kristin Lauter
  
  Invited paper: CISS 2006, appeared in: Int. J. Information and Coding Theory (IJICoT) | January 2006, 제 2006 권
  
  출판
- Trading Inversions for Multiplications in Elliptic Curve Cryptography
  
  Mathieu Ciet, Marc Joye, Kristin Lauter, Peter Montgomery
  
  Designs, Codes, and Cryptography | December 2003, 제 2003 권: pp. 257
  
  출판
- Affine Pairings on ARM
  
  Tolga Acar, Kristin Lauter, Michael Naehrig, Dan Shumow
  
  2011/43 | May 2011
  
  Cryptology ePrint Archive, Report 2011/243
  
  출판 출판
- Signatures for Network Coding
  
  Denis Charles, Kamal Jain, Kristin Lauter
  
  MSR-TR-2005-159 | November 2005
  
  출판
- Computing Modular Polynomials
  
  Kristin Lauter, Denis Charles
  
  MSR-TR-2004-75 | August 2004
  
  출판

Elliptic Curve Cryptography (ECC)

출판물

Affine Pairings on ARM

Improved CRT Algorithm for Class Polynomials in Genus 2

Modular polynomials via isogeny volcanoes

Affine Pairings on ARM

Attractive Subfamilies of BLS Curves for Implementing High-Security Pairings

A CM construction for curves of genus 2 and p-rank 1

An Analysis of Affine Coordinates for Pairing Computation

Faster Computation of the Tate Pairing

Faster Pairing Computations on Curves with High-Degree Twists

New Software Speed Records for Cryptographic Pairings

On compressible pairings and their computation

The Elliptic Curve Discrete Logarithm Problem and Equivalent Hard Problems for Elliptic Divisibility Sequences

Computing endomorphism rings of Jacobians of genus 2 curves over finite fields

Pairing-friendly elliptic curves of prime order

Signatures for Network Coding

Signatures for Network Coding

Computing Modular Polynomials

Trading Inversions for Multiplications in Elliptic Curve Cryptography

Improved Weil and Tate pairings for elliptic and hyperelliptic curves

Fast Elliptic Curve Arithmetic and Improved Weil Pairing Evaluation

Constructing elliptic curves with a given number of points over a finite field

Affine Pairings on ARM

Affine Pairings on ARM

Constructing elliptic curves with a given number of points over a finite field

Modular polynomials via isogeny volcanoes

Improved CRT Algorithm for Class Polynomials in Genus 2

Attractive Subfamilies of BLS Curves for Implementing High-Security Pairings

Faster Pairing Computations on Curves with High-Degree Twists

Faster Computation of the Tate Pairing

On compressible pairings and their computation

The Elliptic Curve Discrete Logarithm Problem and Equivalent Hard Problems for Elliptic Divisibility Sequences

Computing endomorphism rings of Jacobians of genus 2 curves over finite fields

Signatures for Network Coding

Signatures for Network Coding

Trading Inversions for Multiplications in Elliptic Curve Cryptography

Improved Weil and Tate pairings for elliptic and hyperelliptic curves

Fast Elliptic Curve Arithmetic and Improved Weil Pairing Evaluation

An Analysis of Affine Coordinates for Pairing Computation

A CM construction for curves of genus 2 and p-rank 1

On compressible pairings and their computation

Computing Modular Polynomials

New Software Speed Records for Cryptographic Pairings

Computing Modular Polynomials

Pairing-friendly elliptic curves of prime order

Constructing elliptic curves with a given number of points over a finite field

Affine Pairings on ARM

Improved CRT Algorithm for Class Polynomials in Genus 2

Attractive Subfamilies of BLS Curves for Implementing High-Security Pairings

Faster Pairing Computations on Curves with High-Degree Twists

An Analysis of Affine Coordinates for Pairing Computation

New Software Speed Records for Cryptographic Pairings

On compressible pairings and their computation

The Elliptic Curve Discrete Logarithm Problem and Equivalent Hard Problems for Elliptic Divisibility Sequences

Computing endomorphism rings of Jacobians of genus 2 curves over finite fields

Pairing-friendly elliptic curves of prime order

Improved Weil and Tate pairings for elliptic and hyperelliptic curves

Fast Elliptic Curve Arithmetic and Improved Weil Pairing Evaluation

Modular polynomials via isogeny volcanoes

Faster Computation of the Tate Pairing

A CM construction for curves of genus 2 and p-rank 1

Signatures for Network Coding

Trading Inversions for Multiplications in Elliptic Curve Cryptography

Affine Pairings on ARM

Signatures for Network Coding

Computing Modular Polynomials