Arithmetic hash functions defined over prime fields have been actively developed and used in verifiable computation (VC) protocols. Among those, ellipticcurve- based SNARKs require large (256-bit and higher) primes. Such hash functions are notably slow, losing a factor of up to 1000 compared to regu...
Research Assistant
AI chat, annotations, notes & similar papers
No comments yet
Be the first to share your thoughts!