This is natural question because both integer factorization and discrete logarithm are the basis for the most popular public-key cryptography systems as of 2020 (RSA and Diffie-Hellman key exchange respectively), and both are NP-intermediate. Why not use something more provenly hard?
- cs.stackexchange.com/questions/356/why-hasnt-there-been-an-encryption-algorithm-that-is-based-on-the-known-np-hard "Why hasn't there been an encryption algorithm that is based on the known NP-Hard problems?"
Note that the subsequences do not need to be contiguous.
Implementations:
Holy fuck what a eye watering amount, $800k over 5 years as of 2025, this is exactly what Ciro Santilli would need to push forward OurBigBook! He also fits the requirements quite well, as a "creative person". For Americans or US residents only though, sad. Outdated requirement given the Internet age.
The school's model is to offer two hours of academic learning each day using "AI tutors", while the rest of the day is dedicated to developing life skills
The founding lady has several other interesting schools e.g. gt.school:Pretty awesome.
Bibliography:
There are unlisted articles, also show them or only show them.