The combinatorics of generalised cumulative arrays

Journal of Mathematical Cryptology

卷:1

Martin Keith¹  Ng Siaw-Lynn² 

[1] 1 Information Security Group, Department of Mathematics, Royal Holloway, Universityof London, Surrey TW20 0EX, United Kingdom. [e-mail];

[2] 2 Information Security Group, Department of Mathematics, Royal Holloway, Universityof London, Surrey TW20 0EX, United Kingdom. [e-mail];

关键词: combinatorics,;    generalised cumulative arrays,;    distributed computation,;    boolean functions;   

DOI  :  10.1515/JMC.2007.002

来源: DOAJ

【 摘 要 】

In this paper we present a combinatorial analysis of generalised cumulative arrays.These are structures that are associated with a monotone collections of subsets of a base set andhave properties that find application in areas of information security. We propose a number of basicmeasures of efficiency of a generalised cumulative array and then study fundamental bounds ontheir parameters. We then look at a number of construction techniques and show that the problemof finding good generalised cumulative arrays is closely related to the problem of finding booleanexpressions with special properties.

【 授权许可】

Unknown