RSA Award for Excellence in Mathematics

Cryptography

The RSA Conference (RSAC) Award for Excellence in Mathematics is an annual award. It is announced at the annual RSA Conference in recognition of innovations and contributions in the field of cryptography. An award committee of experts, which is associated with the Cryptographer's Track committee at the RSA Conference (CT-RSA), nominates to the award persons who are pioneers in their field, and whose work has had applied or theoretical lasting value; the award is typically given for the lifetime achievements throughout the nominee's entire career. Nominees are often affiliated with universities or involved with research and development in the information technology industry. The award is cosponsored by the International Association for Cryptologic Research. While the field of modern cryptography started to be an active research area in the 1970s, it has already contributed heavily to Information technology and has served as a critical component in advancing the world of computing: the Internet, Cellular networks, and Cloud computing, Information privacy, Privacy engineering, Anonymity, Storage security, and Information security, to mention just a few sectors and areas. Research in Cryptography as a scientific field involves the disciplines of Mathematics, Computer Science, and Engineering. The award, which started in 1998, is one of the few recognitions fully dedicated to acknowledging experts who have advanced the field of cryptography and its related areas (another such recognition is achieving the rank of an IACR Fellow). The first recipient of the award in 1998 was Shafi Goldwasser. Also, many of the award winners have gotten other recognitions, such as other prestigious awards, and the rank of fellow in various professional societies, etc. Research in Cryptography is broad and is dedicated to numerous areas. In fact, the award has, over the years, emphasized the methodological contributions to the field which involve mathematical research in various ways, and has recognized achievements in many of the following crucial areas of research: * Some areas are in the general Computational number theory and Computational algebra fields, or in the fields of Information theory and Computational complexity theory, where proper mathematical structures are constructed or investigated as underlying mathematics to be employed in the field of cryptography; * Some areas are theoretical in nature, where new notions for Cryptographic primitives are defined and their security is carefully formalized as foundations of the field, some work is influenced by Quantum computing as well; * Some areas are dedicated to designing new or improved primitives from concrete or abstract mathematical mechanisms for Symmetric-key cryptography, Public-key cryptography, and Cryptographic protocols (such as Zero-knowledge proofs, Secure multi-party computations, or Threshold cryptosystems); * Some other areas are dedicated to Cryptanalysis: the breaking of cryptographic systems and mechanisms; * Yet some other areas are dedicated to the actual practice of cryptography and its efficient cryptographic hardware and software implementations, to developing and deploying new actual protocols (such as the Transport Layer Security and IPsec) to be used by information technology applications and systems. Also included are research areas where principles and basic methods are developed for achieving security and privacy in computing and communication systems. To further read on various aspects of cryptography, from history to areas of modern research, see Books on cryptography. It is worth noting that in addition to the Award for Excellence in Mathematics which recognizes lifetime achievement in the specific area of Cryptographic research, the RSA conference has also presented a separate lifetime achievement awards in the more general field of information security. Past recipients of this award from the field of cryptography include: * Taher Elgamal (2009), * Whitfield Diffie (2010), * Ronald Rivest, Adi Shamir, and Leonard Adleman (2011), and * Martin Hellman (2012) (Wikipedia).

Breakthrough Prize in Mathematics 2014

Breakthrough Prize in Mathematics 2014 recipients talking about mathematics

From playlist Actualités

SIAM Prizes and Awards Program

SIAM’s extensive prize and award program highlights outstanding applied mathematicians and computational scientists. Prize winners are individuals and teams, students, young researchers, accomplished lecturers and distinguished scientists whose work showcases achievements and excellence in

From playlist SIAM Conference Videos

Carl Friedrich Gauss Prize 2018 David L. Donoho

The Gauss Prize is to honor scientists whose mathematical research has had an impact outside mathematics – either in technology, in business, or simply in people's everyday lives. The prize is awarded jointly by the Deutsche Mathematiker-Vereinigung (German Mathematical Union) and the Inte

From playlist IMU Awards

Fellow Short Talks: Professor David Firth, University of Warwick

Bio Professor of Statistics at Warwick and Director of WDSI. Previously Professor of Social Statistics at Oxford. ESRC Professorial Fellow (2003-2006). Fellow of the British Academy (2008). RSS Guy Medals in Bronze (1998) and Silver (2012). John M Chambers Statistical Software Award, 2007

From playlist Short Talks

RSA Conference 2010 USA: The Cryptographers Panel 6/6

Clip 6/6 MODERATOR: Ari Juels, Chief Scientist and Director, RSA Laboratories PANELISTS: Whitfield Diffie, Martin Hellman, Ronald Rivest, Adi Shamir, Brian Snow Join the founders of the field for an engaging discussion about the latest advances in cryptography, research areas to wa

From playlist RSA Conference USA 2010

Leelavati Prize 2018 Ali Nesin

