Best linear approximation and correlation immunity of functions over Z/sub m/*

DOI10.1109/18.746825MaRDI QIDQ4701276zbMATH OpenOpenAlexFDO

Authors Jinjun Zhou, Weihong Chen, Fengxiu Gao

Publication date 21 November 1999

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/18.746825

zbMATH Keywords

algorithmdiscrete Fourier transformcorrelation immunitybest linear approximation

Mathematics Subject Classification ID

Shift register sequences and sequences over finite alphabets in information and communication theory (94A55) Numerical methods for discrete and fast Fourier transforms (65T50)

Recommendations

• scientific article; zbMATH DE number 2195362
• Linear approximations of addition modulo \(2^{n }\)
• On the best linear approximation of addition modulo \(2^n\)
• Fast low order approximation of cryptographic functions
• An improved approximation algorithm for computing the \(k\)-error linear complexity of sequences using the discrete Fourier transform

Cited in

(2)

• scientific article; zbMATH DE number 2195362 (Why is no real title available?)
• On the best linear approximation of addition modulo \(2^n\)

This page was built for publication: Best linear approximation and correlation immunity of functions over Z/sub m/*

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