Generating cryptographically strong Boolean functions using partial information

DOI10.1023/B:MAHU.0000040543.22350.A0MaRDI QIDQ705821zbMATH OpenOpenAlexFDO

Authors Marta Šimovcová, Martin Stanek

Publication date 14 February 2005

Published in Periodica Mathematica Hungarica (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1023/b:mahu.0000040543.22350.a0

zbMATH Keywords

greedy algorithmBoolean functioncryptographynonlinearitypartially defined Boolean function

Mathematics Subject Classification ID

Cryptography (94A60) Boolean functions (06E30)

Recommendations

• scientific article; zbMATH DE number 2104732
• scientific article; zbMATH DE number 1543297
• Partially Perfect Nonlinear Functions and a Construction of Cryptographic Boolean Functions
• scientific article; zbMATH DE number 1303144
• Progress in Cryptology - INDOCRYPT 2004

Cited in

(1)

• Revisiting \textit{BoolTest} -- on randomness testing using Boolean functions

This page was built for publication: Generating cryptographically strong Boolean functions using partial information

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q705821)