File: ecc.h

package info (click to toggle)
seccure 0.5-2
  • links: PTS, VCS
  • area: main
  • in suites: bookworm, bullseye, buster, forky, sid, trixie
  • size: 268 kB
  • sloc: ansic: 2,236; xml: 192; makefile: 100
file content (96 lines) | stat: -rw-r--r-- 3,182 bytes parent folder | download | duplicates (2)
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
/*
 *  seccure  -  Copyright 2014 B. Poettering
 *
 *  This program is free software; you can redistribute it and/or
 *  modify it under the terms of the GNU Lesser General Public License
 *  as published by the Free Software Foundation; either version 3 of
 *  the License, or (at your option) any later version.
 *
 *  This program is distributed in the hope that it will be useful,
 *  but WITHOUT ANY WARRANTY; without even the implied warranty of
 *  MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
 *  Lesser General Public License for more details.
 *
 *  You should have received a copy of the GNU Lesser General Public
 *  License along with this program. If not, see
 *  <http://www.gnu.org/licenses/>.
 */

/* 
 *   SECCURE Elliptic Curve Crypto Utility for Reliable Encryption
 *
 *              http://point-at-infinity.org/seccure/
 *
 *
 * seccure implements a selection of asymmetric algorithms based on  
 * elliptic curve cryptography (ECC). See the manpage or the project's  
 * homepage for further details.
 *
 * This code links against the GNU gcrypt library "libgcrypt" (which
 * is part of the GnuPG project). Use the included Makefile to build
 * the binary.
 * 
 * Report bugs to: seccure AT point-at-infinity.org
 *
 */

#ifndef INC_ECC_H
#define INC_ECC_H

#include <gcrypt.h>

struct affine_point {
  gcry_mpi_t x, y;
};

struct jacobian_point {
  gcry_mpi_t x, y, z;
};

struct domain_params {
  gcry_mpi_t a, b, m, order;
  struct affine_point base;
  int cofactor;
};

struct affine_point point_new(void);
void point_release(struct affine_point *p);
void point_set(struct affine_point *p1, const struct affine_point *p2);
void point_load_zero(struct affine_point *p);
int point_is_zero(const struct affine_point *p);
int point_on_curve(const struct affine_point *p, 
		   const struct domain_params *dp);
int point_compress(const struct affine_point *p);
int point_decompress(struct affine_point *p, const gcry_mpi_t x, int yflag,
		     const struct domain_params *dp);
void point_double(struct affine_point *p, const struct domain_params *dp);
void point_add(struct affine_point *p1, const struct affine_point *p2,
	       const struct domain_params *dp);


struct jacobian_point jacobian_new(void);
void jacobian_release(struct jacobian_point *p);
void jacobian_load_affine(struct jacobian_point *p1,
			  const struct affine_point *p2);
void jacobian_load_zero(struct jacobian_point *p);
int jacobian_is_zero(const struct jacobian_point *p);
void jacobian_double(struct jacobian_point *p, const struct domain_params *dp);
void jacobian_affine_point_add(struct jacobian_point *p1, 
			       const struct affine_point *p2,
			       const struct domain_params *dp);
struct affine_point jacobian_to_affine(const struct jacobian_point *p,
				       const struct domain_params *dp);


struct affine_point pointmul(const struct affine_point *p,
			     const gcry_mpi_t exp, 
			     const struct domain_params *dp);


int embedded_key_validation(const struct affine_point *p,
			    const struct domain_params *dp);
int full_key_validation(const struct affine_point *p,
			const struct domain_params *dp);


#endif /* INC_ECC_H */