A Complete Public-Key Cryptosystem
From MaRDI portal
Publication:3617413
DOI10.1515/GCC.2009.1zbMath1158.94384MaRDI QIDQ3617413
Konstantin Pervyshev, Edward A. Hirsch, Dima Yu. Grigoriev
Publication date: 23 March 2009
Published in: Groups – Complexity – Cryptology (Search for Journal in Brave)
Related Items
A complete one-way function based on a finite rank free \(\mathbb{Z}\times\mathbb{Z}\)-module, Feebly secure cryptographic primitives, Circuit complexity of linear functions: gate elimination and feeble security, Structural complexity of AvgBPP, Cryptographic transformations of non-Shannon sources of information, Gate Elimination for Linear Functions and New Feebly Secure Constructions, On optimal heuristic randomized semidecision procedures, with applications to proof complexity and cryptography, On complete one-way functions, Algebraic cryptography: new constructions and their security against provable break, A Feebly Secure Trapdoor Function, Structural Complexity of AvgBPP
Cites Work