Since 2011, Christian is associate professor at the Technical University of Denmark, DTU. Previously, he was a postdoctorial research associate at ENS Ulm, and had similar roles at KU Leuven and TU Graz, he was also a visiting researcher at MSR Redmond. From 2008-2013 he was coordinating the hash function working group within the ECRYPT II Network of Excellence. His research is centered around the design, analysis, and implementation of the fundamental building blocks that form the basis of current and future IT systems: ciphers, hash functions, authentication codes. Applications range from tiny RFID tags to cloud computing services.

Obtained his doctorate in Mathematics at the University of Cincinnati in 2011. He then worked as a postdoctoral fellow for two years at the Center for Advanced Security Research Darmstadt. Since 2013 he has been a Mathematics professor at the National University of Colombia, Medellín. His research focuses on algebraic computation and applications to cryptography. He has several papers on Gröbner basis computation, algebraic cryptanalysis, lattice based cryptography and long term security.

Bejamin is a research scientist (chargé de recherché) at INRIA, a French public research institute for computing and applied math, and also an adjunct assistant professor (chargé d'enseignement) in the computer science department at the École polytechnique. His research is in algorithmic arithmetic geometry and number theory, with a view towards applications in asymmetric cryptography. He studied algorithmic number theory in Sydney with David Kohel, worked as a postdoc at Royal Holloway with Steven Galbraith. Smith has been at LIX, and with INRIA, since November 2007.

Civil Engineer graduated from Universidad Nacional de Colombia, Medellín, he did his master in mathematics from the same university. In 2009 Baena obtain his PhD from University of Cincinnati entitled Fast Signature Schemes over Odd Characteristic. His main research areas are lattices based cryptography and multivariated criptografy. He is Mathematics professor at the National University of Colombia, Medellín.

Dr. Julio López is an associate professor at the Institute of Computing of the University of Campinas. He is also the Computer Science Graduate Program Coordinator. His main research interest is cryptographic engineering with focuses on software implementation, elliptic curve cryptography, authentication methods and applications of cryptography. Current research projects include cryptographic algorithms for Internet of Things, secure and energy efficient implementation of public-key algorithms for modern processors and authentication techniques based on visual cryptography. He has contributed with several optimization techniques for speeding up cryptographic algorithms. He holds a scholarship as Productive Researcher from CNPq (The Brazilian National Research Agency), since 2009. He received a BS degree in Mathematics from The University of Valle, a Master of Art degree from the University of Texas at Austin and his Doctor degree in Computer Science from the University of Campinas.

Luis studied computer systems engineering, at Instituto de Estudios Superiores , Tamaulipas in Mexico, he also worked in the IT department for 8 years. He got his PhD in 2011 on pairings implementation in the Dublin City University at the School of Computing in Ireland. He did two postdoc positions on pairing implementation at CINVESTAV-IPN, and CINVESTAV-LTI. Currently, since 2014 he is a CONACyT Research Fellow at CIMAT-ZAC in Mexico, he is working on cryptography and security. He is associated in the establishment of the CERT-ZAC, and is collaborating on a book about pairings. At CIMAT-ZAC he is hosting a Seminar on Number Theory, and Cryptography, where is looking forward to post-quatum cryptography.

Pooya is a postdoc at the crypto team, École Normale Supérieure (ENS) Paris. Previously he was a lecturer at School of Electronics, Electrical Engineering and Computer Science, Queen’s University Belfast, Postdoctoral Research Associate at Darmstadt University of Technology, Germany and Royal Holloway, University of London, UK. Farshim completed his PhD at the Department of Computer Science, University of Bristol, Certificate of Advanced Study in Mathematics (Part III), Queens’ College, Cambridge and got his B.A. Mathematics at Queens’ College, Cambridge. His main research interest in the rigorous development of cryptographic primitives, security models, and relationship between primitives.

Mathematician from Universidad de los Andes, Bogota, Colombia, graduated in 2006. Winner of a grant from the European Community in the Erasmus Mundus masters program: ALGANT in algebra, geometry and number theory at University of Bordeaux I, France (2007) and Università degli Studi di Padova, Italy (2008). In November 2011 she obtained her PhD in applied mathematics, in the area of post-quantum cryptography from Danmarks Tekniske Universitet (DTU). In 2012 she was a postdoctoral researcher at the laboratory GREYC Université de Caen Normandie, France in the AMMAC team. In 2013 she was a postdoctoral researcher at the department of mathematics at Universidad de los Andes in Bogota. Since January 2014 she is Assistant Professor in the Department of Mathematics at Universidad del Rosario, Bogotá, Colombia. Her research areas of interest are cryptography, coding theory and its applications.