Search
International Association for Cryptologic Research
What's new
Archive
Best Papers
Videos
Authors
Coauthors
By year
By conference
All Committees
Most Committees
Report errors
Maps
About
Michael Scott
Search web for home page
Program Committees
1
2011
Eurocrypt
pc
Publications
year
title
booktitle
pages
1
2011
Endomorphisms for Faster Elliptic Curve Cryptography on a Large Class of Curves
jofc
446-469
2
2010
Faster Squaring in the Cyclotomic Subgroup of Sixth Degree Extensions
pkc
209-223
3
2010
A Taxonomy of Pairing-Friendly Elliptic Curves
jofc
224-280
4
2009
Implementing cryptographic pairings: a magma tutorial
eprint
online
5
2009
Endomorphisms for Faster Elliptic Curve Cryptography on a Large Class of Curves
eurocrypt
518-535
6
2008
Exponentiation in pairing-friendly groups using homomorphisms
eprint
online
7
2008
Fast hashing to G2 on pairing friendly curves
eprint
online
8
2008
Endomorphisms for faster elliptic curve cryptography on a large class of curves
eprint
online
9
2007
Optimizing Multiprecision Multiplication for Public Key Cryptography
eprint
online
10
2007
Accelerating SSL using the Vector processors in IBM's Cell Broadband Engine for Sony's Playstation 3
eprint
online
11
2007
Implementing Cryptographic Pairings over Barreto-Naehrig Curves
eprint
online
12
2007
Optimal Irreducible Polynomials for GF(2^m) Arithmetic
eprint
online
13
2007
Constructing Brezing-Weng pairing friendly elliptic curves using elements in the cyclotomic field
eprint
online
14
2006
Implementing Cryptographic Pairings on Smartcards
ches
online
15
2006
A taxonomy of pairing-friendly elliptic curves
eprint
online
16
2006
Implementing Cryptographic Pairings on Smartcards
eprint
online
17
2006
Multiplication and Squaring on Pairing-Friendly Fields
eprint
online
18
2006
Side Channel Analysis of Practical Pairing Implementations: Which Path is More Secure?
eprint
online
19
2006
Pairing Calculation on Supersingular Genus 2 Curves
eprint
online
20
2005
Faster Pairings using an Elliptic Curve with an Efficient Endomorphism
eprint
online
21
2005
A Dedicated Processor for the eta Pairing
eprint
online
22
2005
On a (Flawed) Proposal to Build More Pairing-Friendly Curves
eprint
online
23
2005
Scaling security in pairing-based protocols
eprint
online
24
2005
Secure Delegation of Elliptic-Curve Pairing
eprint
online
25
2004
Generating more MNT elliptic curves
eprint
online
26
2004
Efficient Pairing Computation on Supersingular Abelian Varieties
eprint
online
27
2004
Compressed Pairings
crypto
online
28
2004
Cryptanalysis of an ID-based Password Authentication Scheme using Smart Cards and Fingerprints
eprint
online
29
2004
Compressed Pairings
eprint
online
30
2004
Efficient Implementation of Pairing-Based Cryptosystems
jofc
321-334
31
2003
On the Selection of Pairing-Friendly Groups
eprint
online
32
2003
Did Filiol Break AES ?
eprint
online
33
2002
Efficient Algorithms for Pairing-Based Cryptosystems
eprint
online
34
2002
Constructing Elliptic Curves with Prescribed Embedding Degrees
eprint
online
35
2002
Authenticated ID-based Key Exchange and remote log-in with simple token and PIN number
eprint
online
36
2002
Efficient Algorithms for Pairing-Based Cryptosystems
crypto
online
Coauthors of Michael Scott
Wesam Abdulwahab
Paulo S. L. M. Barreto
Naomi Benger
Manuel Charlemagne
Benoît Chevallier-Mames
Jean-Sébastien Coron
Neil Costigan
Nicolas Courtois
Ricardo Dahab
Augusto Jun Devegili
David Freeman
Steven D. Galbraith
Robert Granger
Colm O hEigeartaigh
Robert T. Johnson
Pascal Junod
Ezekiel J. Kachisa
Tim Kerins
Hae Yong Kim
Hae Y. Kim
Xibin Lin
Ben Lynn
William P. Marnane
Noel McCullagh
Colin Murphy
David Naccache
Luis J. Dominguez Perez
Thomas Pornin
Robert Ronan
Edward F. Schaefer
Piotr Szczechowiak
Edlyn Teske
Claire Whelan
