A usability study of OpenSSL and a factorization method for moduli with two prime factors are discussed. Topic 1: Why Johnny the Developer Can’t Work with Public Key Certificates: An Experimental Study of OpenSSL Usability Authors: Martin Ukrop; Vashek Matyas Topic 2: Improved Factorization of N=p^r q^s Authors: Jean-Sebastien Coron; Rina Zeitoun
Speakers: Mehdi Tibouchi, Martin Ukrop
After doctoral studies at École normale supérieure (Paris, France) under the supervision of David Naccache and Jean-Sébastien Coron, Mehdi Tibouchi obtained a Ph.D. in computer science from University Paris VII and the University of Luxembourg in 2011. He then joined NTT Corporation (Tokyo, Japan), where he has been carrying out research in cryptology ever since. His research interests cover various mathematical aspects of public-key cryptography and cryptanalysis.
Martin Ukrop is a Usable Security Researcher and Ph.D. Candidate at the Centre for Research on Cryptography and Security at Masaryk University, Czech Republic, supported by Red Hat Czech. Ukrop aims to make security usable for IT professionals that lack a specialized training in computer security. He focuses on cryptographic interfaces (both programmable and command-line) of developer tools and software libraries. Previously, he was interested in randomness testing and helped develop the EACirc project (an automatic problem solver based on software circuits and genetic programming). Ukrop is passionate about teaching and experiential learning, actively organizing educational events in the community. He is ceaselessly fascinated by the world.
Detailed Presentation:
Comments