Scholars Central

Research articlePublished Jun 2013

ALGORITHM TO DETERMINE THE FIXED DEGREE POLYNOMIAL OF BOOLEAN FUNCTION FOR CRYPTOGRAPHY

Authors: Nguyen Huu Khanh Nhan

Ask about this article

Abstract

Select any words in the title or abstract, or press this and choose a sentence.

Every Boolean function is uniquely defined by a polynomial modulo 2. The degree of a Boolean function is the degree of its defining polynomial. In cryptography, the Boolean functions of fixed degree played important role, for example, 1 or 2 degrees. Therefore, in finding algorithms that recognize properties of Boolean functions polynomials by their values vectors, it makes sense consider only algorithms that have lower complexity order. In this paper, we propose a linear complexity algorithm which determines the vector values a Boolean function given, it is a polynomial of fixed degree, and if so constructing this polynomial.

Subjects

Engineering

Ask about this article

Answers come only from this article's title, abstract and keywords, each sentence pointing to where it comes from. Your question is sent to OpenAI to write the answer. Scholars Central does not store it.

Try:

Similar by topic

More from this journal

The newest in International Journal of Advanced Research in Electrical, Electronics and Instrumentation Engineering.

All its articles

Conferences in this field

Upcoming conferences in this field.

Follow

New articles from what you follow go into your email digest, once you agree to alert emails.

  • JournalInternational Journal of Advanced Research in Electrical, Electronics and Instrumentation Engineering
  • SubjectEngineering
  • BylineArticles whose byline prints “Nguyen Huu Khanh Nhan”

For authors and organisers

Publish, present and keep up with your field

Find the right journal for your paper and submit your manuscript.

Photo: Pexels