并且它一本正经对现有知识的复述也是荒谬的，比如：

How Euler's theorem plays in RSA cryptography system?

Euler's theorem is used in RSA cryptography to calculate the private key from the public key. Specifically, it is used to calculate the decryption exponent d, which is used in the RSA decryption algorithm. This is done by finding the multiplicative inverse of the encryption exponent e modulo the totient of n. Euler's theorem states that if a and n are relatively prime, then a^φ(n) ≡ 1 mod n, where φ(n) is the totient of n. Therefore, the multiplicative inverse of a modulo n can be found by calculating a^(φ(n) -1) mod n, which is the same as d.

这说明它说的任何话都不可信，也就是说这个系统不是 sound 的。
这东西完全不能通过图灵测试。
--
FROM 188.67.137.*