Symmetrically and asymmetrically hard cryptography
From MaRDI portal
Recommendations
Cited in
(16)- A modular approach to the incompressibility of block-cipher-based AEADs
- Computational Science and Its Applications – ICCSA 2004
- scientific article; zbMATH DE number 1107704 (Why is no real title available?)
- Ciphertext verification security of symmetric encryption schemes
- Asymmetric cryptographic algorithms
- Classical and physical security of symmetric key cryptographic algorithms
- Simon's algorithm and symmetric crypto: generalizations and automatized applications
- Verifiable capacity-bound functions: a new primitive from Kolmogorov complexity. (Revisiting space-based security in the adaptive setting)
- PURED: a unified framework for resource-hard functions
- Trapdoor memory-hard functions
- Cryptoschemes based on difficulty of simultaneous solving two different difficult problems
- Symmetric key end to end Cryptosystem using Plateaued functions and Hadamard matrix
- scientific article; zbMATH DE number 1952038 (Why is no real title available?)
- Novel orbit based symmetric cryptosystems
- Asymmetric Cryptography with a Hidden Monomial
- scientific article; zbMATH DE number 4097278 (Why is no real title available?)
This page was built for publication: Symmetrically and asymmetrically hard cryptography
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1701455)
