Paulo S. L. M. Barreto

Paulo S. L. M. Barreto
Born (1965-11-19) 19 November 1965
Brazil Salvador, Bahia, Brazil
Residence Brazil São Paulo, Brazil
Institutions

Escola Politécnica, University of São Paulo

Institute of Technology, University of Washington Tacoma
Alma mater University of São Paulo
Known for Cryptographic hash functions, Pairing-based cryptography, Post-quantum cryptography
Website
http://www.larc.usp.br/~pbarreto/

Paulo S. L. M. Barreto (born 1965) is a Brazilian cryptographer and one of the designers of the Whirlpool hash function and the block ciphers Anubis and KHAZAD, together with Vincent Rijmen. He has also co-authored a number of research works on elliptic curve cryptography and pairing-based cryptography, including the eta pairing technique,[1] identity-based cryptographic protocols, and the family of Barreto-Naehrig (BN) pairing-friendly elliptic curves (together with Michael Naehrig).[2] More recently he has been focussing his research on post-quantum cryptography, being one of the discoverers of quasi-dyadic codes (together with Rafael Misoczki).[3] His paper "Efficient Algorithms for Pairing-Based Cryptosystems", jointly written with Hae Y. Kim, Ben Lynn and Mike Scott and presented at the Crypto 2002 conference, has been identified in March 2005 as a "Hot Paper", and in December 2005 as "Fast Breaking Paper", by Thomson ISI's Essential Science Indicators, by virtue of being among the top one-tenth of one percent (0.1%) most cited papers and by having the largest percentage increase in citations in the Computer Science category.[4][5]

Barreto was born in Salvador, capital of the northeastern state of Bahia, Brazil. In 1987, he graduated in Physics at the University of São Paulo. He subsequently worked at Unisys Brazil Ltd and Scopus Tecnologia S/A as a software developer and then as chief cryptographer. Barreto received his Ph.D. degree in 2003. He has been awarded the SFI E. T. S. Walton Award 2008-2009. He was associate professor at the Department of Computer and Digital Systems Engineering, Escola Politécnica, University of São Paulo. He is currently a professor at Institute of Technology at the University of Washington Tacoma.[6][7]

References

  1. ↑ "Efficient pairing computation on supersingular Abelian varieties". Portal.acm.org. doi:10.1007/s10623-006-9033-6. Retrieved 2012-08-03.
  2. ↑ Barreto, Paulo S. L. M.; Naehrig, Michael (2006). "Pairing-Friendly Elliptic Curves of Prime Order". Lecture Notes in Computer Science. Lecture Notes in Computer Science. 3897: 319–331. ISBN 978-3-540-33108-7. doi:10.1007/11693383_22. Retrieved 2012-11-24.
  3. ↑ "SAC 2009 Accepted Submissions | Selected Areas in Cryptography". Sac.ucalgary.ca. Retrieved 2012-08-03.
  4. ↑ Nancy Imelda Schafer, ISI (2005-12-01). "New Hot Paper Comment by Paulo S.L.M. Barreto". Esi-topics.com. Retrieved 2012-08-03.
  5. ↑ Nancy Imelda Schafer, ISI. "Fast Breaking Papers - December 2005". Esi-topics.com. Retrieved 2012-08-03.
  6. ↑ "pbarreto | Faculty & Staff Directory". directory.tacoma.uw.edu. Retrieved 2017-01-10.
  7. ↑ "pbarreto | Center for Data Science". cwds.uw.edu. Retrieved 2017-01-10.
This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.