Detail of message

Online Judge

Problem Set

Authors

Online Contests

User

Web Board
Home Page
F.A.Qs
Statistical Charts

Current Contest
Past Contests
Scheduled Contests
Award Contest

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:

Re:for p prime, B^(P-1)==1 (mod P), B^(P-2)==B^(-1) (mod P) (35) uni 2005-04-24 20:11:52
- Re:for p prime, B^(P-1)==1 (mod P), B^(P-2)==B^(-1) (mod P) (193) frkstyc 2005-04-24 20:18:48
  - Re:for p prime, B^(P-1)==1 (mod P), B^(P-2)==B^(-1) (mod P) (102) uni 2005-04-24 20:22:08
    - Re:for p prime, B^(P-1)==1 (mod P), B^(P-2)==B^(-1) (mod P) (79) frkstyc 2005-04-24 20:26:32
      - Re:for p prime, B^(P-1)==1 (mod P), B^(P-2)==B^(-1) (mod P) (36) uni 2005-04-24 20:31:43
        Re:for p prime, B^(P-1)==1 (mod P), B^(P-2)==B^(-1) (mod P) (49) frkstyc 2005-04-24 20:34:29
        Re:for p prime, B^(P-1)==1 (mod P), B^(P-2)==B^(-1) (mod P) (13) Sinya 2010-04-20 08:51:51

Post your reply here:

Home Page Go Back To top

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