NonNative Arithmetic via CRT Codes

>> YOUR LINK HERE: ___ http://youtube.com/watch?v=OucSo6xjlBQ

Non-native arithmetic is an important and costly operation in SNARKs. It is essential for proving validity of general cryptographic data like RSA signatures, non-native elliptic curve arithmetic like secp256r1, and general SNARK proof composition. We investigate a new approach to prove non-native integer arithmetic using Residue Number Systems and a batch proximity test for Chinese Remainder Theorem (CRT) codes, as well as surprising connections to STARK soundness. • Speaker(s): Liam Eagen • Skill level: Expert • Track: Applied Cryptography • Keywords: Cryptography, SNARK, Zero-Knowledge • Follow us: / efdevcon , / ethereum , https://warpcast.com/devcon • Learn more about devcon: https://www.devcon.org/ • Learn more about ethereum: https://ethereum.org/ • Visit the https://archive.devcon.org/ to gain access to the entire library of Devcon talks with the ease of filtering, playlists, personalized suggestions, decentralized access on Swarm, IPFS and more. • Devcon is the Ethereum conference for developers, researchers, thinkers, and makers. • Devcon SEA was held in Bangkok, Thailand on Nov 12 - Nov 15, 2024. • Devcon is organized and presented by the Ethereum Foundation. To find out more, please visit https://ethereum.foundation/

#############################

New on site