1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
|
// Copyright(c)'1994-2009 by The Givaro group
// This file is part of Givaro.
// Givaro is governed by the CeCILL-B license under French law
// and abiding by the rules of distribution of free software.
// see the COPYRIGHT file for more details.
/*! @file examples/Integer/RSA_breaking.C
* @ingroup examples
* @ingroup integers
* @example examples/Integer/RSA_breaking.C
* @brief NO DOC
*/
#include <iostream>
using namespace std;
#define GIVARO_LENSTRA
#include "givaro/givintrsa.h"
#include "givaro/givtimer.h"
using namespace Givaro;
int main(int argc, char** argv)
{
Timer tim;
tim.clear();
IntRSADom<>::Element m,k,u;
if (argc > 1)
m = IntRSADom<>::Element( argv[1] );
else
cin >> m;
if (argc > 2)
k = IntRSADom<>::Element( argv[2] );
else
cin >> k;
IntRSADom<> IR(m,k);
tim.start();
IR.point_break(u);
tim.stop();
/* For a factored output :
IR.write( cerr << "m=pq: ", IR.getm()) ;
IR.write( cerr << ", cipher k: " , IR.getk()) << " ----> decipering key: " ;
IR.write( cout, u ) << endl;
*/
// Unfactored output
cerr << "n=pq: " << IR.getn() << ", cipher key: " << IR.gete() << " ----> decipering key: ";
cout << u << endl;
cerr << tim << endl;
return 0;
}
/* -*- mode: C++; tab-width: 4; indent-tabs-mode: nil; c-basic-offset: 4 -*- */
// vim:sts=4:sw=4:ts=4:et:sr:cino=>s,f0,{0,g0,(0,\:0,t0,+0,=s
|
