International Association for Cryptologic Research

International Association
for Cryptologic Research

IACR Local Search

Possible queries include homomorphic author:david.
Found 20000 results
Generalization of Higher Order SAC to Vector Output Boolean Functions
Iacrpub
https://iacr.org/cryptodb/data/paper.php?pubkey=295
Kaoru Kurosawa Takashi Satoh
Asiacrypt 1996
Design of SAC/PC(l) of Order k Boolean Functions and Three Other Cryptographic Criteria
Iacrpub
https://iacr.org/cryptodb/data/paper.php?pubkey=2539
Kaoru Kurosawa Takashi Satoh
Eurocrypt 1997
Construction of Perfect Nonlinear and Maximally Nonlinear Multi-Output Boolean Functions Satisfying Higher Order Strict Avalanche Criteria
Eprint
https://eprint.iacr.org/2003/198
Kishan Chand Gupta Palash Sarkar
We consider the problem of constructing perfect nonlinear multi-output Boolean functions satisfying higher order strict avalanche criteria (SAC). Our first construction is an infinite family of 2-ouput perfect nonlinear...
last revised 25 Sep 2003
On Cryptographically Secure Vectorial Boolean Functions
Iacrpub
https://iacr.org/cryptodb/data/paper.php?pubkey=459
Takashi Satoh Tetsu Iwata Kaoru Kurosawa
Asiacrypt 1999
Updated Submission Categories (date: Jan 13, 1997)
https://iacr.org/conferences/ec97/program.html
EUROCRYPT '97 May 11-15, 1997, Konstanz, Germany PRELIMINARY PROGRAM - Subject to Change - Sunday May 11, 1997 16:00-20:00 Registration 19:00-20:30 Reception Monday May 12, 1997 8:00 Registration 9:00 Introductory Remarks...
On an Improved Correlation Analysis of Stream Ciphers Using Muti-Output Boolean Functions and the Related Generalized Notion of Nonlinearity
Eprint
https://eprint.iacr.org/2007/207
Claude Carlet Khoongming Khoo Chu-Wee Lim Chuan-Wen Loe
We investigate the security of $n$-bit to $m$-bit vectorial Boolean functions in stream ciphers. Such stream ciphers have higher throughput than those using single-bit output Boolean functions. However, as shown by Zhang and...
last revised 20 Apr 2008
Updated Submission Categories (date: Jan 13, 1997)
https://iacr.org/conferences/ec97/programf.html
EUROCRYPT '97 May 11-15, 1997, Konstanz, Germany FINAL PROGRAM Sunday May 11, 1997 16:00-20:00 Registration 19:00-20:30 Reception Monday May 12, 1997 08:00 Registration 09:00 Introductory Remarks Session 1: Block Ciphers...
Probabilistic Higher Order Differential Attack and Higher Order Bent Functions
Iacrpub
https://iacr.org/cryptodb/data/paper.php?pubkey=199
Tetsu Iwata Kaoru Kurosawa
Asiacrypt 1999
Almost Security of Cryptographic Boolean Functions
Eprint
https://eprint.iacr.org/2003/075
Kaoru Kurosawa
$PC(l)$ of order $k$ is one of the most general cryptographic criteria of secure Boolean functions. In this paper, we introduce its $\epsilon$-almost version. The new definition requires {\it only} that $f(X)+f(X+\Delta)$ is...
received 23 Apr 2003
Privacy for Multi-Party Protocols
Iacrpub
https://iacr.org/cryptodb/data/paper.php?pubkey=460
Takashi Satoh Kaoru Kurosawa Shigeo Tsujii
Auscrypt 1992
On the Multiplicative Complexity of Boolean Functions and Bitsliced Higher-Order Masking
Iacrpub
https://iacr.org/cryptodb/data/paper.php?pubkey=27839
Dahmun Goudarzi Matthieu Rivain
Ches 2016
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...
On the Multiplicative Complexity of Boolean Functions and Bitsliced Higher-Order Masking
Eprint
https://eprint.iacr.org/2016/557
Dahmun Goudarzi Matthieu Rivain
Higher-order masking is a widely used countermeasure to make software implementations of blockciphers achieve high security levels against side-channel attacks. Unfortunately, it often comes with a strong impact in terms of...
last revised 8 Feb 2017
Distinguishing Properties of Higher Order Derivatives of Boolean Functions
Eprint
https://eprint.iacr.org/2010/417
Ming Duan Xuejia Lai Mohan Yang Xiaorui Sun Bo Zhu
Higher order differential cryptanalysis is based on the property of higher order derivatives of Boolean functions that the degree of a Boolean function can be reduced by at least 1 by taking a derivative on the function at any...
received 26 Jul 2010
Boolean Functions Satisfying a Higher Order Strict Avalanche Criterion
Iacrpub
https://iacr.org/cryptodb/data/paper.php?pubkey=2238
Thomas W. Cusick
Eurocrypt 1993
Boolean Functions Satisfying Higher Order Propagation Criteria
Iacrpub
https://iacr.org/cryptodb/data/paper.php?pubkey=2733
Bart Preneel René Govaerts Joos Vandewalle
Eurocrypt 1991
Improving the lower bound on the higher order nonlinearity of Boolean functions with prescribed algebraic immunity
Eprint
https://eprint.iacr.org/2007/117
Sihem Mesnager
The recent algebraic attacks have received a lot of attention in cryptographic literature. The algebraic immunity of a Boolean function quantifies its resistance to the standard algebraic attacks of the pseudo-random...
last revised 3 Aug 2007
Construction of DES-like S-boxes Based on Boolean Functions Satisfyieng the SAC
Iacrpub
https://iacr.org/cryptodb/data/paper.php?pubkey=78
Kwangjo Kim
Asiacrypt 1991
A method for obtaining lower bounds on the higher order nonlinearity of Boolean function
Eprint
https://eprint.iacr.org/2013/332
Mikhail S. Lobanov
Obtainment of exact value or high lower bound on the $r$-th order nonlinearity of Boolean function is a very complicated problem (especial if $r > 1$). In a number of papers lower bounds on the $r$-th order nonlinearity of...
received 29 May 2013
How to Estimate the Success Rate of Higher-Order Side-Channel Attacks
Eprint
https://eprint.iacr.org/2014/673
Victor Lomné Emmanuel Prouff Matthieu Rivain Thomas Roche Adrian Thillard
The resistance of a cryptographic implementation with regards to side-channel analysis is often quantified by measuring the success rate of a given attack. This approach cannot always be followed in practice, especially when...
last revised 11 Sep 2014
Next ►