On the minimal hardware complexity of pseudorandom function generators
M Krause, S Lucks - STACS 2001: 18th Annual Symposium on Theoretical …, 2001 - Springer
A set F of Boolean functions is called a pseudorandom function gen-erator (PRFG) if
communicating with a randomly chosen secret function from F cannot be efficiently …
communicating with a randomly chosen secret function from F cannot be efficiently …
On the Minimal Hardware Complexity of Pseudorandom Function Generators
M Krause, S Lucks - Lecture Notes in Computer Science, 2001 - elibrary.ru
A set F of Boolean functions is called a pseudorandom function generator (PRFG) if
communicating with a randomly chosen secret function from F cannot be efficiently …
communicating with a randomly chosen secret function from F cannot be efficiently …
[引用][C] On the Minimal Hardware Complexity of Pseudorandom Function Generators
M Krause, S Lucks - Lecture Notes in Computer …, 2001 - madoc.bib.uni-mannheim.de
On the Minimal Hardware Complexity of Pseudorandom Function Generators - MADOC Website
der UB | Impressum | Datenschutzerklärung | Drucken | English Clear Cookie - decide language …
der UB | Impressum | Datenschutzerklärung | Drucken | English Clear Cookie - decide language …
On the Minimal Hardware Complexity of Pseudorandom Function Generators
M Krause, S Lucks - STACS 2001: 18th Annual Symposium on …, 2003 - books.google.com
A set F of Boolean functions is called a pseudorandom function generator (PRFG) if
communicating with a randomly chosen secret function from F cannot be efficiently …
communicating with a randomly chosen secret function from F cannot be efficiently …
[PDF][PDF] On the Minimal Hardware Complexity of Pseudorandom Function Generators
M Krause, S Lucks - STACS 2001 - academia.edu
A set F of Boolean functions is called a pseudorandom function generator (PRFG) if
communicating with a randomly chosen secret function from F cannot be efficiently …
communicating with a randomly chosen secret function from F cannot be efficiently …
[引用][C] On the minimal hardware complexity of pseudorandom function generators
M KRAUSE, S LUCKS - Lecture notes in computer science, 2001 - pascal-francis.inist.fr
On the minimal hardware complexity of pseudorandom function generators CNRS Inist
Pascal-Francis CNRS Pascal and Francis Bibliographic Databases Simple search Advanced …
Pascal-Francis CNRS Pascal and Francis Bibliographic Databases Simple search Advanced …
On the Minimal Hardware Complexity of Pseudorandom Function Generators
M Krause, S Lucks - STACS 2001 - infona.pl
A set F of Boolean functions is called a pseudorandom function gen-erator (PRFG) if
communicating with a randomly chosen secret function from F cannot be efficiently …
communicating with a randomly chosen secret function from F cannot be efficiently …
[PDF][PDF] On the minimal Hardware Complexity of Pseudorandom Function Generators
M Krause, S Lucks - Citeseer
A set of Boolean functions is called a pseudorandom function generator (PRFG) if
communicating with a randomly chosen secret function from cannot be efficiently …
communicating with a randomly chosen secret function from cannot be efficiently …
On the Minimal Hardware Complexity of Pseudorandom Function Generators
M Krause, S Lucks - Proceedings of the 18th Annual Symposium on …, 2001 - dl.acm.org
A set F of Boolean functions is called a pseudorandom function generator (PRFG) if
communicating with a randomly chosen secret function from F cannot be efficiently …
communicating with a randomly chosen secret function from F cannot be efficiently …
On the Minimal Hardware Complexity of Pseudorandom Function Generators
M Krause, S Lucks - Edited by G. Goos, J. Hartmanis and J. van Leeuwen - Springer
A set F of Boolean functions is called a pseudorandom function generator (PRFG) if
communicating with a randomly chosen secret function from F cannot be efficiently …
communicating with a randomly chosen secret function from F cannot be efficiently …