University of Cambridge > Talks.cam > Microsoft Research Cambridge, public talks > Using SAT Solvers for Cryptographic Problems

  Browse A-Z

Log in

University Account External (via Google)

🔐 Log In

Information on

Subscribing to talksdetails Finding a talkdetails Adding a talkdetails Disseminating talksdetails Help and Documentationdetails

ℹī¸ Information

Using SAT Solvers for Cryptographic Problems

Download to your calendar using vCal

If you have a question about this talk, please contact Microsoft Research Cambridge Talks Admins .

This talk has been canceled/deleted

As SAT solvers have become more advanced, their use-cases have expanded. One such area where SAT solves now competitively perform is cryptography. In this talk we investigate why and how SAT solvers are used in cryptography, and what advantages they bring relative to other solving methods such as brute force or Grobner basis algorithms. We present several specific use-cases and highlight some future possibilities.

This talk is part of the Microsoft Research Cambridge, public talks series.

This talk is included in these lists:

  • This talk is not included in any other list

Note that ex-directory lists are not shown.

Other lists

Maxwell Lecture Theatre, Faculty of PPSIS, Free School Lane Online: "please register here":https://protect-eu.mimecast.com/s/EEd9CpklwHlyO8WCDq6LA?domain=eventbrite.com Behavioural and Clincial Neuroscience Seminars

Other talks

Organiser Welcome The Inaccessible Game When is a mummy not a mummy? Andean bodies and the problem of scientific classification in Britain From Plate to Brain: Global Diet, Cognitive Function and Neuroimaging in Diverse Populations Cultural evolution creates language-like structure: from humans to humpback whales and beyond Title TBC
 

Š 2006-2025 Talks.cam, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity