Michael Scott

Citado por

	Total	Desde 2019
Citas	9699	2052
Índice h	41	26
Índice i10	70	44

740

370

185

555

2002200320042005200620072008200920102011201220132014201520162017201820192020202120222023202425 68 125 285 339 387 453 597 730 686 560 637 604 498 490 548 355 407 343 328 374 327 270

Acceso público

Ver todo

9 artículos

1 artículo

disponibles

no disponibles

Basado en requisitos de financiación

Coautores

Paulo BarretoUniversity of Washington TacomaDirección de correo verificada de uw.edu
Ben LynnStanford UniversityDirección de correo verificada de cs.stanford.edu
Steven GalbraithProfessor of Pure Mathematics, University of Auckland, NZDirección de correo verificada de math.auckland.ac.nz
Ricardo DahabProfessor of Computer Science, University of CampinasDirección de correo verificada de ic.unicamp.br
Luis J. Dominguez PerezAssistant Professor. ITESODirección de correo verificada de iteso.mx
Leonardo Barbosa e OliveiraProfessor of Computer Science, Universidade Federal de Minas GeraisDirección de correo verificada de dcc.ufmg.br
David FreemanMeta Platforms Inc.Dirección de correo verificada de cs.stanford.edu
Robert GrangerReader (Associate Professor), Department of Computer Science, University of SurreyDirección de correo verificada de surrey.ac.uk
Diego F. AranhaAssociate Professor in Computer Science, Aarhus UniversityDirección de correo verificada de cs.au.dk
Julio LópezProfessor of Computer Science, University of CampinasDirección de correo verificada de ic.unicamp.br
Conrado Porto Lopes GouveaCryptography Engineer, Zcash FoundationDirección de correo verificada de ic.unicamp.br
Dr. Khalid JaveedUniversity of SharjahDirección de correo verificada de sharjah.ac.ae
Xiaojun WangDublin City UniversityDirección de correo verificada de dcu.ie
Claire WhelanTrinity College DublinDirección de correo verificada de scss.tcd.ie
William MarnaneDepartment of Electrical & Electronic Engineering , University College CorkDirección de correo verificada de ucc.ie
David NaccacheENS (Equipe Securité) & visiting RHUL (ISG)Dirección de correo verificada de ens.fr
Jean-Sebastien CoronProfessor of Computer Science, University of LuxembourgDirección de correo verificada de uni.lu
Benoit Chevallier-MamesZamaDirección de correo verificada de zama.ai
Alfred MenezesUniversity of WaterlooDirección de correo verificada de uwaterloo.ca
Charlie DalyLecturer in Computer ScienceDirección de correo verificada de computing.dcu.ie

Seguir

Michael Scott

MIRACL Labs, Dublin, Ireland

Dirección de correo verificada de miracl.com

Cryptography


Título Ordenar por citas Ordenar por año Ordenar por título	Citado por Citado por	Año
Efficient algorithms for pairing-based cryptosystems PSLM Barreto, HY Kim, B Lynn, M Scott Advances in Cryptology—CRYPTO 2002: 22nd Annual International Cryptology …, 2002	1598	2002
A taxonomy of pairing-friendly elliptic curves D Freeman, M Scott, E Teske Journal of cryptology 23, 224-280, 2010	690	2010
Efficient pairing computation on supersingular abelian varieties PSLM Barreto, SD Galbraith, CÓ hÉigeartaigh, M Scott Designs, Codes and Cryptography 42, 239-271, 2007	662	2007
Constructing elliptic curves with prescribed embedding degrees PSLM Barreto, B Lynn, M Scott Security in Communication Networks: Third International Conference, SCN 2002 …, 2003	472	2003
NanoECC: Testing the limits of elliptic curve cryptography in sensor networks P Szczechowiak, LB Oliveira, M Scott, M Collier, R Dahab Wireless Sensor Networks: 5th European Conference, EWSN 2008, Bologna, Italy …, 2008	412	2008
MIRACL–Multiprecision Integer and Rational Arithmetic C/C++ Library M Scott Shamus Software Ltd, Dublin, Ireland, URL, 2003	382*	2003
TinyPBC: Pairings for authenticated identity-based non-interactive key distribution in sensor networks LB Oliveira, DF Aranha, CPL Gouvêa, M Scott, DF Câmara, J López, ... Computer communications 34 (3), 485-493, 2011	378	2011
On the selection of pairing-friendly groups PSLM Barreto, B Lynn, M Scott Selected Areas in Cryptography: 10th Annual International Workshop, SAC 2003 …, 2004	277	2004
Computing the Tate pairing M Scott Cryptographers’ Track at the RSA Conference, 293-304, 2005	259	2005
Implementing cryptographic pairings on smartcards M Scott, N Costigan, W Abdulwahab International Workshop on Cryptographic Hardware and Embedded Systems, 134-147, 2006	232	2006
Constructing Brezing-Weng pairing-friendly elliptic curves using elements in the cyclotomic field EJ Kachisa, EF Schaefer, M Scott International conference on pairing-based cryptography, 126-135, 2008	225	2008
Efficient implementation of pairing-based cryptosystems PSLM Barreto, B Lynn, M Scott Journal of Cryptology 17, 321-334, 2004	218	2004
Implementing cryptographic pairings over Barreto-Naehrig curves AJ Devegili, M Scott, R Dahab International Conference on Pairing-Based Cryptography, 197-207, 2007	201	2007
Implementing cryptographic pairings M Scott Lecture Notes in Computer Science 4575, 177, 2007	194	2007
Authenticated ID-based key exchange and remote log-in with simple token and PIN number M Scott Cryptology ePrint Archive, 2002	190	2002
Compressed pairings M Scott, PSLM Barreto Advances in Cryptology–CRYPTO 2004: 24th Annual International Cryptology …, 2004	178	2004
On the final exponentiation for calculating pairings on ordinary elliptic curves M Scott, N Benger, M Charlemagne, LJ Dominguez Perez, EJ Kachisa Pairing-Based Cryptography–Pairing 2009: Third International Conference Palo …, 2009	176	2009
Secure delegation of elliptic-curve pairing B Chevallier-Mames, JS Coron, N McCullagh, D Naccache, M Scott Smart Card Research and Advanced Application: 9th IFIP WG 8.8/11.2 …, 2010	161	2010
Endomorphisms for faster elliptic curve cryptography on a large class of curves SD Galbraith, X Lin, M Scott Journal of cryptology 24 (3), 446-469, 2011	131	2011
On the application of pairing based cryptography to wireless sensor networks P Szczechowiak, A Kargl, M Scott, M Collier Proceedings of the second ACM conference on Wireless network security, 1-12, 2009	131	2009

El sistema no puede realizar la operación en estos momentos. Inténtalo de nuevo más tarde.

Artículos 1–20

Citas por año

Citas duplicadas

Citas combinadas

Añadir coautoresCoautores

Seguir

Citado por

Coautores