Enumerating Nondegenerate Permutations

DOI10.1007/3-540-46416-6_31MaRDI QIDQ4037481zbMATH OpenOpenAlexFDO

Authors Luke O'Connor

Publication date 18 May 1993

Published in Advances in Cryptology — EUROCRYPT ’91 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-46416-6_31

zbMATH Keywords

Boolean equationsciphercryptosystemnondegenerate permutations

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• scientific article; zbMATH DE number 3941545
• On the enumeration of permutominoes
• Enumerating permutation polynomials
• scientific article; zbMATH DE number 2186865
• Enumeration of permutations by number of alternating descents
• scientific article; zbMATH DE number 6960762
• Enumeration of permutations with restricted subsequences
• Enumeration of permutations by the parity of descent positions
• Enumerating coprime permutations
• Enumeration Schemes for Restricted Permutations

Cited in

(8)

• Algebraic nonlinearity and its applications to cryptography
• Enumerating permutation polynomials. I: Permutations with non-maximal degree
• scientific article; zbMATH DE number 35073 (Why is no real title available?)
• Enumerating permutations by their run structure
• scientific article; zbMATH DE number 6960762 (Why is no real title available?)
• Generating Countable Sets of Permutations
• scientific article; zbMATH DE number 6269007 (Why is no real title available?)
• Nondegenerate functions and permutations

This page was built for publication: Enumerating Nondegenerate Permutations

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