Qichun Wang

Shi Shu

Dataset, May, 2022

The SAT-Based Automatic Searching and Experimental Verification for Differential Characteristics with Application to Midori64.

[BibT_eX]

[DOI]

Yingying Li

IACR Cryptol. ePrint Arch., 2022

The Covering Radius of the Third-Order Reed-Muller Codes RM(3, 7) is 20.

[BibT_eX]

[DOI]

CoRR, 2022

2020

On a Conjecture of O'Donnell.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2020

Searching for Balanced S-Boxes with High Nonlinearity, Low Differential Uniformity, and Improved DPA-Resistance.

[BibT_eX]

[DOI]

Youle Xu

Proceedings of the Information Security - 23rd International Conference, 2020

2019

A Note on Minimum Hamming Weights of Correlation-Immune Boolean Functions.

[BibT_eX]

[DOI]

Yanjun Li

IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2019

The Covering Radius of the Reed-Muller Code <i>R</i>(3, 7) in <i>R</i>(5, 7) Is 20.

[BibT_eX]

[DOI]

Gui Li

Shi Shu

IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2019

The covering radius of the Reed-Muller code RM(2, 7) is 40.

[BibT_eX]

[DOI]

Discret. Math., 2019

Transparency order for Boolean functions: analysis and construction.

[BibT_eX]

[DOI]

Des. Codes Cryptogr., 2019

A trigonometric sum sharp estimate and new bounds on the nonlinearity of some cryptographic Boolean functions.

[BibT_eX]

[DOI]

Des. Codes Cryptogr., 2019

Hadamard matrices, d-linearly independent sets and correlation-immune Boolean functions with minimum Hamming weights.

[BibT_eX]

[DOI]

Des. Codes Cryptogr., 2019

New bounds on the covering radius of the second order Reed-Muller code of length 128.

[BibT_eX]

[DOI]

Cryptogr. Commun., 2019

Constructing Boolean Functions Using Blended Representations.

[BibT_eX]

[DOI]

Caihong Nie

Youle Xu

IEEE Access, 2019

Searching for Highly Nonlinear DPA-Resistant Balanced Boolean Functions in the Rotation Symmetric Class.

[BibT_eX]

[DOI]

Youle Xu

Proceedings of the IEEE International Symposium on Information Theory, 2019

2018

More New Classes of Differentially 4-Uniform Permutations with Good Cryptographic Properties.

[BibT_eX]

[DOI]

IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2018

On the covering radius of the third order Reed-Muller code RM(3, 7).

[BibT_eX]

[DOI]

Theo Fanuela Prabowo

Des. Codes Cryptogr., 2018

2017

New secondary constructions of differentially 4-uniform permutations over.

[BibT_eX]

[DOI]

Jie Peng

Int. J. Comput. Math., 2017

2016

On the second-order nonlinearity of the hidden weighted bit function.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2016

Proof of a conjecture and a bound on the imbalance properties of LFSR subsequences.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2016

2015

A construction of Boolean functions with good cryptographic properties.

[BibT_eX]

[DOI]

Int. J. Comput. Math., 2015

On the Covering Radius of the Second Order Reed-Muller Code of Length 128.

[BibT_eX]

[DOI]

CoRR, 2015

New bounds on the imbalance of a half-l-sequence.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2015

2014

Balanced Boolean functions with optimum algebraic degree, optimum algebraic immunity and very high nonlinearity.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2014

Cryptographic properties of the hidden weighted bit function.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2014

A new construction of differentially 4-uniform permutations over $F_{2^{2k}}$.

[BibT_eX]

[DOI]

Jie Peng

CoRR, 2014

Concatenations of the hidden weighted bit function and their cryptographic properties.

[BibT_eX]

[DOI]

Adv. Math. Commun., 2014

Properties of a Family of Cryptographic Boolean Functions.

[BibT_eX]

[DOI]

Proceedings of the Sequences and Their Applications - SETA 2014, 2014

Cryptographic boolean functions with a large number of variables.

[BibT_eX]

[DOI]

Proceedings of the 2014 IEEE International Symposium on Information Theory, Honolulu, HI, USA, June 29, 2014

2013

A new method to construct Boolean functions with good cryptographic properties.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2013

A Family of Cryptographically Significant Boolean Functions Based on the Hidden Weighted Bit Function.

[BibT_eX]

[DOI]

Timothy Foo

Proceedings of the Information Security and Cryptology - ICISC 2013, 2013

2012

A note on the algebraic immunity of the Maiorana-McFarland class of bent functions.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2012

Some results on fast algebraic attacks and higher-order non-linearities.

[BibT_eX]

[DOI]

Thomas Johansson

Haibin Kan

IET Inf. Secur., 2012

A Note on the Construction of Differentially Uniform Permutations Using Extension Fields.

[BibT_eX]

[DOI]

Haibin Kan

IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2012

2011

A Constructive Method of Algebraic Attack with Less Keystream Bits.

[BibT_eX]

[DOI]

IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2011

Two Classes of Crooked Multinomials Inequivalent to Power Functions

[BibT_eX]

[DOI]

Xueying Duan

CoRR, 2011

2010

Constructions of cryptographically significant boolean functions using primitive polynomials.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2010

On Equivalence Classes of Boolean Functions.

[BibT_eX]

[DOI]

Thomas Johansson

Proceedings of the Information Security and Cryptology - ICISC 2010, 2010

A Note on Fast Algebraic Attacks and Higher Order Nonlinearities.

[BibT_eX]

[DOI]

Thomas Johansson

Proceedings of the Information Security and Cryptology - 6th International Conference, 2010

2009

New Balanced Boolean Functions with Good Cryptographic Properties.

[BibT_eX]

[DOI]