dblp.uni-trier.dewww.dagstuhl.dewww.uni-trier.de

Ben Lynn (Selection)

List of publications from the DBLP Bibliography Server - FAQ
Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo

Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo


12Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPaulo S. L. M. Barreto, Ben Lynn, Michael Scott: Efficient Implementation of Pairing-Based Cryptosystems. J. Cryptology 17(4): 321-334 (2004)
10Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPaulo S. L. M. Barreto, Ben Lynn, Michael Scott: On the Selection of Pairing-Friendly Groups. Selected Areas in Cryptography 2003: 17-25
9Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPaulo S. L. M. Barreto, Ben Lynn, Michael Scott: On the Selection of Pairing-Friendly Groups. IACR Cryptology ePrint Archive 2003: 86 (2003)
8Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPaulo S. L. M. Barreto, Hae Yong Kim, Ben Lynn, Michael Scott: Efficient Algorithms for Pairing-Based Cryptosystems. CRYPTO 2002: 354-368
6Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPaulo S. L. M. Barreto, Ben Lynn, Michael Scott: Constructing Elliptic Curves with Prescribed Embedding Degrees. SCN 2002: 257-267
3Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPaulo S. L. M. Barreto, Hae Yong Kim, Ben Lynn, Michael Scott: Efficient Algorithms for Pairing-Based Cryptosystems. IACR Cryptology ePrint Archive 2002: 8 (2002)
2Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPaulo S. L. M. Barreto, Ben Lynn, Michael Scott: Constructing Elliptic Curves with Prescribed Embedding Degrees. IACR Cryptology ePrint Archive 2002: 88 (2002)

Selection of 7 from 15 records - Ben Lynn has 9 coauthors

Last update 2012-09-10 CET by the DBLP TeamThis material is Open Data Content released under the ODC-BY 1.0 license — See also our legal information page