Enumerating Nondegenerate Permutations

DOI10.1007/3-540-46416-6_31zbMATH Open0766.94013OpenAlexW2112574687MaRDI QIDQ4037481FDOQ4037481

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

Recommendations

• scientific article; zbMATH DE number 3941545
• On the enumeration of permutominoes
• Enumerating permutation polynomials
• scientific article
• 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

zbMATH Keywords

ciphercryptosystemBoolean equationsnondegenerate permutations

Mathematics Subject Classification ID

Cryptography (94A60)

Cited In (7)

• Enumerating permutation polynomials. I: Permutations with non-maximal degree
• Title not available (Why is that?)
• Algebraic nonlinearity and its applications to cryptography
• Title not available (Why is that?)
• Enumerating permutations by their run structure
• Generating Countable Sets of Permutations
• Title not available (Why is that?)

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)