Partial covering sequences: a method for designing classes of cryptographic functions

DOI10.1142/9789812793430_0020zbMATH Open1207.94049OpenAlexW2322085490MaRDI QIDQ3545364FDOQ3545364

Authors: Claude Carlet 

Publication date: 10 December 2008

Published in: Algebraic Geometry and Its Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/9789812793430_0020

Recommendations

• Covering sequences of Boolean functions and their cryptographic significance
• Partially Perfect Nonlinear Functions and a Construction of Cryptographic Boolean Functions
• scientific article; zbMATH DE number 5901698
• Embedding cover-free families and cryptographical applications
• Combinatorial designs and cryptography, revisited
• Some results on an encryption method using subset-sums of pseudo-recursive sequences
• Constructing new covering arrays from LFSR sequences over finite fields
• Sequences of bent functions and near-bent functions
• scientific article; zbMATH DE number 7301711
• Partially homomorphic encryption schemes over finite fields

zbMATH Keywords

method for designing constructions of Boolean functions with efficiently computable weights and Walsh spectra

Mathematics Subject Classification ID

Cryptography (94A60)

Cited In (3)

• Constructing new covering arrays from LFSR sequences over finite fields
• Embedding cover-free families and cryptographical applications
• Covering sequences of Boolean functions and their cryptographic significance

This page was built for publication: Partial covering sequences: a method for designing classes of cryptographic functions

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