Generating cryptographically strong Boolean functions using partial information

ISSN： 0031-5303

Source： Periodica Mathematica Hungarica, Vol.49, Iss.1, 2004-09, pp. : 119-130

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

Construction of Cryptographically Important Boolean Permutations

By Zhang Wenying

Applicable Algebra in Engineering, Communication and Computing, Vol. 15, Iss. 3-4, 2004-11 ,pp. : 173-177

Springer Publishing Company

Access to resources Recommend Favorite

Generating highly nonlinear resilient Boolean functions resistance against algebraic and fast algebraic attacks

SECURITY AND COMMUNICATION NETWORKS (ELECTRONIC), Vol. 8, Iss. 7, 2015-05 ,pp. : 1256-1264

John Wiley & Sons Inc

Access to resources Recommend Favorite

Generating a Random Collection of Discrete Joint Probability Distributions Subject to Partial Information

By Montiel Luis Bickel J.

Methodology And Computing In Applied Probability, Vol. 15, Iss. 4, 2013-12 ,pp. : 951-967

Springer Publishing Company

Access to resources Recommend Favorite

On the independence of Boolean functions

By Chuan-Kun Wu

International Journal of Computer Mathematics, Vol. 82, Iss. 4, 2005-04 ,pp. : 415-420

Taylor & Francis Ltd

Access to resources Recommend Favorite

Mobius transforms, coincident Boolean functions and non-coincidence property of Boolean functions

By Pieprzyk Josef

International Journal of Computer Mathematics, Vol. 88, Iss. 7, 2011-05 ,pp. : 1398-1416

Taylor & Francis Ltd

Access to resources Recommend Favorite