Cryptographic hash functions

Results: 1068



#Item
1Cryptographic Hash Functions Part II Cryptography 1 Andreas Hülsing, TU/e Some slides by Sebastiaan de Hoogh, TU/e

Cryptographic Hash Functions Part II Cryptography 1 Andreas Hülsing, TU/e Some slides by Sebastiaan de Hoogh, TU/e

Add to Reading List

Source URL: www.hyperelliptic.org

Language: English - Date: 2016-09-29 20:50:51
    2How to Break MD5 and Other Hash Functions Xiaoyun Wang and Hongbo Yu Shandong University, Jinan, China, ,   Abstract. MD5 is one of the most widely used cryptographic hash funct

    How to Break MD5 and Other Hash Functions Xiaoyun Wang and Hongbo Yu Shandong University, Jinan, China, , Abstract. MD5 is one of the most widely used cryptographic hash funct

    Add to Reading List

    Source URL: merlot.usc.edu

    Language: English - Date: 2005-11-09 16:49:02
      3Cryptographic Hash Functions Part I Cryptography 1 Andreas Hülsing, TU/e Based on slides by Sebastiaan de Hoogh, TU/e

      Cryptographic Hash Functions Part I Cryptography 1 Andreas Hülsing, TU/e Based on slides by Sebastiaan de Hoogh, TU/e

      Add to Reading List

      Source URL: www.hyperelliptic.org

      Language: English - Date: 2016-09-29 20:50:51
        4GSMK CryptoPhone PSTN/1 Secure PSTN Landline Telephone TECHNICAL SPECIFICATIONS Telephone Line Interface Standard analog PSTN/POTS interface with

        GSMK CryptoPhone PSTN/1 Secure PSTN Landline Telephone TECHNICAL SPECIFICATIONS Telephone Line Interface Standard analog PSTN/POTS interface with

        Add to Reading List

        Source URL: www.cryptophone.de

        Language: English - Date: 2009-10-21 09:08:30
        5The Politics of Cryptography: Bitcoin and The Ordering Machines

        The Politics of Cryptography: Bitcoin and The Ordering Machines

        Add to Reading List

        Source URL: iqdupont.com

        Language: English - Date: 2015-12-03 10:50:31
        6Algorithms and Data Structures Winter TermExercises for UnitLet U = {0, 1, . . . , K − 1}, let p ≥ K be a prime number, and let 0 < t < K. For 0 ≤ a, b < p define

        Algorithms and Data Structures Winter TermExercises for UnitLet U = {0, 1, . . . , K − 1}, let p ≥ K be a prime number, and let 0 < t < K. For 0 ≤ a, b < p define

        Add to Reading List

        Source URL: www-tcs.cs.uni-sb.de

        Language: English - Date: 2016-03-06 16:06:05
        7The Politics of Cryptography: Bitcoin and The Ordering Machines

        The Politics of Cryptography: Bitcoin and The Ordering Machines

        Add to Reading List

        Source URL: www.iqdupont.com

        Language: English - Date: 2015-12-03 10:50:31
        8Why Simple Hash Functions Work: Exploiting the Entropy in a Data Stream∗ Michael Mitzenmacher† Salil Vadhan‡ School of Engineering & Applied Sciences Harvard University

        Why Simple Hash Functions Work: Exploiting the Entropy in a Data Stream∗ Michael Mitzenmacher† Salil Vadhan‡ School of Engineering & Applied Sciences Harvard University

        Add to Reading List

        Source URL: www.eecs.harvard.edu

        Language: English - Date: 2007-11-16 13:42:30