what is the matlab code for follwing equation

3 次查看（过去 30 天）
rjnt Kaur
rjnt Kaur 2013-4-16
t=s^e(mod n)
u=m*m
c=(g^t)*r^m mod u

请先登录，再回答此问题。

回答（1 个）

Walter Roberson
Walter Roberson 2013-4-16
t = mod(s^e, n);
u = m*m;
c = mod((g^t) * r^m, u);
However! It is possible that the values you are working with, such as s^e, are going to (often) be too large to fit in 53 bits. If that is the case, then there are various number theory approaches that can be used to accurately calculate the mod. The details can depend upon whether s and n are mutually prime.
If you are working with cryptography or with prime numbers or with large numbers or with Galois Fields, or with CRCs, or with error-correcting polynomials, then you should probably not be using the straight-forward method I show above.

类别

在 Help Center 和 File Exchange 中查找有关 Encryption / Cryptography 的更多信息

标签

尚未输入任何标签。

Community Treasure Hunt

Find the treasures in MATLAB Central and discover how the community can help you!

Start Hunting!

Translated by