On non-polynomiality of XOR over Z₂^n

zbMATH Open1113.68047MaRDI QIDQ3369010FDOQ3369010

Authors: Otokar Grošek, Mirka Miller, Joe Ryan 

Publication date: 22 March 2007

Recommendations

• On non-polynomial Latin squares
• On the XOR of multiple random permutations
• Permutation polynomials modulo \(n\), \(n\ne 2^w\) and Latin squares
• Permutation polynomials modulo \(2^w\)
• scientific article; zbMATH DE number 6001315

zbMATH Keywords

Latin squaresblock ciphersblock cipher algorithmspolynomial approximation of XOR

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Orthogonal arrays, Latin squares, Room squares (05B15)

Cited In (3)

• On non-polynomial Latin squares
• On Binary Sequences from Recursions “modulo 2e” Made Non-Linear by the Bit-By-Bit “XOR” Function
• Title not available (Why is that?)

This page was built for publication: On non-polynomiality of XOR over \(\mathbb Z_2^n\)

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