Skip to main content

4 Result(s)

within Stefan Lucks Remove this filter Mathematics of Computing Remove this filter

and

  1. No Access

    Article

    POEx: A beyond-birthday-bound-secure on-line cipher

    On-line ciphers are convenient building blocks for realizing efficient single- pass encryption. In particular, the trend to limit the consequences of nonce reuses rendered them popular in recent authenticated ...

    Christian Forler, Eik List, Stefan Lucks, Jakob Wenzel in Cryptography and Communications (2018)

  2. Chapter and Conference Paper

    Memory-Demanding Password Scrambling

    Most of the common password scramblers hinder password-guessing attacks by “key stretching”, e.g., by iterating a cryptographic hash function many times. With the increasing availability of cheap and massively...

    Christian Forler, Stefan Lucks, Jakob Wenzel in Advances in Cryptology – ASIACRYPT 2014 (2014)

    Download PDF (316 KB)

  3. No Access

    Book and Conference Proceedings

    Research in Cryptology

    Second Western European Workshop, WEWoRC 2007, Bochum, Germany, July 4-6, 2007, Revised Selected Papers

    Stefan Lucks, Ahmad-Reza Sadeghi, Christopher Wolf in Lecture Notes in Computer Science (2008)

  4. No Access

    Chapter and Conference Paper

    On the Minimal Hardware Complexity of Pseudorandom Function Generators

    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 distinguished from communicating with a tru...

    Matthias Krause, Stefan Lucks in STACS 2001 (2001)