Zero Knowledge cover image

Sean Bowe on SNARKs, Trusted Setups & Elliptic Curve Cryptography

Zero Knowledge

CHAPTER

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.

00:00
Transcript
Play full episode

Remember Everything You Learn from Podcasts

Save insights instantly, chat with episodes, and build lasting knowledge - all powered by AI.
App store bannerPlay store banner