hirifumi mikage / EthernetNetIf

EthernetNetIf

Dependents:   XBee_WiFi_EA_LPC4088

lwip/netif/ppp/chap.h@0:62580107d20c, 2014-11-19 (annotated)

Committer:
hmike
Date:
Wed Nov 19 12:00:42 2014 +0000
Revision:
0:62580107d20c
EthernetNetIf

Who changed what in which revision?

UserRevisionLine numberNew contents of line
hmike 0:62580107d20c 1 /*****************************************************************************
hmike 0:62580107d20c 2 * chap.h - Network Challenge Handshake Authentication Protocol header file.
hmike 0:62580107d20c 3 *
hmike 0:62580107d20c 4 * Copyright (c) 2003 by Marc Boucher, Services Informatiques (MBSI) inc.
hmike 0:62580107d20c 5 * portions Copyright (c) 1998 Global Election Systems Inc.
hmike 0:62580107d20c 6 *
hmike 0:62580107d20c 7 * The authors hereby grant permission to use, copy, modify, distribute,
hmike 0:62580107d20c 8 * and license this software and its documentation for any purpose, provided
hmike 0:62580107d20c 9 * that existing copyright notices are retained in all copies and that this
hmike 0:62580107d20c 10 * notice and the following disclaimer are included verbatim in any
hmike 0:62580107d20c 11 * distributions. No written agreement, license, or royalty fee is required
hmike 0:62580107d20c 12 * for any of the authorized uses.
hmike 0:62580107d20c 13 *
hmike 0:62580107d20c 14 * THIS SOFTWARE IS PROVIDED BY THE CONTRIBUTORS *AS IS* AND ANY EXPRESS OR
hmike 0:62580107d20c 15 * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
hmike 0:62580107d20c 16 * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
hmike 0:62580107d20c 17 * IN NO EVENT SHALL THE CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT,
hmike 0:62580107d20c 18 * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
hmike 0:62580107d20c 19 * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
hmike 0:62580107d20c 20 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
hmike 0:62580107d20c 21 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
hmike 0:62580107d20c 22 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
hmike 0:62580107d20c 23 * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
hmike 0:62580107d20c 24 *
hmike 0:62580107d20c 25 ******************************************************************************
hmike 0:62580107d20c 26 * REVISION HISTORY
hmike 0:62580107d20c 27 *
hmike 0:62580107d20c 28 * 03-01-01 Marc Boucher <marc@mbsi.ca>
hmike 0:62580107d20c 29 * Ported to lwIP.
hmike 0:62580107d20c 30 * 97-12-03 Guy Lancaster <lancasterg@acm.org>, Global Election Systems Inc.
hmike 0:62580107d20c 31 * Original built from BSD network code.
hmike 0:62580107d20c 32 ******************************************************************************/
hmike 0:62580107d20c 33 /*
hmike 0:62580107d20c 34 * chap.h - Challenge Handshake Authentication Protocol definitions.
hmike 0:62580107d20c 35 *
hmike 0:62580107d20c 36 * Copyright (c) 1993 The Australian National University.
hmike 0:62580107d20c 37 * All rights reserved.
hmike 0:62580107d20c 38 *
hmike 0:62580107d20c 39 * Redistribution and use in source and binary forms are permitted
hmike 0:62580107d20c 40 * provided that the above copyright notice and this paragraph are
hmike 0:62580107d20c 41 * duplicated in all such forms and that any documentation,
hmike 0:62580107d20c 42 * advertising materials, and other materials related to such
hmike 0:62580107d20c 43 * distribution and use acknowledge that the software was developed
hmike 0:62580107d20c 44 * by the Australian National University. The name of the University
hmike 0:62580107d20c 45 * may not be used to endorse or promote products derived from this
hmike 0:62580107d20c 46 * software without specific prior written permission.
hmike 0:62580107d20c 47 * THIS SOFTWARE IS PROVIDED ``AS IS'' AND WITHOUT ANY EXPRESS OR
hmike 0:62580107d20c 48 * IMPLIED WARRANTIES, INCLUDING, WITHOUT LIMITATION, THE IMPLIED
hmike 0:62580107d20c 49 * WARRANTIES OF MERCHANTIBILITY AND FITNESS FOR A PARTICULAR PURPOSE.
hmike 0:62580107d20c 50 *
hmike 0:62580107d20c 51 * Copyright (c) 1991 Gregory M. Christy
hmike 0:62580107d20c 52 * All rights reserved.
hmike 0:62580107d20c 53 *
hmike 0:62580107d20c 54 * Redistribution and use in source and binary forms are permitted
hmike 0:62580107d20c 55 * provided that the above copyright notice and this paragraph are
hmike 0:62580107d20c 56 * duplicated in all such forms and that any documentation,
hmike 0:62580107d20c 57 * advertising materials, and other materials related to such
hmike 0:62580107d20c 58 * distribution and use acknowledge that the software was developed
hmike 0:62580107d20c 59 * by the author.
hmike 0:62580107d20c 60 *
hmike 0:62580107d20c 61 * THIS SOFTWARE IS PROVIDED ``AS IS'' AND WITHOUT ANY EXPRESS OR
hmike 0:62580107d20c 62 * IMPLIED WARRANTIES, INCLUDING, WITHOUT LIMITATION, THE IMPLIED
hmike 0:62580107d20c 63 * WARRANTIES OF MERCHANTIBILITY AND FITNESS FOR A PARTICULAR PURPOSE.
hmike 0:62580107d20c 64 *
hmike 0:62580107d20c 65 * $Id: chap.h,v 1.6 2010/01/24 13:19:34 goldsimon Exp $
hmike 0:62580107d20c 66 */
hmike 0:62580107d20c 67
hmike 0:62580107d20c 68 #ifndef CHAP_H
hmike 0:62580107d20c 69 #define CHAP_H
hmike 0:62580107d20c 70
hmike 0:62580107d20c 71 /* Code + ID + length */
hmike 0:62580107d20c 72 #define CHAP_HEADERLEN 4
hmike 0:62580107d20c 73
hmike 0:62580107d20c 74 /*
hmike 0:62580107d20c 75 * CHAP codes.
hmike 0:62580107d20c 76 */
hmike 0:62580107d20c 77
hmike 0:62580107d20c 78 #define CHAP_DIGEST_MD5 5 /* use MD5 algorithm */
hmike 0:62580107d20c 79 #define MD5_SIGNATURE_SIZE 16 /* 16 bytes in a MD5 message digest */
hmike 0:62580107d20c 80 #define CHAP_MICROSOFT 0x80 /* use Microsoft-compatible alg. */
hmike 0:62580107d20c 81 #define MS_CHAP_RESPONSE_LEN 49 /* Response length for MS-CHAP */
hmike 0:62580107d20c 82
hmike 0:62580107d20c 83 #define CHAP_CHALLENGE 1
hmike 0:62580107d20c 84 #define CHAP_RESPONSE 2
hmike 0:62580107d20c 85 #define CHAP_SUCCESS 3
hmike 0:62580107d20c 86 #define CHAP_FAILURE 4
hmike 0:62580107d20c 87
hmike 0:62580107d20c 88 /*
hmike 0:62580107d20c 89 * Challenge lengths (for challenges we send) and other limits.
hmike 0:62580107d20c 90 */
hmike 0:62580107d20c 91 #define MIN_CHALLENGE_LENGTH 32
hmike 0:62580107d20c 92 #define MAX_CHALLENGE_LENGTH 64
hmike 0:62580107d20c 93 #define MAX_RESPONSE_LENGTH 64 /* sufficient for MD5 or MS-CHAP */
hmike 0:62580107d20c 94
hmike 0:62580107d20c 95 /*
hmike 0:62580107d20c 96 * Each interface is described by a chap structure.
hmike 0:62580107d20c 97 */
hmike 0:62580107d20c 98
hmike 0:62580107d20c 99 typedef struct chap_state {
hmike 0:62580107d20c 100 int unit; /* Interface unit number */
hmike 0:62580107d20c 101 int clientstate; /* Client state */
hmike 0:62580107d20c 102 int serverstate; /* Server state */
hmike 0:62580107d20c 103 u_char challenge[MAX_CHALLENGE_LENGTH]; /* last challenge string sent */
hmike 0:62580107d20c 104 u_char chal_len; /* challenge length */
hmike 0:62580107d20c 105 u_char chal_id; /* ID of last challenge */
hmike 0:62580107d20c 106 u_char chal_type; /* hash algorithm for challenges */
hmike 0:62580107d20c 107 u_char id; /* Current id */
hmike 0:62580107d20c 108 char *chal_name; /* Our name to use with challenge */
hmike 0:62580107d20c 109 int chal_interval; /* Time until we challenge peer again */
hmike 0:62580107d20c 110 int timeouttime; /* Timeout time in seconds */
hmike 0:62580107d20c 111 int max_transmits; /* Maximum # of challenge transmissions */
hmike 0:62580107d20c 112 int chal_transmits; /* Number of transmissions of challenge */
hmike 0:62580107d20c 113 int resp_transmits; /* Number of transmissions of response */
hmike 0:62580107d20c 114 u_char response[MAX_RESPONSE_LENGTH]; /* Response to send */
hmike 0:62580107d20c 115 u_char resp_length; /* length of response */
hmike 0:62580107d20c 116 u_char resp_id; /* ID for response messages */
hmike 0:62580107d20c 117 u_char resp_type; /* hash algorithm for responses */
hmike 0:62580107d20c 118 char *resp_name; /* Our name to send with response */
hmike 0:62580107d20c 119 } chap_state;
hmike 0:62580107d20c 120
hmike 0:62580107d20c 121
hmike 0:62580107d20c 122 /*
hmike 0:62580107d20c 123 * Client (peer) states.
hmike 0:62580107d20c 124 */
hmike 0:62580107d20c 125 #define CHAPCS_INITIAL 0 /* Lower layer down, not opened */
hmike 0:62580107d20c 126 #define CHAPCS_CLOSED 1 /* Lower layer up, not opened */
hmike 0:62580107d20c 127 #define CHAPCS_PENDING 2 /* Auth us to peer when lower up */
hmike 0:62580107d20c 128 #define CHAPCS_LISTEN 3 /* Listening for a challenge */
hmike 0:62580107d20c 129 #define CHAPCS_RESPONSE 4 /* Sent response, waiting for status */
hmike 0:62580107d20c 130 #define CHAPCS_OPEN 5 /* We've received Success */
hmike 0:62580107d20c 131
hmike 0:62580107d20c 132 /*
hmike 0:62580107d20c 133 * Server (authenticator) states.
hmike 0:62580107d20c 134 */
hmike 0:62580107d20c 135 #define CHAPSS_INITIAL 0 /* Lower layer down, not opened */
hmike 0:62580107d20c 136 #define CHAPSS_CLOSED 1 /* Lower layer up, not opened */
hmike 0:62580107d20c 137 #define CHAPSS_PENDING 2 /* Auth peer when lower up */
hmike 0:62580107d20c 138 #define CHAPSS_INITIAL_CHAL 3 /* We've sent the first challenge */
hmike 0:62580107d20c 139 #define CHAPSS_OPEN 4 /* We've sent a Success msg */
hmike 0:62580107d20c 140 #define CHAPSS_RECHALLENGE 5 /* We've sent another challenge */
hmike 0:62580107d20c 141 #define CHAPSS_BADAUTH 6 /* We've sent a Failure msg */
hmike 0:62580107d20c 142
hmike 0:62580107d20c 143 extern chap_state chap[];
hmike 0:62580107d20c 144
hmike 0:62580107d20c 145 void ChapAuthWithPeer (int, char *, u_char);
hmike 0:62580107d20c 146 void ChapAuthPeer (int, char *, u_char);
hmike 0:62580107d20c 147
hmike 0:62580107d20c 148 extern struct protent chap_protent;
hmike 0:62580107d20c 149
hmike 0:62580107d20c 150 #endif /* CHAP_H */