Using a well-known result of polynomial over the finite field p , we show that the Euler-Fermat theorem holds inN [x]. We present a multi-dimension RSA cryptosystem and point out that low exponent algorithm of attacki...Using a well-known result of polynomial over the finite field p , we show that the Euler-Fermat theorem holds inN [x]. We present a multi-dimension RSA cryptosystem and point out that low exponent algorithm of attacking RSA is not suitable for the multi-dimension RSA. Therefore, it is believed that the security of the new cryptosystem is mainly based on the factorization of large integers.展开更多
文摘Using a well-known result of polynomial over the finite field p , we show that the Euler-Fermat theorem holds inN [x]. We present a multi-dimension RSA cryptosystem and point out that low exponent algorithm of attacking RSA is not suitable for the multi-dimension RSA. Therefore, it is believed that the security of the new cryptosystem is mainly based on the factorization of large integers.
