1-out-of-2 Oblivious Transfer
All submissions for this problem are available.
Fig.1 - 1-out-of-2 Oblivious Transfer
Given N = 100000000000000000000097319999999999999999996772987, and e = 7913584268521,
Find the private key d of Alice.
Submit the private key d.
Info about Submission
You just have to print the final answer. Rest you have to put the source code/ abstract of your solution inside the comments for plagiarism checking.
Sample Submission (c++)
using namespace std;
/* Put your source code here inside comments for plagiarism checking */
|Time Limit:||1 sec|
|Source Limit:||50000 Bytes|
|Languages:||C, CPP14, JAVA, PYTH, PYTH 3.6, CS2, PAS fpc, PAS gpc, RUBY, PHP, NODEJS, SCALA, PERL, JS, PERL6, PYP3|
Fetching successful submissions
If you are still having problems, see a sample solution here.