- one time LB-VRF scheme
- implement a basic scheme
- use crt to compress vrf outputs
- implement NTT to accelerate polynomial multiplications
- better serialization to reduce sizes
- use Montgomery representations to further improve performance
- use HNF secrets
- many time VRF scheme
- decide which long term signature scheme we want to use
- implement scheme
- (a lot) more tests
- zeroize memory
- constant time implementation (seems not required)
- documentation
zhenfeizhang / lb-vrf Goto Github PK
View Code? Open in Web Editor NEWA rust implementation of lattice based verifiable random function