/****h* silccrypt/SilcDH/silcdh.h
 *
 * NAME
 *
 * silcdh.h
 *
 * COPYRIGHT
 *
 * Author: Pekka Riikonen <priikone@poseidon.pspt.fi>
 *
 * Copyright (C) 2001 Pekka Riikonen
 *
 * This program is free software; you can redistribute it and/or modify
 * it under the terms of the GNU General Public License as published by
 * the Free Software Foundation; either version 2 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 General Public License for more details.
 *
 * DESCRIPTION
 *
 * PKCS #3 compliant Diffie Hellman key agreement protocol implementation.
 * This is used as part of SKE (SILC Key Exchange) protocol.
 ***/

#ifndef SILCDH_H
#define SILCDH_H

#include "silcmp.h"
#include "silcrng.h"

/****s* silccrypt/SilcDH/SilcDH
 *
 * NAME
 * 
 *    typedef struct SilcDHStruct *SilcDH;
 *
 * DESCRIPTION
 *
 *    This context is allocated by silc_dh_alloc and is given as argument
 *    to all silc_dh_* functions.  It is freed by silc_dh_free function.
 *
 ***/
typedef struct SilcDHStruct *SilcDH;

/* XXX Move to source file */
/* Diffie Hellman context. This includes the DH parameters including the
   negotiated key material. */
struct SilcDHStruct {
  SilcInt *g;             /* Global base (generator) */
  SilcInt *p;		  /* Global prime (modulus, prime) */
  SilcInt *lpf;		  /* Largest prime factor (prime) */
  SilcInt *my_x;       	  /* x, My private value (random) */
  SilcInt *my_y;       	  /* y, My public value (y = g ^ x mod p) */
  SilcInt *your_y;	  /* y', Your public value (y' = g ^ x' mod p) */
  SilcInt *z;		  /* The computed secret key (z = y' ^ x mod p) */

  SilcRng rng;		  /* RNG */
};

/****f* silccrypt/SilcDH/silc_dh_alloc
 *
 * SYNOPSIS
 *    
 *    SilcDH silc_dh_alloc(SilcRng rng, SilcInt *g, SilcInt *p, SilcInt *lpf);
 * 
 * DESCRIPTION
 *
 *    Allocate SilcDH context. The `rng' must be initialized random number 
 *    generator context, the `g' is the public base generator used in the 
 *    negotiation, the `p' is the public prime used in the negotiation and
 *    the `lpf' is largest prime factor of p defined publicly as well. The
 *    `lpf' is optional and if it is not supplied then the private values
 *    generated satifies 0 < x < p - 1 instead of 0 < x < lpf. Returns NULL
 *    on error or allocated SilcDH context on success. 
 *
 ***/
SilcDH silc_dh_alloc(SilcRng rng, SilcInt *g, SilcInt *p, SilcInt *lpf);

/****f* silccrypt/SilcDH/silc_dh_free
 *
 * SYNOPSIS
 *
 *    void silc_dh_free(SilcDH dh);
 *
 * DESCRIPTION
 *
 *    Frees the SilcDH context. Does not free the RNG context given in the 
 *    allocation. Frees all the allocated data inside the SilcDH context. 
 *
 ***/
void silc_dh_free(SilcDH dh);

/****f* silccrypt/SilcDH/silc_dh_generate_private
 *
 * SYNOPSIS
 *
 *    int silc_dh_generate_private(SilcDH dh, SilcInt **x);
 *
 * DESCRIPTION
 *
 *    Generates random private value `x' such that 0 < x < lpf at most of
 *    length of lpf. Returns FALSE if the random number could not be generated.
 *    Returns the generated value into `x' pointer sent as argument, unless
 *    the `x' is NULL. The returned `x' must no be freed by the caller. 
 *
 ***/
int silc_dh_generate_private(SilcDH dh, SilcInt **x);

/****f* silccrypt/SilcDH/silc_dh_compute_public
 *
 * SYNOPSIS
 *
 *    int silc_dh_compute_public(SilcDH dh, SilcInt **y);
 *
 * DESCRIPTION
 *
 *    Computes the public key y = g ^ x mod p, and returns it to the `y'
 *    pointer sent as argument, unless the `y' is NULL. Returns FALSE if
 *    the computation could not be performed. The returned `y' must not be
 *    freed by the caller. 
 *
 ***/
int silc_dh_compute_public(SilcDH dh, SilcInt **y);

/****f* silccrypt/SilcDH/silc_dh_remote_public
 *
 * SYNOPSIS
 *
 *    int silc_dh_compute_public(SilcDH dh, SilcInt **y);
 *
 * DESCRIPTION
 *
 *    Sets the remote end's public value y' into the SilcDH context.
 *    This must be done before computing the secret key. Returns FALSE 
 *    on error. 
 *
 ***/
int silc_dh_set_remote_public(SilcDH dh, SilcInt *y);

/****f* silccrypt/SilcDH/silc_dh_compute_key
 *
 * SYNOPSIS
 *
 *    int silc_dh_compute_key(SilcDH dh, SilcInt **z);
 *
 * DESCRIPTION
 *
 *    Computes the secret key z = y' ^ x mod p, and returns the key to the
 *    `z' pointer sent as argument, unless the `z' is NULL. Returns FALSE if
 *    the computation could not be performed. The returned `z' must not be
 *    freed by the caller. 
 *
 ***/
int silc_dh_compute_key(SilcDH dh, SilcInt **z);

/****f* silccrypt/SilcDH/silc_dh_remote_public
 *
 * SYNOPSIS
 *
 *    int silc_dh_compute_key_data(SilcDH dh, unsigned char **z, 
 *                                 uint32 *z_len);
 *
 * DESCRIPTION
 *
 *    Same as above but returns the computed secret key as octet binary
 *    string. 
 *
 ***/
int silc_dh_compute_key_data(SilcDH dh, unsigned char **z, 
			     uint32 *z_len);

#endif