scientific article; zbMATH DE number 6862149

DOI10.4230/LIPICS.STACS.2017.57MaRDI QIDQ4636658zbMATH OpenFDO

Authors Maciej Skórski

Publication date 19 April 2018

Full work available at URL https://doi.org/10.4230/LIPICS.STACS.2017.57

zbMATH Keywords

key derivationlower boundssquare-friendly applications

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• Нижние оценки для практической секретности ключа
• Lower and upper bounds for deniable public-key encryption
• Bounds and constructions for key distribution schemes
• scientific article; zbMATH DE number 7650264
• Selected Areas in Cryptography
• Lower bounds on the efficiency of encryption and digital signature schemes
• On the optimality of non-linear computations for symmetric key primitives
• Information Security
• Lower bounds on the degree of block ciphers

Cited in

(4)

• Challenge codes for physically unclonable functions with Gaussian delays: a maximum entropy problem
• Нижние оценки для практической секретности ключа
• Secure Variants of the Square Encryption Scheme
• Key derivation without entropy waste

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 Q4636658)