usr.sbin/pppd/chap.h

   1 /*
   2  * chap.h - Challenge Handshake Authentication Protocol definitions.
   3  *
   4  * Copyright (c) 1993 The Australian National University.
   5  * All rights reserved.
   6  *
   7  * Redistribution and use in source and binary forms are permitted
   8  * provided that the above copyright notice and this paragraph are
   9  * duplicated in all such forms and that any documentation,
  10  * advertising materials, and other materials related to such
  11  * distribution and use acknowledge that the software was developed
  12  * by the Australian National University.  The name of the University
  13  * may not be used to endorse or promote products derived from this
  14  * software without specific prior written permission.
  15  * THIS SOFTWARE IS PROVIDED ``AS IS'' AND WITHOUT ANY EXPRESS OR
  16  * IMPLIED WARRANTIES, INCLUDING, WITHOUT LIMITATION, THE IMPLIED
  17  * WARRANTIES OF MERCHANTIBILITY AND FITNESS FOR A PARTICULAR PURPOSE.
  18  *
  19  * Copyright (c) 1991 Gregory M. Christy
  20  * All rights reserved.
  21  *
  22  * Redistribution and use in source and binary forms are permitted
  23  * provided that the above copyright notice and this paragraph are
  24  * duplicated in all such forms and that any documentation,
  25  * advertising materials, and other materials related to such
  26  * distribution and use acknowledge that the software was developed
  27  * by the author.
  28  *
  29  * THIS SOFTWARE IS PROVIDED ``AS IS'' AND WITHOUT ANY EXPRESS OR
  30  * IMPLIED WARRANTIES, INCLUDING, WITHOUT LIMITATION, THE IMPLIED
  31  * WARRANTIES OF MERCHANTIBILITY AND FITNESS FOR A PARTICULAR PURPOSE.
  32  *
  33  * $FreeBSD: src/usr.sbin/pppd/chap.h,v 1.7 1999/08/28 01:19:01 peter Exp $
  34  * $DragonFly: src/usr.sbin/pppd/chap.h,v 1.3 2003/11/03 19:31:40 eirikn Exp $
  35  */
  36
  37 #ifndef __CHAP_INCLUDE__
  38
  39 /* Code + ID + length */
  40 #define CHAP_HEADERLEN          4
  41
  42 /*
  43  * CHAP codes.
  44  */
  45
  46 #define CHAP_DIGEST_MD5         5       /* use MD5 algorithm */
  47 #define MD5_SIGNATURE_SIZE      16      /* 16 bytes in a MD5 message digest */
  48 #define CHAP_MICROSOFT          0x80    /* use Microsoft-compatible alg. */
  49 #define MS_CHAP_RESPONSE_LEN    49      /* Response length for MS-CHAP */
  50
  51 #define CHAP_CHALLENGE          1
  52 #define CHAP_RESPONSE           2
  53 #define CHAP_SUCCESS            3
  54 #define CHAP_FAILURE            4
  55
  56 /*
  57  *  Challenge lengths (for challenges we send) and other limits.
  58  */
  59 #define MIN_CHALLENGE_LENGTH    32
  60 #define MAX_CHALLENGE_LENGTH    64
  61 #define MAX_RESPONSE_LENGTH     64      /* sufficient for MD5 or MS-CHAP */
  62
  63 /*
  64  * Each interface is described by a chap structure.
  65  */
  66
  67 typedef struct chap_state {
  68     int unit;                   /* Interface unit number */
  69     int clientstate;            /* Client state */
  70     int serverstate;            /* Server state */
  71     u_char challenge[MAX_CHALLENGE_LENGTH]; /* last challenge string sent */
  72     u_char chal_len;            /* challenge length */
  73     u_char chal_id;             /* ID of last challenge */
  74     u_char chal_type;           /* hash algorithm for challenges */
  75     u_char id;                  /* Current id */
  76     char *chal_name;            /* Our name to use with challenge */
  77     int chal_interval;          /* Time until we challenge peer again */
  78     int timeouttime;            /* Timeout time in seconds */
  79     int max_transmits;          /* Maximum # of challenge transmissions */
  80     int chal_transmits;         /* Number of transmissions of challenge */
  81     int resp_transmits;         /* Number of transmissions of response */
  82     u_char response[MAX_RESPONSE_LENGTH];       /* Response to send */
  83     u_char resp_length;         /* length of response */
  84     u_char resp_id;             /* ID for response messages */
  85     u_char resp_type;           /* hash algorithm for responses */
  86     char *resp_name;            /* Our name to send with response */
  87 } chap_state;
  88
  89
  90 /*
  91  * Client (peer) states.
  92  */
  93 #define CHAPCS_INITIAL          0       /* Lower layer down, not opened */
  94 #define CHAPCS_CLOSED           1       /* Lower layer up, not opened */
  95 #define CHAPCS_PENDING          2       /* Auth us to peer when lower up */
  96 #define CHAPCS_LISTEN           3       /* Listening for a challenge */
  97 #define CHAPCS_RESPONSE         4       /* Sent response, waiting for status */
  98 #define CHAPCS_OPEN             5       /* We've received Success */
  99
 100 /*
 101  * Server (authenticator) states.
 102  */
 103 #define CHAPSS_INITIAL          0       /* Lower layer down, not opened */
 104 #define CHAPSS_CLOSED           1       /* Lower layer up, not opened */
 105 #define CHAPSS_PENDING          2       /* Auth peer when lower up */
 106 #define CHAPSS_INITIAL_CHAL     3       /* We've sent the first challenge */
 107 #define CHAPSS_OPEN             4       /* We've sent a Success msg */
 108 #define CHAPSS_RECHALLENGE      5       /* We've sent another challenge */
 109 #define CHAPSS_BADAUTH          6       /* We've sent a Failure msg */
 110
 111 /*
 112  * Timeouts.
 113  */
 114 #define CHAP_DEFTIMEOUT         3       /* Timeout time in seconds */
 115 #define CHAP_DEFTRANSMITS       10      /* max # times to send challenge */
 116
 117 extern chap_state chap[];
 118
 119 void ChapAuthWithPeer(int, char *, int);
 120 void ChapAuthPeer(int, char *, int);
 121
 122 extern struct protent chap_protent;
 123
 124 #define __CHAP_INCLUDE__
 125 #endif /* __CHAP_INCLUDE__ */