Imperial College London > Talks@ee.imperial > COMMSP Seminar > London Lattice Coding and Crypto Meeting
Log inImperial users Other users No account?Information onFinding a talk Adding a talk Syndicating talks Who we are Everything else |
London Lattice Coding and Crypto MeetingAdd to your list(s) Download to your calendar using vCal
If you have a question about this talk, please contact Cong Ling. Lattice-based approaches are emerging as a common theme in modern cryptography and coding theory. In communications, they are useful mathematical tools to construct powerful error-correction codes achieving the capacity of wireless channels. In cryptography, they are used to building lattice-based schemes with provable security, better asymptotic efficiency, resilience against quantum attacks and new functionalities such as fully homomorphic encryption. This meeting — on Wednesday 23 January 2019 — is aimed at connecting the two communities with a common interest in lattices. It will consist of several talks on related topics, with a format aimed at encouraging interaction. Programme 10:30 – 12:00 | Fernando Virdia: Implementing RLWE -based Schemes Using an RSA Co-Processor 13:00 – 14:30 | Patrick Solé: Good Algebraic Codes Exist 15:00 – 16:30 | Yang Yu: Learning Strikes Again: The Case of the DRS Signature Scheme 16:45 – 18:15 | Evgeniy Zorin: Lattice-based coding schemes and Diophantine approximations 18:30 – | Workshop Dinner This talk is part of the COMMSP Seminar series. This talk is included in these lists:Note that ex-directory lists are not shown. |
Other listsComplexity & Networks Group HiPEDS Seminar Series casOther talksSpeeding up HLS: Rational II modulo scheduling Smart Energy Solutions for Renewable Energy Systems |