EXI is not just an XML compressor (though you can use it like that), it's API-compatible with XML so you're supposed to replace your XML processor with an EXI processor, not add extra steps.
Additionally it should be noted that there are many complexity classes other than just P and NP, and there are many X such that X > P and X > NP.
Just remember that using e.g. an X-complete problem for such an X as a basis for a cryptosystem means that decryption even with a key is going to be a hard problem.
If your cryptosystem has the property that an encrypted message has only one meaningful decryption, then P-decryptable implies NP-crackable.
The thing with OTP is that an encrypted message has several plausible decryptions, so OTP is unaffected, but most symmetric-key systems would definitely be affected.
Slashdot Mirror
No. It's
1. Generate Binary
2. Transmit Binary
3. Parse Binary
EXI is not just an XML compressor (though you can use it like that), it's API-compatible with XML so you're supposed to replace your XML processor with an EXI processor, not add extra steps.
Just remember that using e.g. an X-complete problem for such an X as a basis for a cryptosystem means that decryption even with a key is going to be a hard problem.
If your cryptosystem has the property that an encrypted message has only one meaningful decryption, then P-decryptable implies NP-crackable.
The thing with OTP is that an encrypted message has several plausible decryptions, so OTP is unaffected, but most symmetric-key systems would definitely be affected.
Of course factoring is in NP. It's just not (known to be) NP-complete. And many suspect it isn't, since it is in NP (intersect) co-NP.