A note on the complexity of cryptography (Corresp.)

DOI10.1109/TIT.1979.1056010zbMath0393.68052OpenAlexW1974733147MaRDI QIDQ4174761

Gilles Brassard

Publication date: 1979

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/tit.1979.1056010

zbMATH Keywords

ComplexityCryptographyNp-Completeness

Mathematics Subject Classification ID

Cryptography (94A60) Data encryption (aspects in computer science) (68P25)

Related Items (8)

An observation on associative one-way functions in complexity theory ⋮ On hardness of one-way functions ⋮ Crypto Galore! ⋮ Knottedness is in NP, modulo GRH ⋮ A time-luck tradeoff in relativized cryptography ⋮ Enforcing and defying associativity, commutativity, totality, and strong noninvertibility for worst-case one-way functions ⋮ Meet your expectations with guarantees: beyond worst-case synthesis in quantitative games ⋮ Unnamed Item

This page was built for publication: A note on the complexity of cryptography (Corresp.)