Sequencings and Directed Graphs with Applications to Cryptography

DOI10.1007/978-3-540-77404-4_7MaRDI QIDQ5448561zbMATH OpenOpenAlexFDO

Authors Lothrop Mittenthal

Publication date 7 March 2008

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-77404-4_7

zbMATH Keywords

SequencingDirected graphBlock encryptionComplete Latin squareDirected terraceInter-round mixingQuick trickle permutationS/P networkSequenceable group

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Cryptography (94A60) Orthogonal arrays, Latin squares, Room squares (05B15)

Recommendations

• Pseudorandom permutation
• scientific article; zbMATH DE number 177034
• Perfect Block Ciphers with Small Blocks
• Sequences generating permutations
• Quick trickle permutation based on quick trickle characteristic sequence

Cited in

(5)

• Cryptographic hash functions from sequences of lifted Paley graphs
• Quick trickle permutation based on quick trickle characteristic sequence
• A Survey on some Applications of Graph Theory in Cryptography
• LEXICOGRAPHIC LABELED GRAPHS IN CRYPTOGRAPHY
• Generalized mix functions and orthogonal equitable rectangles

This page was built for publication: Sequencings and Directed Graphs with Applications to Cryptography

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