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:26:32 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:22:08

现在大数因数分解几乎都是O(exp(sqrt(lnN * lnlnN)))的Quadratic Sieve和NFS了，John Pollard的ms比较少用。

Followed by:

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