The Leelavati Prize recognizes outstanding contributions for increasing public awareness of mathematics as an intellectual discipline and the crucial role it plays in diverse human endeavors. The prize is sponsored by Infosys.

From playlist IMU Awards

2.4.1 RSA Public Key Encryption: Video

MIT 6.042J Mathematics for Computer Science, Spring 2015 View the complete course: http://ocw.mit.edu/6-042JS15 Instructor: Albert R. Meyer License: Creative Commons BY-NC-SA More information at http://ocw.mit.edu/terms More courses at http://ocw.mit.edu

From playlist MIT 6.042J Mathematics for Computer Science, Spring 2015

RSA Conference 2010 USA: The Cryptographers Panel 1/6

Clip 1/6 MODERATOR: Ari Juels, Chief Scientist and Director, RSA Laboratories PANELISTS: Whitfield Diffie, Martin Hellman, Ronald Rivest, Adi Shamir, Brian Snow Join the founders of the field for an engaging discussion about the latest advances in cryptography, research areas to wa

From playlist RSA Conference USA 2010

Cédric Villani on the 7 Ingredients of Creativity

What does it take to come up with a new idea? In this beautifully illustrated RSA Short, award-winning mathematician Cédric Villani reveals the seven key ingredients that come together to create breakthrough moments in human knowledge and innovation. Watch the full talk (RSA Replay): https

From playlist Creativity

Correctness Of RSA - Applied Cryptography

This video is part of an online course, Applied Cryptography. Check out the course here: https://www.udacity.com/course/cs387.

From playlist Applied Cryptography

INTERVIEW AT CIRM: PETER SARNAK

Peter Sarnak is a South African-born mathematician with dual South-African and American nationalities. He has been Eugene Higgins Professor of Mathematics at Princeton University since 2002, succeeding Andrew Wiles, and is an editor of the Annals of Mathematics. He is known for his work in

From playlist Jean-Morlet Chair's guests - Interviews

(Audio only) Panel: Don't Tell Me Software Security - moderated by Mark Miller

Panel: Wait Wait... Don't Tell Me Software Security - Mark Miller, Josh Corman, Chris Eng, Space Rogue Test your wits and current AppSec news knowledge against our panel of distinguished guests Joshua Corman, Chris Eng, Space Rogue and Gal Shpantzer. "Wait Wait... Don't Pwn Me!" is patter

From playlist AppSecUSA 2013

Imitation Games - Avi Wigderson

From playlist Mathematics

Lec 1 | MIT 6.042J Mathematics for Computer Science, Fall 2010

Lecture 1: Introduction and Proofs Instructor: Tom Leighton View the complete course: http://ocw.mit.edu/6-042JF10 License: Creative Commons BY-NC-SA More information at http://ocw.mit.edu/terms More courses at http://ocw.mit.edu

From playlist MIT 6.042J Mathematics for Computer Science, Fall 2010

🔥Digital Marketing Masterclass: How to Test and Control Responsive Search Ads | 2023 | Simplilearn

🔥Enroll on Free Digital Marketing Course & Get Your Completion Certificate: https://www.simplilearn.com/learn-digital-marketing-fundamentals-basics-skillup?utm_campaign=DigitalMarketingWebinar11Oct22&utm_medium=ShortsDescription&utm_source=youtube About the Webinar: Keep your digi

From playlist Simplilearn Live

28C3: The future of cryptology: which 3 letters algorithm(s) could be our Titanic? (en)

For more information visit: http://bit.ly/28C3_information To download the video visit: http://bit.ly/28C3_videos Playlist 28C3: http://bit.ly/28C3_playlist Speakers: Jean-Jacques Quisquater | Renaud Devaliere RMS Olympic, RMS Titanic, HMHS Britannic vs Discrete Logarithm, Integer

From playlist 28C3: Behind Enemy Lines

Asymmetric Key Cryptography

This video is about asymmetric key cryptography; an extremely important aspect of computer science and cyber security. It covers the fundamental principles of asymmetric key cryptography, including the use of a public encryption key and a private decryption key. It explains that this co

From playlist Cryptography

Design for reproducibility - Lorena Barba (George Washington University)

Lorena Barba explores how to build the ability to support reproducible research into the design of tools like Jupyter and explains how better insights on designing for reproducibility might help extend this design to our research workflows, with the machine as our active collaborator. Sub

From playlist JupyterCon

29C3: FactHacks (EN)

Speakers: djb | Nadia Heninger | Tanja Lange RSA factorization in the real world RSA is the dominant public-key cryptosystem on the Internet. This talk will explain the state of the art in techniques for the attacker to figure out your secret RSA keys. A typical 1024-bit RSA public key

From playlist 29C3: Not my department

Summary - Applied Cryptography

This video is part of an online course, Applied Cryptography. Check out the course here: https://www.udacity.com/course/cs387.

From playlist Applied Cryptography

RSA Award for Excellence in Mathematics

Related pages