#pqc

All I need is to write the decode+decompress module, copy the NTT to vector multiplication to Inverse NTT scheme, and an compress+encode module for the final 256 bit message. And we are done. It will be about 6k logic elements (I tend to over estimate to give myself a wider margin :P) I can write it as a separate module and worry about encryption+decryption integration later.

It's not as much of a clusterfrick as encryption where a total of 1+k multiplications should be done. Only k number of multiplications :D slightly less data managing headache?

It’s called AffixIO. Short version: it answers yes/no questions about a person (are they over 18, are they a licensed whatever, do they qualify for X) without ever storing or seeing their actual data.

Longer version: most “age verification” or “eligibility check” systems work by holding onto your ID, your date of birth, your documents, somewhere on a server. That’s a liability sitting there waiting to leak. AffixIO does it differently. It generates a signed proof token, a cryptographic yes or no, and then forgets everything. No PII retention. It can even work offline.

It also runs on post-quantum cryptography (ML-DSA-65 specifically), which matters more than it sounds like it should. A lot of encryption in use today will eventually be breakable by quantum computers. Anything encrypted now and stored could be harvested and decrypted later. Post-quantum standards are built to survive that. The US just mandated ML-DSA-65 across federal agencies, so this isn’t a niche concern anymore.