herrDeng網內搜尋
自訂搜尋
Ads
2015年12月11日 星期五
2015年12月10日 星期四
RSA cipher解密
解回明文
import java.math.BigInteger;
public class ex2 {
public static void main(String[] args) {
BigInteger n=new BigInteger("5375388922978628413155272656747327652336395530199103021900839849090732075550437233179766702787100243937175380405082366985570014906877346763928089904752147");
BigInteger d=new BigInteger("3562336077709646293856410845969831535184737018515713275359421306058446640504285015571117411667368274571293441355632153687264610437891764149716318547851669");
BigInteger c=new BigInteger("4646214319130296784626336389218304062490256344497824318351606042291236051054052316596982428177153055110734920639810028422212513692377137973131254994553255");
}
}
訂閱:
意見 (Atom)
熱門文章
-
url="https://www.twse.com.tw/exchangeReport/STOCK_DAY?response=json&date=20220330&stockNo=2330"
-
py3 cpp Line sweep解Leetcode 3346 Maximum Frequency of an Element After Performing Operations I 使用 line sweep不用排序,可得線性解 [Py3解請進]
-
連續複利
-
C++ py3 C Rust adjacent difference與loop速解Leetcode 1526 Minimum Number of Increments on Subarrays to Form a Target Array [Py3一行解請進]
-
Py3 C++導出遞迴公式解難題Leetcode1611 Minimum One Bit Operations to Make Integers Zero從導出公式到寫出code,一次完成解Leetcode難題 [C++一行解請進]
-
int a[]={21, 23, 57, 13 ,17, 6}; float average; average=?
-
C++ Py3 Euclidean Algorithm解Leetcode 2169 Count Operations to Obtain Zero [Py3一行解請進]