A Note on a Combinatorial Conjecture - Open Journal of Discrete Mathematics

OJDM > Vol.3 No.1, January 2013

Open Journal of Discrete Mathematics

Volume 3, Issue 1 (January 2013)

ISSN Print: 2161-7635 ISSN Online: 2161-7643

Google-based Impact Factor: 0.64 Citations

A Note on a Combinatorial Conjecture ()

HTML XML

Download as PDF (Size: 82KB) PP. 49-52

DOI: 10.4236/ojdm.2013.31010 5,242 Downloads 7,660 Views Citations

Author(s)

Guixin Deng

Affiliation(s)

School of Mathematical Science, Guangxi Teachers Education University, Nanning, China.

ABSTRACT

It is difficult to find Boolean functions achieving many good cryptographic properties. Recently, Tu and Deng obtained two classes of Boolean functions with good properties based on a combinatorial conjecture about binary strings. In this paper, using different approaches, we prove this conjecture is true in some cases. This conjecture has resisted different attempts of proof since it is hard to find a recursive method. In this paper we give a recursive formula in a special case.

KEYWORDS

Binary String; Weight

Share and Cite:

G. Deng, "A Note on a Combinatorial Conjecture," Open Journal of Discrete Mathematics, Vol. 3 No. 1, 2013, pp. 49-52. doi: 10.4236/ojdm.2013.31010.

Cited by

[1]	Bent functions: results and applications to cryptography
	2015

[2]	Об алгебраической иммунности бент-функций из класса Диллона
	Дискретный анализ и исследование операций, 2014

[3]	Algebraic immunity of bent functions of the Dillon class
	Journal of Applied and Industrial Mathematics, 2014

Journals Menu

Follow SCIRP

	+1 323-425-8868
	customer@scirp.org
	+86 18163351462(WhatsApp)
	1655362766

	Paper Publishing WeChat

Journals Menu

Home

About SCIRP

Service

Policies