|
|
вернуться в форумПоказать все сообщения Спрятать все сообщенияDoes it mean in this problem h==2 ? Edited by author 11.11.2017 13:13 There needn't h. Main problem is that , find x, where y = g^x mod p. It's common problem, named discrete logarithm. And there are some 64 bit modulo multiplications. |
|
|