A time-luck tradeoff in relativized cryptography

DOI10.1016/0022-0000(81)90034-9zbMath0499.68019OpenAlexW2011468192MaRDI QIDQ1171879

Gilles Brassard

Publication date: 1981

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0022-0000(81)90034-9

zbMATH Keywords

securityprobabilistic algorithmsrelativisationLas Vegas algorithmrecursive oraclerelativized model of computation

Mathematics Subject Classification ID

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

Uses Software

• McEliece

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A Mathematical Theory of Communication
• Riemann's hypothesis and tests for primality
• Secure communications over insecure channels
• Communication Theory of Secrecy Systems*
• Relativized cryptography
• New directions in cryptography
• Relativizations of the $\mathcal{P} = ?\mathcal{NP}$ Question
• A method for obtaining digital signatures and public-key cryptosystems
• A note on the complexity of cryptography (Corresp.)