Design of boolean function from a great number of variables satisfying strict avalanche criterion

Bardis, EG; Bardis, NG; Markovski, AP; Spyropoulos, AK

dc.contributor.author	Bardis, EG	en
dc.contributor.author	Bardis, NG	en
dc.contributor.author	Markovski, AP	en
dc.contributor.author	Spyropoulos, AK	en
dc.date.accessioned	2014-03-01T01:48:32Z
dc.date.available	2014-03-01T01:48:32Z
dc.date.issued	1999	en
dc.identifier.uri	https://dspace.lib.ntua.gr/xmlui/handle/123456789/25512
dc.relation.uri	http://www.scopus.com/inward/record.url?eid=2-s2.0-4944225067&partnerID=40&md5=f4dbfd3869b37a5386dd27091750d557	en
dc.subject	Boolean functions	en
dc.subject	Cryptography	en
dc.subject	SAC functions	en
dc.subject.other	Boolean equations	en
dc.subject.other	Cryptoresistance	en
dc.subject.other	SAC functions	en
dc.subject.other	Algorithms	en
dc.subject.other	Approximation theory	en
dc.subject.other	Cryptography	en
dc.subject.other	Mathematical transformations	en
dc.subject.other	Nonlinear equations	en
dc.subject.other	Problem solving	en
dc.subject.other	Set theory	en
dc.subject.other	Boolean functions	en
dc.title	Design of boolean function from a great number of variables satisfying strict avalanche criterion	en
heal.type	journalArticle	en
heal.publicationDate	1999	en
heal.abstract	Cryptoresistance of a broad class of cryptographic algorithms is determined by their correspondence to some special criteria of bit transform Boolean functions being implemented in these algorithms. One of such criteria is a strict avalanche criterion (SAC). Obtaining of Boolean functions satisfying this criterion is an important constituent of cryptoresistant algorithm design. The existing methods of SAC-function obtaining which utilize in the explicit or implicit form the truth tables of a function being formed are practically useless for synthesis of SAC-functions from a great number of variables, because they demand memory capacity in proportion to 2n (n is the number of variables). This paper presents investigation of Boolean SAC-function properties and suggests a new method for function obtaining without making use of the truth tables. The method deals with the algebraic normal form whose storage demands memory capacity of many orders lower comparing to that for truth table storage. The method is helpful both for obtaining ordinary SAC-functions and for synthesis of high-order SAC-functions.The formalized procedure for construction of zero and higher orders SAC-functions is expounded in details, examples of functions design are given.	en
heal.journalName	Recent Advances in Signal Processing and Communications	en
dc.identifier.spage	107	en
dc.identifier.epage	112	en