The Experts below are selected from a list of 324 Experts worldwide ranked by ideXlab platform
Enes Pasalic - One of the best experts on this subject based on the ideXlab platform.
-
efficient implementation of generalized maiorana McFarland class of cryptographic functions
Journal of Cryptographic Engineering, 2017Co-Authors: Enes Pasalic, Weiguo Zhang, Anupam ChattopadhyayAbstract:Recently, a class of cryptographic Boolean functions called generalized Maiorana–McFarland (GMM) functions was proposed in Zhang and Pasalic (IEEE Trans Inf Theory 60(10):6681–6695, 2014). In particular, it was demonstrated that certain subclasses within the GMM class satisfy all the relevant cryptographic criteria including a good resistance to (fast) algebraic cryptanalysis. However, the issue of efficient hardware implementation, which is essentially of crucial importance when such a function is used as a filtering function in certain stream cipher encryption schemes, has not been addressed in Zhang and Pasalic (2014). In this article, we analyze the complexity of hardware implementation of these subclasses and provide some exact estimates in terms of the number of elementary circuits needed. It turns out that these classes of cryptographically strong functions are also characterized with a very low hardware implementation cost, making these functions attractive candidates for the use in certain stream cipher schemes.
-
Efficient implementation of generalized Maiorana–McFarland class of cryptographic functions
Journal of Cryptographic Engineering, 2016Co-Authors: Enes Pasalic, Anupam Chattopadhyay, Weiguo ZhangAbstract:Recently, a class of cryptographic Boolean functions called generalized Maiorana–McFarland (GMM) functions was proposed in Zhang and Pasalic (IEEE Trans Inf Theory 60(10):6681–6695, 2014). In particular, it was demonstrated that certain subclasses within the GMM class satisfy all the relevant cryptographic criteria including a good resistance to (fast) algebraic cryptanalysis. However, the issue of efficient hardware implementation, which is essentially of crucial importance when such a function is used as a filtering function in certain stream cipher encryption schemes, has not been addressed in Zhang and Pasalic (2014). In this article, we analyze the complexity of hardware implementation of these subclasses and provide some exact estimates in terms of the number of elementary circuits needed. It turns out that these classes of cryptographically strong functions are also characterized with a very low hardware implementation cost, making these functions attractive candidates for the use in certain stream cipher schemes.
-
constructions of bent negabent functions and their relation to the completed maiorana McFarland class
IEEE Transactions on Information Theory, 2015Co-Authors: Fengrong Zhang, Enes PasalicAbstract:The problem of constructing bent-negabent functions that do not belong to the completed Maiorana-McFarland class emerges implicitly through a series of construction methods proposed recently. These approaches manage to optimize the algebraic degree of bent-negabent functions, but all of the constructed bent-negabent functions belong to the completed Maiorana-McFarland class. In this paper, we use the indirect sum construction (proposed by Carlet in 2004) for constructing the bent-negabent functions that are not provably contained in this class, which is the first significant attempt in this direction. To achieve this, we first provide a class of bent functions with certain desirable properties that does not belong to this class and demonstrate the existence of the class members. Then, embedding these functions in the framework of the indirect sum construction, we are able to specify sufficient conditions for bent-negabent functions not being contained in the completed Maiorana-McFarland class.
-
Constructions of Bent—Negabent Functions and Their Relation to the Completed Maiorana—McFarland Class
IEEE Transactions on Information Theory, 2015Co-Authors: Fengrong Zhang, Enes PasalicAbstract:The problem of constructing bent-negabent functions that do not belong to the completed Maiorana-McFarland class emerges implicitly through a series of construction methods proposed recently. These approaches manage to optimize the algebraic degree of bent-negabent functions, but all of the constructed bent-negabent functions belong to the completed Maiorana-McFarland class. In this paper, we use the indirect sum construction (proposed by Carlet in 2004) for constructing the bent-negabent functions that are not provably contained in this class, which is the first significant attempt in this direction. To achieve this, we first provide a class of bent functions with certain desirable properties that does not belong to this class and demonstrate the existence of the class members. Then, embedding these functions in the framework of the indirect sum construction, we are able to specify sufficient conditions for bent-negabent functions not being contained in the completed Maiorana-McFarland class.
-
On the approximation of S-boxes via Maiorana-McFarland functions
IET Information Security, 2013Co-Authors: Enes PasalicAbstract:Substitution boxes (S-boxes) are the key components of conventional cryptographic systems. To quantify the confusion property of S-boxes, different non-linearity criteria are proposed such as usual non-linearity (NF), unrestricted non-linearity (UNF), generalised non-linearity (GNF), higher order non-linearity (HNF) and so on. Although these different criteria come from the idea of linear (or non-linear) approximation of S-boxes, the algebraic structures of Boolean functions that are used to approximate to S-boxes have not been considered yet. In this study, the concept of the extended non-linearity of S-boxes (denoted by ENF) is introduced by measuring the distance of a given function to a subset of Maiorana-McFarland functions. This approximation appears to be appealing because of a particular structure of this class of functions, namely their representation as a concatenation of affine functions. The complexity of computing the rth order extended non-linearity for S-boxes over GF(2)n is less than O((n : r)2n-r), (r > 1). Moreover, a theoretical upper bound for the rth order extended non-linearity is proved, which is much lower than previous generalised non-linearity which might give a rise to more efficient attacks that combine a generalised correlation approach with guess and determine techniques. Furthermore, the relationship between the r-order extended non-linearity and the generalised non-linearity is derived.
Guang Gong - One of the best experts on this subject based on the ideXlab platform.
-
Upper bound for algebraic immunity on a subclass of Maiorana McFarland class of bent functions
Information Processing Letters, 2011Co-Authors: Kishan Chand Gupta, Yassir Nawaz, Guang GongAbstract:Studying algebraic immunity of Boolean functions is recently a very important research topic in cryptography. It is recently proved by Courtois and Meier that for any Boolean function of n-variable the maximum algebraic immunity is @?n2@?. We found a large subclass of Maiorana McFarland bent functions on n-variable with a proven low level of algebraic immunity =
-
upper bound for algebraic immunity on a subclass of maiorana McFarland class of bent functions
Information Processing Letters, 2011Co-Authors: Kishan Chand Gupta, Yassir Nawaz, Guang GongAbstract:Studying algebraic immunity of Boolean functions is recently a very important research topic in cryptography. It is recently proved by Courtois and Meier that for any Boolean function of n-variable the maximum algebraic immunity is @?n2@?. We found a large subclass of Maiorana McFarland bent functions on n-variable with a proven low level of algebraic immunity =<@?n4@?+2. To the best of our knowledge we provide for the first time a new upper bound for algebraic immunity for a nontrivial class of Boolean functions. We also discuss that this result has some fascinating implications.
-
time memory data trade off attack on stream ciphers based on maiorana McFarland functions
IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences, 2009Co-Authors: Khoongming Khoo, Guanhan Chew, Guang GongAbstract:In this paper, we present the time-memory-data (TMD) trade-o attack on stream ciphers filter function generators and filter cominers based on Maiorana-McFarland functions. This can be considered as a generalization of the time-memory-data trade-o attack of Mihaljevic and Imai on Toyocrypt. First, we substitute the filter function in Toyocrypt (which has the same size as the LFSR) with a general Maiorana-McFarland function. This allows us to apply the attack to a wider class of stream ciphers. Second, we highlight how the choice of dierent Maiorana-McFarland functions can aect the eectiveness of our attack. Third, we show that the attack can be modified to apply on filter functions which are smaller than the LFSR and on filter-combiner stream ciphers. This allows us to cryptanalyze other configurations commonly found in practice. Finally, filter functions with vector output are sometimes used in stream ciphers to improve the throughput. Therefore the case when the Maiorana-McFarland functions have vector output is investigated. We found that the extra speed comes at the price of additional weaknesses which make the attacks easier.
-
ACNS - The rainbow attack on stream ciphers based on maiorana-McFarland functions
RoboCup 2005: Robot Soccer World Cup IX, 2006Co-Authors: Khoongming Khoo, Guang GongAbstract:In this paper, we present the rainbow attack on stream ciphers filtered by Maiorana-McFarland functions. This can be considered as a generalization of the time-memory-data trade-off attack of Mihaljevic and Imai on Toyocrypt. First, we substitute the filter function in Toyocrypt (which has the same size as the LFSR) with a general Maiorana-McFarland function. This allows us to apply the attack to a wider class of stream ciphers. Moreover, our description replaces the time-memory-data trade-off attack with the rainbow attack of Oeshlin, which offers better performance and implementation advantages. Second, we highlight how the choice of different Maiorana-McFarland functions can affect the effectiveness of our attack. Third, we show that the attack can be modified to apply on filter functions which are smaller than the LFSR or on filter-combiner stream ciphers. This allows us to cryptanalyze other configurations commonly found in practice. Finally, filter functions with vector output are sometimes used in stream ciphers to improve the throughput. Therefore the case when the Maiorana-McFarland functions have vector output is investigated. We found that the extra speed comes at the price of additional weaknesses which make the attacks easier.
-
the rainbow attack on stream ciphers based on maiorana McFarland functions
Lecture Notes in Computer Science, 2006Co-Authors: Khoongming Khoo, Guang GongAbstract:In this paper, we present the rainbow attack on stream ciphers filtered by Maiorana-McFarland functions. This can be considered as a generalization of the time-memory-data trade-off attack of Mihaljevic and Imai on Toyocrypt. First, we substitute the filter function in Toyocrypt (which has the same size as the LFSR) with a general Maiorana-McFarland function. This allows us to apply the attack to a wider class of stream ciphers. Moreover, our description replaces the time-memory-data trade-off attack with the rainbow attack of Oeshlin, which offers better performance and implementation advantages. Second, we highlight how the choice of different Maiorana-McFarland functions can affect the effectiveness of our attack. Third, we show that the attack can be modified to apply on filter functions which are smaller than the LFSR or on filter-combiner stream ciphers. This allows us to crypt-analyze other configurations commonly found in practice. Finally, filter functions with vector output are sometimes used in stream ciphers to improve the throughput. Therefore the case when the Maiorana-McFarland functions have vector output is investigated. We found that the extra speed comes at the price of additional weaknesses which make the attacks easier.
Claude Carlet - One of the best experts on this subject based on the ideXlab platform.
-
On the confusion and diffusion properties of Maiorana–McFarland's and extended Maiorana–McFarland's functions
Journal of Complexity, 2020Co-Authors: Claude CarletAbstract:AbstractA practical problem in symmetric cryptography is finding constructions of Boolean functions leading to reasonably large sets of functions satisfying some desired cryptographic criteria. The main known construction, called Maiorana–McFarland, has been recently extended. Some other constructions exist, but lead to smaller classes of functions. Here, we study more in detail the nonlinearities and the resiliencies of the functions produced by all these constructions. Further we see how to obtain functions satisfying the propagation criterion (among which bent functions) with these methods, and we give a new construction of bent functions based on the extended Maiorana–McFarland's construction
-
Generalized bent functions and their relation to Maiorana-McFarland class
2012 IEEE International Symposium on Information Theory Proceedings, 2012Co-Authors: Lilya Budaghyan, Claude Carlet, Tor Helleseth, Alexander KholoshaAbstract:In this paper, most of the known infinite classes of generalized bent functions are analyzed for their relation to the completed Maiorana-McFarland class. This is done using the criterion based on second-order derivatives of a function. In particular, it is shown that, unlike in the binary case, not all quadratic bent functions are EA-equivalent to a function of the Maiorana-McFarland type. This is the first attempt to rise this problem for the generalized bent functions.
-
ISIT - Generalized bent functions and their relation to Maiorana-McFarland class
2012 IEEE International Symposium on Information Theory Proceedings, 2012Co-Authors: Lilya Budaghyan, Claude Carlet, Tor Helleseth, Alexander KholoshaAbstract:In this paper, most of the known infinite classes of generalized bent functions are analyzed for their relation to the completed Maiorana-McFarland class. This is done using the criterion based on second-order derivatives of a function. In particular, it is shown that, unlike in the binary case, not all quadratic bent functions are EA-equivalent to a function of the Maiorana-McFarland type. This is the first attempt to rise this problem for the generalized bent functions.
-
Further Results on Niho Bent Functions
IEEE Transactions on Information Theory, 2012Co-Authors: Lilya Budaghyan, Claude Carlet, Tor Helleseth, Alexander Kholosha, Sihem MesnagerAbstract:This paper consists of two main contributions. First, the Niho bent function consisting of 2r exponents (discovered by Leander and Kholosha) is studied. The dual of the function is found and it is shown that this new bent function is not of the Niho type. Second, all known univariate representations of Niho bent functions are analyzed for their relation to the completed Maiorana-McFarland class M. In particular, it is proven that two families do not belong to the completed class M. The latter result gives a positive answer to an open problem whether the class H of bent functions introduced by Dillon in his thesis of 1974 differs from the completed class M.
-
on the confusion and diffusion properties of maiorana McFarland s and extended maiorana McFarland s functions
Journal of Complexity, 2004Co-Authors: Claude CarletAbstract:A practical problem in symmetric cryptography is finding constructions of Boolean functions leading to reasonably large sets of functions satisfying some desired cryptographic criteria. The main known construction, called Maiorana-McFarland, has been recently extended. Some other constructions exist, but lead to smaller classes of functions. Here, we study more in detail the nonlinearities and the resiliencies of the functions produced by all these constructions. Further we see how to obtain functions satisfying the propagation criterion (among which bent functions) with these methods, and we give a new construction of bent functions based on the extended Maiorana-McFarland's construction.
Ellis R Loew - One of the best experts on this subject based on the ideXlab platform.
-
A tribute to William N. “MAC” McFarland (1926–2004)
Visual Neuroscience, 2007Co-Authors: Ellis R LoewAbstract:On August 31, 2004 William N. “MAC” McFarland died in Mt. Vernon, Washington just 11 days shy of his 79th birthday. He was into his second post-retirement professorship (from Cornell and USC) at the Friday Harbor Labs of the University of Washington. Rather than the usual CV with a list of awards and accomplishments, of which Mac had many, I would like to posit the following question, “Why should Mac be honored in this issue?” To those of us who knew and worked with him, the fact that he was “Mac” says it all. However, to those who did not know him, more justification is needed.
-
a tribute to william n mac McFarland 1926 2004
Visual Neuroscience, 2007Co-Authors: Ellis R LoewAbstract:On August 31, 2004 William N. “MAC” McFarland died in Mt. Vernon, Washington just 11 days shy of his 79th birthday. He was into his second post-retirement professorship (from Cornell and USC) at the Friday Harbor Labs of the University of Washington. Rather than the usual CV with a list of awards and accomplishments, of which Mac had many, I would like to posit the following question, “Why should Mac be honored in this issue?” To those of us who knew and worked with him, the fact that he was “Mac” says it all. However, to those who did not know him, more justification is needed.
-
A tribute to William N. “MAC” McFarland (1926–2004)
Visual Neuroscience, 2007Co-Authors: Ellis R LoewAbstract:On August 31, 2004 William N. “MAC” McFarland died in Mt. Vernon, Washington just 11 days shy of his 79th birthday. He was into his second post-retirement professorship (from Cornell and USC) at the Friday Harbor Labs of the University of Washington. Rather than the usual CV with a list of awards and accomplishments, of which Mac had many, I would like to posit the following question, “Why should Mac be honored in this issue?” To those of us who knew and worked with him, the fact that he was “Mac” says it all. However, to those who did not know him, more justification is needed.
Weiguo Zhang - One of the best experts on this subject based on the ideXlab platform.
-
efficient implementation of generalized maiorana McFarland class of cryptographic functions
Journal of Cryptographic Engineering, 2017Co-Authors: Enes Pasalic, Weiguo Zhang, Anupam ChattopadhyayAbstract:Recently, a class of cryptographic Boolean functions called generalized Maiorana–McFarland (GMM) functions was proposed in Zhang and Pasalic (IEEE Trans Inf Theory 60(10):6681–6695, 2014). In particular, it was demonstrated that certain subclasses within the GMM class satisfy all the relevant cryptographic criteria including a good resistance to (fast) algebraic cryptanalysis. However, the issue of efficient hardware implementation, which is essentially of crucial importance when such a function is used as a filtering function in certain stream cipher encryption schemes, has not been addressed in Zhang and Pasalic (2014). In this article, we analyze the complexity of hardware implementation of these subclasses and provide some exact estimates in terms of the number of elementary circuits needed. It turns out that these classes of cryptographically strong functions are also characterized with a very low hardware implementation cost, making these functions attractive candidates for the use in certain stream cipher schemes.
-
Efficient implementation of generalized Maiorana–McFarland class of cryptographic functions
Journal of Cryptographic Engineering, 2016Co-Authors: Enes Pasalic, Anupam Chattopadhyay, Weiguo ZhangAbstract:Recently, a class of cryptographic Boolean functions called generalized Maiorana–McFarland (GMM) functions was proposed in Zhang and Pasalic (IEEE Trans Inf Theory 60(10):6681–6695, 2014). In particular, it was demonstrated that certain subclasses within the GMM class satisfy all the relevant cryptographic criteria including a good resistance to (fast) algebraic cryptanalysis. However, the issue of efficient hardware implementation, which is essentially of crucial importance when such a function is used as a filtering function in certain stream cipher encryption schemes, has not been addressed in Zhang and Pasalic (2014). In this article, we analyze the complexity of hardware implementation of these subclasses and provide some exact estimates in terms of the number of elementary circuits needed. It turns out that these classes of cryptographically strong functions are also characterized with a very low hardware implementation cost, making these functions attractive candidates for the use in certain stream cipher schemes.
-
construction of almost optimal resilient boolean functions via concatenating maiorana McFarland functions
Science in China Series F: Information Sciences, 2011Co-Authors: Weiguo Zhang, Guozhen XiaoAbstract:We describe a method to construct an n-variable (n even) almost optimal resilient Boolean function via concatenating 2d properly chosen (n−d)-variable Maiorana-McFarland functions. As an example, a 5-resilient 42-variable Boolean function with currently best known nonlinearity 241 −220 −217 is provided.
-
generalized maiorana McFarland constructions for almost optimal resilient functions
arXiv: Cryptography and Security, 2010Co-Authors: Weiguo Zhang, Guozhen XiaoAbstract:In a recent paper \cite{Zhang-Xiao}, Zhang and Xiao describe a technique on constructing almost optimal resilient functions on even number of variables. In this paper, we will present an extensive study of the constructions of almost optimal resilient functions by using the generalized Maiorana-McFarland (GMM) construction technique. It is shown that for any given $m$, it is possible to construct infinitely many $n$-variable ($n$ even), $m$-resilient Boolean functions with nonlinearity equal to $2^{n-1}-2^{n/2-1}-2^{k-1}$ where $k 2^{n-2}-2^{(n-1)/2}$ ($n$ odd) by using Patterson-Wiedemann functions or Kavut-Y$\ddot{u}$cel functions. Finally, we provide a GMM construction technique for multiple-output almost optimal $m$-resilient functions $F: \mathbb{F}_2^n\mapsto \mathbb{F}_2^r$ ($n$ even) with nonlinearity $>2^{n-1}-2^{n/2}$. Using the methods proposed in this paper, a large class of previously unknown cryptographic resilient functions are obtained.
