World Library  
Flag as Inappropriate
Email this Article

Paulo S. L. M. Barreto


Paulo S. L. M. Barreto

Paulo S. L. M. Barreto
Born (1965-11-19) 19 November 1965
Salvador, Bahia, Brazil
Residence São Paulo, Brazil
Institutions Escola Politécnica, University of São Paulo
Alma mater University of São Paulo
Known for Cryptographic hash functions, Pairing-based cryptography, Post-quantum cryptography

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.[6] Currently he is associate professor at the Department of Computer and Digital Systems Engineering, Escola Politécnica, University of São Paulo.


  1. ^ "Efficient pairing computation on supersingular Abelian varieties".  
  2. ^ "Pairing-Friendly Elliptic Curves of Prime Order - Springer". Retrieved 2012-11-24. 
  3. ^ "SAC 2009 Accepted Submissions | Selected Areas in Cryptography". Retrieved 2012-08-03. 
  4. ^ Nancy Imelda Schafer, ISI (2005-12-01). "New Hot Paper Comment by Paulo S.L.M. Barreto". Retrieved 2012-08-03. 
  5. ^ Nancy Imelda Schafer, ISI. "Fast Breaking Papers - December 2005". Retrieved 2012-08-03. 
  6. ^ [1]

External links

  • Home page
  • The Pairing-Based Crypto Lounge
  • The Hash Function Lounge
  • The Whirlpool Hash Function
  • Thomson ISI Essential Science Indicators
This article was sourced from Creative Commons Attribution-ShareAlike License; additional terms may apply. World Heritage Encyclopedia content is assembled from numerous content providers, Open Access Publishing, and in compliance with The Fair Access to Science and Technology Research Act (FASTR), Wikimedia Foundation, Inc., Public Library of Science, The Encyclopedia of Life, Open Book Publishers (OBP), PubMed, U.S. National Library of Medicine, National Center for Biotechnology Information, U.S. National Library of Medicine, National Institutes of Health (NIH), U.S. Department of Health & Human Services, and, which sources content from all federal, state, local, tribal, and territorial government publication portals (.gov, .mil, .edu). Funding for and content contributors is made possible from the U.S. Congress, E-Government Act of 2002.
Crowd sourced content that is contributed to World Heritage Encyclopedia is peer reviewed and edited by our editorial staff to ensure quality scholarly research articles.
By using this site, you agree to the Terms of Use and Privacy Policy. World Heritage Encyclopedia™ is a registered trademark of the World Public Library Association, a non-profit organization.

Copyright © World Library Foundation. All rights reserved. eBooks from Project Gutenberg are sponsored by the World Library Foundation,
a 501c(4) Member's Support Non-Profit Organization, and is NOT affiliated with any governmental agency or department.