Mathematical Research Data Initiative
Main page
Recent changes
Random page
SPARQL
MaRDI@GitHub
New item
Special pages
In other projects
MaRDI portal item
Discussion
View source
View history
English
Log in

On a mnemonic construction of permutations

From MaRDI portal
Publication:515400
Jump to:navigation, search

DOI10.1515/JMC-2016-0058zbMATH Open1358.05003OpenAlexW2587088262MaRDI QIDQ515400FDOQ515400


Authors: Eugen Antal, Otokar Grošek, Peter Horák Edit this on Wikidata


Publication date: 16 March 2017

Published in: Journal of Mathematical Cryptology (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1515/jmc-2016-0058




Recommendations

  • Pseudorandom permutation
  • scientific article; zbMATH DE number 697813
  • scientific article; zbMATH DE number 1930413
  • A construction of a cipher from a single pseudorandom permutation.
  • Estimation of the number of ``good permutations with applications to cryptography


zbMATH Keywords

permutationsEulerian numberscryptography


Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Cryptography (94A60)


Cites Work

  • Foundations of Cryptography
  • Title not available (Why is that?)
  • Eulerian Numbers
  • Tweakable block ciphers
  • Title not available (Why is that?)
  • Asymptotic properties of eulerian numbers






This page was built for publication: On a mnemonic construction of permutations

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

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:515400&oldid=12399136"
Tools
What links here
Related changes
Printable version
Permanent link
Page information
This page was last edited on 30 January 2024, at 06:25. Warning: Page may not contain recent updates.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki