38 followers
@CryptoOrrDun Yes for the indistinguishable obfuscation, by writing the lexicographically first equivalent code. This is even efficient assuming P=NP. (proven by https://t.co/q928WQLXTG)
@CryptoOrrDun Yes for the indistinguishable obfuscation, by writing the lexicographically first equivalent code. This is even efficient assuming P=NP. (proven by https://t.co/q928WQLXTG)
@sampullara ooh, add these types of algo to you requirements. http://t.co/jYPJBnc8 http://t.co/TBX2ead9 http://t.co/hWLKizFa