YAARX: Yet Another ARX Toolkit  0.1
 All Data Structures Files Functions Variables Macros Pages
max-adp-arx.hh
Go to the documentation of this file.
1 /*
2  * Copyright (c) 2012-2013 Luxembourg University,
3  * Laboratory of Algorithmics, Cryptology and Security (LACS).
4  *
5  * This file is part of the YAARX toolkit. YAARX stands for
6  * Yet Another ARX toolkit for analysis of ARX cryptographic algorithms.
7  *
8  * YAARX is free software: you can redistribute it and/or modify
9  * it under the terms of the GNU General Public License as published by
10  * the Free Software Foundation, either version 3 of the License, or
11  * (at your option) any later version.
12  *
13  * YAARX is distributed in the hope that it will be useful,
14  * but WITHOUT ANY WARRANTY; without even the implied warranty of
15  * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
16  * GNU General Public License for more details.
17  *
18  * You should have received a copy of the GNU General Public License
19  * along with YAARX. If not, see <http://www.gnu.org/licenses/>.
20  */
27 #ifndef MAX_ADP_ARX_H
28 #define MAX_ADP_ARX_H
29 
30 void max_adp_arx_bounds_0(uint32_t k, const uint32_t n, const uint32_t lrot_const,
31  double* p, uint32_t* de,
32  gsl_matrix* A[2][2][2][2], gsl_vector* B[ADP_ARX_NISTATES][WORD_SIZE + 1], gsl_vector* C[ADP_ARX_NISTATES],
33  const uint32_t dc, const uint32_t dd, uint32_t* de_max, double* p_max);
34 
35 void max_adp_arx_bounds_i(uint32_t k, const uint32_t n, const uint32_t lrot_const,
36  double* p, uint32_t* de,
37  gsl_matrix* A[2][2][2][2], gsl_vector* B[WORD_SIZE + 1], gsl_vector* C,
38  const uint32_t dc, const uint32_t dd, uint32_t* de_max, double* p_max);
39 
40 void max_adp_arx_bounds(gsl_matrix* A[2][2][2][2], gsl_vector* B[ADP_ARX_NISTATES][WORD_SIZE + 1],
41  const uint32_t lrot_const,
42  const uint32_t dc, const uint32_t dd, uint32_t* de_max);
43 
44 double max_adp_arx(gsl_matrix* A[2][2][2][2], const uint32_t lrot_const,
45  const uint32_t da, const uint32_t db, const uint32_t dd, uint32_t* de_max);
46 
47 
48 void max_adp_arx_print_bounds(gsl_vector* B[ADP_ARX_NISTATES][WORD_SIZE + 1]);
49 
50 
51 double max_adp_arx_exper(gsl_matrix* A[2][2][2][2], const uint32_t lrot_const,
52  const uint32_t da, const uint32_t db, const uint32_t dd, uint32_t* de_max);
53 
54 #endif // #ifndef MAX_ADP_ARX_H
void max_adp_arx_bounds_i(uint32_t k, const uint32_t n, const uint32_t lrot_const, double *p, uint32_t *de, gsl_matrix *A[2][2][2][2], gsl_vector *B[WORD_SIZE+1], gsl_vector *C, const uint32_t dc, const uint32_t dd, uint32_t *de_max, double *p_max)
Definition: max-adp-arx.cc:193
double max_adp_arx(gsl_matrix *A[2][2][2][2], const uint32_t lrot_const, const uint32_t da, const uint32_t db, const uint32_t dd, uint32_t *de_max)
Definition: max-adp-arx.cc:365
#define WORD_SIZE
Definition: common.hh:119
double max_adp_arx_exper(gsl_matrix *A[2][2][2][2], const uint32_t lrot_const, const uint32_t da, const uint32_t db, const uint32_t dd, uint32_t *de_max)
Definition: max-adp-arx.cc:455
void max_adp_arx_bounds_0(uint32_t k, const uint32_t n, const uint32_t lrot_const, double *p, uint32_t *de, gsl_matrix *A[2][2][2][2], gsl_vector *B[ADP_ARX_NISTATES][WORD_SIZE+1], gsl_vector *C[ADP_ARX_NISTATES], const uint32_t dc, const uint32_t dd, uint32_t *de_max, double *p_max)
Definition: max-adp-arx.cc:89
#define ADP_ARX_NISTATES
Definition: adp-arx.hh:60
void max_adp_arx_bounds(gsl_matrix *A[2][2][2][2], gsl_vector *B[ADP_ARX_NISTATES][WORD_SIZE+1], const uint32_t lrot_const, const uint32_t dc, const uint32_t dd, uint32_t *de_max)
Definition: max-adp-arx.cc:295
void max_adp_arx_print_bounds(gsl_vector *B[ADP_ARX_NISTATES][WORD_SIZE+1])
Definition: max-adp-arx.cc:332