Zero Knowledge cover image

Sean Bowe on SNARKs, Trusted Setups & Elliptic Curve Cryptography

Zero Knowledge

00:00

Creating and Optimizing a Collision Resistant Hash Function Based on an Elliptic Curve Discrete Logarithm Problem

This chapter discusses the creation and optimization of a collision resistant hash function based on an elliptic curve discrete logarithm problem, used for Merkle trees in ZKASH. The speaker shares insights on optimizing the function and credits another person for clever contributions.

Transcript
Play full episode

The AI-powered Podcast Player

Save insights by tapping your headphones, chat with episodes, discover the best highlights - and more!
App store bannerPlay store banner
Get the app