mirror of
https://git.hardenedbsd.org/hardenedbsd/HardenedBSD.git
synced 2024-12-30 15:38:06 +01:00
d4af9e693f
I have worked hard to reduce diffs against the vendor branch. One notable change in that respect is that we no longer prefer DSA over RSA - the reasons for doing so went away years ago. This may cause some surprises, as ssh will warn about unknown host keys even for hosts whose keys haven't changed. MFC after: 6 weeks
74 lines
2.4 KiB
C
74 lines
2.4 KiB
C
/* $OpenBSD: dh.h,v 1.10 2008/06/26 09:19:40 djm Exp $ */
|
|
|
|
/*
|
|
* Copyright (c) 2000 Niels Provos. All rights reserved.
|
|
*
|
|
* Redistribution and use in source and binary forms, with or without
|
|
* modification, are permitted provided that the following conditions
|
|
* are met:
|
|
* 1. Redistributions of source code must retain the above copyright
|
|
* notice, this list of conditions and the following disclaimer.
|
|
* 2. Redistributions in binary form must reproduce the above copyright
|
|
* notice, this list of conditions and the following disclaimer in the
|
|
* documentation and/or other materials provided with the distribution.
|
|
*
|
|
* THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
|
|
* IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
|
|
* OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
|
|
* IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
|
|
* INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
|
|
* NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
|
|
* DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
|
|
* THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
|
|
* (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
|
|
* THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
|
|
*/
|
|
#ifndef DH_H
|
|
#define DH_H
|
|
|
|
struct dhgroup {
|
|
int size;
|
|
BIGNUM *g;
|
|
BIGNUM *p;
|
|
};
|
|
|
|
DH *choose_dh(int, int, int);
|
|
DH *dh_new_group_asc(const char *, const char *);
|
|
DH *dh_new_group(BIGNUM *, BIGNUM *);
|
|
DH *dh_new_group1(void);
|
|
DH *dh_new_group14(void);
|
|
|
|
void dh_gen_key(DH *, int);
|
|
int dh_pub_is_valid(DH *, BIGNUM *);
|
|
|
|
int dh_estimate(int);
|
|
|
|
#define DH_GRP_MIN 1024
|
|
#define DH_GRP_MAX 8192
|
|
|
|
/*
|
|
* Values for "type" field of moduli(5)
|
|
* Specifies the internal structure of the prime modulus.
|
|
*/
|
|
#define MODULI_TYPE_UNKNOWN (0)
|
|
#define MODULI_TYPE_UNSTRUCTURED (1)
|
|
#define MODULI_TYPE_SAFE (2)
|
|
#define MODULI_TYPE_SCHNORR (3)
|
|
#define MODULI_TYPE_SOPHIE_GERMAIN (4)
|
|
#define MODULI_TYPE_STRONG (5)
|
|
|
|
/*
|
|
* Values for "tests" field of moduli(5)
|
|
* Specifies the methods used in checking for primality.
|
|
* Usually, more than one test is used.
|
|
*/
|
|
#define MODULI_TESTS_UNTESTED (0x00)
|
|
#define MODULI_TESTS_COMPOSITE (0x01)
|
|
#define MODULI_TESTS_SIEVE (0x02)
|
|
#define MODULI_TESTS_MILLER_RABIN (0x04)
|
|
#define MODULI_TESTS_JACOBI (0x08)
|
|
#define MODULI_TESTS_ELLIPTIC (0x10)
|
|
|
|
|
|
#endif
|