International Association for Cryptologic Research

International Association
for Cryptologic Research

IACR Local Search

Possible queries include homomorphic author:david.
Found 30000 results
Completion of Computation of Improved Upper Bound on the Maximum Average Linear Hull Probabilty for Rijndael
Eprint
https://eprint.iacr.org/2004/074
Liam Keliher Henk Meijer Stafford Tavares
This report presents the results from the completed computation of an algorithm introduced by the authors in [11] for evaluating the provable security of the AES (Rijndael) against linear cryptanalysis. This algorithm, later...
received 4 Mar 2004
Dual of New Method for Upper Bounding the Maximum Average Linear Hull Probability for SPNs
Eprint
https://eprint.iacr.org/2001/033
Liam Keliher Henk Meijer Stafford Tavares
In [3], we present a new algorithm for computing an upper bound on the maximum average linear hull probability (MALHP) for the SPN symmetric cipher structure, a value required to make claims about provable security against...
last revised 9 May 2001
EC2001\Templates\main.dwt
https://iacr.org/conferences/eurocrypt2001/accepted.html
Eurocrypt 2001 6-10 May 2001 Innsbruck (Tyrol), Austria Eurocrypt 2001 Home Attendance (ppt, 327k) Support/Student Stipends Program ( Print Version ) Program Committee Accepted Papers Accommodation Conference Venue Social...
New Reports in the Cryptology ePrint Archive
https://iacr.org/newsletter/v18n2/eprint.html
New Reports in the Cryptology ePrint Archive 2001/044 Optimistic Asynchronous Multi-Party Contract Signing with Reduced Number of Rounds Birgit Baum-Waidner 2001/043 Cryptanalysis of the Vesta-2M Stream Cipher Marina Pudovkina...
New Method for Upper Bounding the Maximum Average Linear Hull Probability for SPNs
Iacrpub
https://iacr.org/cryptodb/data/paper.php?pubkey=2465
Liam Keliher Henk Meijer Stafford E. Tavares
Eurocrypt 2001
IACR Eurocrypt 2001
https://iacr.org/archive/eurocrypt2001/eurocrypt-toc2.html
Elliptic Curves A Memory Efficient Version of Satoh's Algorithm , page 1 by Frederik Vercauteren (K. U. Leuven, Belgium) Bart Preneel (K. U. Leuven, Belgium) Joos Vandewalle (K. U. Leuven, Belgium) Finding Secure Curves with...
New Reports in the Cryptology ePrint Archive
https://iacr.org/newsletter/v21n1/eprint.html
New Reports in the Cryptology ePrint Archive (The list contains reports posted since the last newsletter issue appeared.) 2004/074 ( PS PS.GZ PDF ) Completion of Computation of Improved Upper Bound on the Maximum Average...
Eurocrypt 2001
https://iacr.org/archive/eurocrypt2001/eurocrypt-2001.html
EUROCRYPT 2001 PREFACE by Birgit Pfitzman May 6 -- 10, 2001, Innsbruck (Tyrol), Austria Sponsored by the International Association for Cryptologic Research ( IACR ) in cooperation with the Austrian Computer Society (OCG)...
Security Assessment of Hierocrypt and Rijndael against the Differential and Linear Cryptanalysis (Extended Abstract)
Eprint
https://eprint.iacr.org/2001/070
Kenji Ohkuma Hideo Shimizu Fumihiko Sano Shinichi Kawamura
The authors analyze the security of Hierocrypt-3(128-bit) and Hierocrypt-L1(64-bit) designed on the nested SPN(NSPN) structure against the differential and linear cryptanalysis, and found that they are sufficiently secure,...
received 16 Aug 2001
SAC '98 Preliminary program
https://iacr.org/events/pages/sac98.html
SAC '98 Selected Areas in Cryptography Preliminary Program August 17 and 18, 1998 Walter Light Hall Queen's University Kingston, Ontario, Canada Webpage: http://adonis.ee.queensu.ca:8000/sac98/ Sunday, August 16, 1998...
EUROCRYPT 2001: Preliminary program
https://iacr.org/conferences/eurocrypt2001/program_print.html
Preliminary Program - Eurocrypt 2001 May 6-10, 2001 Innsbruck, Tyrol, Austria Proceedings to appear as LNCS 2045, Springer-Verlag Sunday, May 6, 2001 Sun 16:00-18:00: Conference Registration Sun 18:00: Welcome Cocktails (at...
EC2001\Templates\main.dwt
https://iacr.org/conferences/eurocrypt2001/program.html
Eurocrypt 2001 6-10 May 2001 Innsbruck (Tyrol), Austria Eurocrypt 2001 Home Attendance (ppt, 327k) Support/Student Stipends Program ( Print Version ) Program Committee Accepted Papers Accommodation Conference Venue Social...
Exact Maximum Expected Differential and Linear Probability for 2-Round Advanced Encryption Standard (AES)
Eprint
https://eprint.iacr.org/2005/321
Liam Keliher Jiayuan Sui
Provable security of a block cipher against differential~/ linear cryptanalysis is based on the \emph{maximum expected differential~/ linear probability} (MEDP~/ MELP) over $T \geq 2$ core rounds. Over the past few years,...
last revised 15 Sep 2005
Improved Linear (hull) Cryptanalysis of Round-reduced Versions of KATAN
Eprint
https://eprint.iacr.org/2015/964
Danping Shi Lei Hu Siwei Sun Ling Song
KATAN is a family of block ciphers published at CHES 2009. Based on the Mixed-integer linear programming (MILP) technique, we propose the first third-party linear cryptanalysis on KATAN. Furthermore, we evaluate the security...
last revised 20 Nov 2015
Improved Linear (hull) Cryptanalysis of Round-reduced Versions of SIMON
Eprint
https://eprint.iacr.org/2014/973
Danping Shi Lei Hu Siwei Sun Ling Song Kexin Qiao Xiaoshuang Ma
SIMON is a family of lightweight block ciphers designed by the U.S. National Security Agency (NSA) that has attracted much attention since its publication in 2013. In this paper, we thoroughly investigate the properties of...
last revised 5 Jan 2015
FSE 2003: Program page
https://iacr.org/workshops/fse2003.dir/fse03/Program.html
Preliminary program - FSE 2003 Monday: 08.30 - 09.15 Registration 09.15 - 09.30 Welcome opening 09.30 - 10.45 Block cipher cryptanalysis I Raddum, "Cryptanalysis of IDEA-X/2" Biham, Dunkelman, Keller, "Differential-Linear...
Effect of the Dependent Paths in Linear Hull
Eprint
https://eprint.iacr.org/2010/325
Zhenli Dai Meiqin Wang Yue Sun
Linear Hull is a phenomenon that there are a lot of linear paths with the same data mask but different key masks for a block cipher. In 1994, K. Nyberg presented the effect on the key-recovery attack such as Algorithm 2 with...
last revised 7 Nov 2010
The Security of SIMON-like Ciphers Against Linear Cryptanalysis
Eprint
https://eprint.iacr.org/2017/576
Zhengbin Liu Yongqiang Li Mingsheng Wang
In the present paper, we analyze the security of SIMON-like ciphers against linear cryptanalysis. First, an upper bound is derived on the squared correlation of SIMON-like round function. It is shown that the upper bound on...
received 12 Jun 2017
Improved upper bound on root number of linearized polynomials and its application to nonlinearity estimation of Boolean functions
Eprint
https://eprint.iacr.org/2018/1159
Sihem Mesnager Kwang Ho Kim Myong Song Jo
To determine the dimension of null space of any given linearized polynomial is one of vital problems in finite field theory, with concern to design of modern symmetric cryptosystems. But, the known general theory for this task...
last revised 3 Dec 2018
Improved Linear Cryptanalysis of Reduced-round SIMON
Eprint
https://eprint.iacr.org/2014/681
Mohamed Ahmed Abdelraheem Javad Alizadeh Hoda A. Alkhzaimi Mohammad Reza Aref Nasour Bagheri Praveen Gauravaram Martin M. Lauridsen
SIMON is a family of ten lightweight block ciphers published by Beaulieu et al.\ from U.S. National Security Agency (NSA). In this paper we investigate the security of SIMON against different variants of linear cryptanalysis...
last revised 2 Dec 2014
Next ►