Cryptography Verifiable Delay Functions from Supersingular Isogenies and Pairings

---

• Verifiable Delay Functions from Supersingular Isogenies and Pairings
• SaltShaker: Easily sign/verify/encrypt/decrypt messages with Nacl (tweetnacl) in Javascript. Also includes CryptoJS.
• Why do we use hashing algorithms without a security proof?

Verifiable Delay Functions from Supersingular Isogenies and Pairings Posted: 21 Feb 2019 12:15 AM PST submitted by /u/asanso [link] [comments]

SaltShaker: Easily sign/verify/encrypt/decrypt messages with Nacl (tweetnacl) in Javascript. Also includes CryptoJS. Posted: 20 Feb 2019 04:20 PM PST submitted by /u/realrasengan [link] [comments]

Why do we use hashing algorithms without a security proof? Posted: 20 Feb 2019 03:01 AM PST It seems that no common hashing algorithm has a security proof - we simply rely on there being no known way to break their security claims. History has shown we are usually wrong (MD5, SHA1). Instead, can't one make a provably secure hashing algorithm from a public-private key crypto scheme as follows: Break the input data up into chunks the size of the output hash Encrypt each chunk with a well-known public key, for which the private key has been thrown away. XOR all the chunks together (with some per-chunk minor transformation to prevent reordering) submitted by /u/londons_explorer [link] [comments]

You are subscribed to email updates from Cryptography news and discussions. To stop receiving these emails, you may unsubscribe now.	Email delivery powered by Google
Google, 1600 Amphitheatre Parkway, Mountain View, CA 94043, United States