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
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
|
/*
Copyright 2008-2021 by
Laboratoire de l'Informatique du Parallelisme,
UMR CNRS - ENS Lyon - UCB Lyon 1 - INRIA 5668,
LORIA (CNRS, INPL, INRIA, UHP, U-Nancy 2),
Centre de recherche INRIA Sophia Antipolis Mediterranee,
Equipes APICS, FACTAS,
Sophia Antipolis, France.
and by
Laboratoire d'Informatique de Paris 6 - Équipe PEQUAN
Sorbonne Universités
UPMC Univ Paris 06
UMR 7606, LIP6
Boîte Courrier 169
4, place Jussieu
F-75252 Paris Cedex 05
France
Contributors Ch. Lauter, S. Chevillard
christoph.lauter@christoph-lauter.org
sylvain.chevillard@ens-lyon.org
This software is a computer program whose purpose is to provide an
environment for safe floating-point code development. It is
particularly targeted to the automated implementation of
mathematical floating-point libraries (libm). Amongst other features,
it offers a certified infinity norm, an automatic polynomial
implementer and a fast Remez algorithm.
This software is governed by the CeCILL-C license under French law and
abiding by the rules of distribution of free software. You can use,
modify and/ or redistribute the software under the terms of the CeCILL-C
license as circulated by CEA, CNRS and INRIA at the following URL
"http://www.cecill.info".
As a counterpart to the access to the source code and rights to copy,
modify and redistribute granted by the license, users are provided only
with a limited warranty and the software's author, the holder of the
economic rights, and the successive licensors have only limited
liability.
In this respect, the user's attention is drawn to the risks associated
with loading, using, modifying and/or developing or reproducing the
software by the user in light of its specific status of free software,
that may mean that it is complicated to manipulate, and that also
herefore means that it is reserved for developers and experienced
professionals having in-depth computer knowledge. Users are therefore
encouraged to load and test the software's suitability as regards their
requirements in conditions enabling the security of their systems and/or
data to be ensured and, more generally, to use and operate it in the
same conditions as regards security.
The fact that you are presently reading this means that you have had
knowledge of the CeCILL-C license and that you accept its terms.
This program is distributed WITHOUT ANY WARRANTY; without even the
implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.
*/
#ifdef HAVE_CONFIG_H
#include "config.h"
#endif
#undef malloc
#undef realloc
#ifdef HAVE_SPECIAL_FPLLL_INCLUDE
#if HAVE_SPECIAL_FPLLL_INCLUDE
#include <fplll/fplll.h>
#else
#include <fplll.h>
#endif
#else
#include <fplll.h>
#endif
#include <gmp.h>
#define coeff(i,j,n) ((i)-1)*(n)+(j)-1
/* Considering a matrix of nbpoints+1 x dim+1 rational numbers, performs the
LLL reduction of the matrix (seen as a basis of row vectors) and returns the
last reduced vector (which is hence a nbpoints+1 array of mpq_t).
reducedVect is supposed to point to a large enough segment of allocated and
already initialized mpq_t
*/
#ifdef HAVE_FPLLL_OLD_API
#if HAVE_FPLLL_OLD_API
extern "C" void fplll_wrapper(mpq_t *reducedVect, mpq_t *exactMatrix, int dim, int nbpoints) {
int i,j;
ZZ_mat<mpz_t> * FPlllMat;
Z_NR<mpz_t> zval;
wrapper *LLLwrapper;
mpz_t mpzval;
mpz_init(mpzval);
FPlllMat = new ZZ_mat<mpz_t>(dim+1,nbpoints+1);
for(j=1; j<=dim+1; j++) {
for(i=1; i<=nbpoints+1; i++) {
mpz_set_q(mpzval, exactMatrix[coeff(i,j,dim+1)]); /* Casts M[i,j] into a mpz_t */
zval.set(mpzval);
FPlllMat->Set(j-1,i-1,zval);
}
}
// LLL reduction
LLLwrapper = new wrapper(FPlllMat);
LLLwrapper->LLL();
// Converting all stuff into exact numbers
for(i=1; i<=nbpoints+1; i++) {
mpq_set_z(reducedVect[i-1], LLLwrapper->GetBase()->Get(dim, i-1).GetData());
}
// Cleaning
delete FPlllMat;
delete LLLwrapper;
mpz_clear(mpzval);
return;
}
#else /* New API */
using namespace fplll;
extern "C" void fplll_wrapper(mpq_t *reducedVect, mpq_t *exactMatrix, int dim, int nbpoints) {
int i,j;
ZZ_mat<mpz_t> * FPlllMat;
Z_NR<mpz_t> zval;
mpz_t mpzval;
mpz_init(mpzval);
FPlllMat = new ZZ_mat<mpz_t>(dim+1,nbpoints+1);
for(j=1; j<=dim+1; j++) {
for(i=1; i<=nbpoints+1; i++) {
mpz_set_q(mpzval, exactMatrix[coeff(i,j,dim+1)]); /* Casts M[i,j] into a mpz_t */
zval = mpzval;
(*FPlllMat)[j-1][i-1] = zval;
}
}
// LLL reduction
lll_reduction(*FPlllMat);
// Converting all stuff into exact numbers
for(i=1; i<=nbpoints+1; i++) {
mpq_set_z(reducedVect[i-1], (*FPlllMat)[dim][i-1].get_data());
// mpq_set_z(reducedVect[i-1], LLLwrapper->GetBase()->Get(dim, i-1).GetData());
}
// Cleaning
delete FPlllMat;
mpz_clear(mpzval);
return;
}
#endif /* #ifdef HAVE_FPLLL_OLD_API */
#else
/* This case should not happen */
extern "C" void fplll_wrapper(mpq_t *reducedVect, mpq_t *exactMatrix, int dim, int nbpoints) {
return;
}
#endif /* #if HAVE_FPLLL_OLD_API */
|
