scientific article; zbMATH DE number 5252113

MaRDI QIDQ5448019zbMATH OpenFDO

Authors Dietmar Dorninger, Helmut Länger

Publication date 20 March 2008

zbMATH Keywords

latticepermutationpolynomial functioncryptographic protocolantitone involutionsymmetric cipher

Mathematics Subject Classification ID

Cryptography (94A60) Subgroups of symmetric groups (20B35) Operations and polynomials in algebraic structures, primal algebras (08A40) Complemented lattices, orthocomplemented lattices and posets (06C15) De Morgan algebras, ?ukasiewicz algebras (lattice-theoretic aspects) (06D30)

Recommendations

• Cryptological Applications of Permutation Polynomials
• Permutation polynomials in RSA-cryptosystems
• On permutation polynomials over finite fields
• Permutation polynomials over finite fields
• Permutation polynomials over finite fields
• scientific article; zbMATH DE number 426128
• Cryptosystems based on permutation polynomials
• Some permutation polynomials over finite fields and a security key exchange protocol
• Permutation polynomials and a new public-key encryption
• Some permutation polynomials over finite fields

Cited in

(5)

• Polynomial permutations on bounded commutative directoids with an antitone involution
• The action of a few random permutations on r-tuples and an application to cryptography
• Locks fit into keys: a crystal analysis of lock polynomials
• Just how hard are rotations of \(\mathbb{Z}^n\)? Algorithms and cryptography with the simplest lattice
• One-way permutations on elliptic curves

This page was built for publication:

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