Online JudgeProblem SetAuthorsOnline ContestsUser
Web Board
Home Page
F.A.Qs
Statistical Charts
Problems
Submit Problem
Online Status
Prob.ID:
Register
Update your info
Authors ranklist
Current Contest
Past Contests
Scheduled Contests
Award Contest
User ID:
Password:
  Register

Re:for p prime, B^(P-1)==1 (mod P), B^(P-2)==B^(-1) (mod P)

Posted by frkstyc at 2005-04-24 20:05:35 on Problem 2417
In Reply To:Re:for p prime, B^(P-1)==1 (mod P), B^(P-2)==B^(-1) (mod P) Posted by:uni at 2005-04-24 20:01:21
我想是不可能了,离散对数就是因为难算才拿去加密解密用的,要是O(logN)就可以算出来的话,Turing能拿不?Nobel有机会吗?还是先去解了某个阔佬公司的密,看看它有什么秘密?

Followed by:

Post your reply here:
User ID:
Password:
Title:

Content:

Home Page   Go Back  To top


All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di
Any problem, Please Contact Administrator