sasa ivkovic / Mbed 2 deprecated LAN

testing of combination of LCS and LAN

Dependencies:   mbed

EthernetNetIf/LPC1768/lwip/netif/ppp/chap.h@0:a7a6a692162f, 2015-01-14 (annotated)

Committer:
damir
Date:
Wed Jan 14 13:29:55 2015 +0000
Revision:
0:a7a6a692162f
Test of LAN

Who changed what in which revision?

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