![[Search]](/static/images/search.gif){kind=small}
![[A-Z Index]](/static/images/az.gif){kind=small}
![[Contact]](/static/images/contact.gif){kind=small}
![[University of Cambridge]](/static/images/identifier2.gif){kind=small}
![[Talks.cam]](/static/images/talkslogosmall.gif)
Eli Biham, Computer Science Department, Technion - Israel Institute of Technology
Wednesday 04 October 2017, 14:00-15:00
Conditional Linear Cryptanalysis
- đ¤ Speaker: Eli Biham, Computer Science Department, Technion - Israel Institute of Technology
- đ Date & Time: Wednesday 04 October 2017, 14:00 - 15:00
- đ Venue: LT2, Computer Laboratory, William Gates Building
Questions? Contact
Alexander Vetterl
Abstract
In this talk we will discuss some new techniques in linear cryptanalysis, that can improve the bias of linear approximations. These techniques can also create some new kinds of linear approximations, that were hard to find previously. When used in attacks, these techniques can reduce the complexity of some known attacks. In particular, they improve over Matsui’s attack on DES . This is a joint work with Stav Perle.
Series This talk is part of the Computer Laboratory Security Seminar series.
Included in Lists
- All Talks (aka the CURE list)
- bld31
- Cambridge talks
- Computer Laboratory Security Seminar
- Department of Computer Science and Technology talks and seminars
- Interested Talks
- LT2, Computer Laboratory, William Gates Building
- School of Technology
- Security-related talks
- Trust & Technology Initiative - interesting events
- yk449
Note: Ex-directory lists are not shown.