2 * radius.c Functions to send/receive radius packets.
6 * This library is free software; you can redistribute it and/or
7 * modify it under the terms of the GNU Lesser General Public
8 * License as published by the Free Software Foundation; either
9 * version 2.1 of the License, or (at your option) any later version.
11 * This library is distributed in the hope that it will be useful,
12 * but WITHOUT ANY WARRANTY; without even the implied warranty of
13 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
14 * Lesser General Public License for more details.
16 * You should have received a copy of the GNU Lesser General Public
17 * License along with this library; if not, write to the Free Software
18 * Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301, USA
20 * Copyright 2000-2003,2006 The FreeRADIUS server project
23 #include <freeradius-devel/ident.h>
26 #include <freeradius-devel/libradius.h>
27 #include <freeradius-devel/md5.h>
33 #include <freeradius-devel/udpfromto.h>
41 * The RFC says 4096 octets max, and most packets are less than 256.
43 #define MAX_PACKET_LEN 4096
46 * The maximum number of attributes which we allow in an incoming
47 * request. If there are more attributes than this, the request
50 * This helps to minimize the potential for a DoS, when an
51 * attacker spoofs Access-Request packets, which don't have a
52 * Message-Authenticator attribute. This means that the packet
53 * is unsigned, and the attacker can use resources on the server,
54 * even if the end request is rejected.
56 int fr_max_attributes = 0;
57 FILE *fr_log_fp = NULL;
59 typedef struct radius_packet_t {
63 uint8_t vector[AUTH_VECTOR_LEN];
67 static fr_randctx fr_rand_pool; /* across multiple calls */
68 static int fr_rand_initialized = 0;
69 static unsigned int salt_offset = 0;
71 const char *fr_packet_codes[FR_MAX_PACKET_CODE] = {
77 "Accounting-Response",
93 "Resource-Free-Request",
94 "Resource-Free-Response",
95 "Resource-Query-Request",
96 "Resource-Query-Response",
97 "Alternate-Resource-Reclaim-Request",
99 "NAS-Reboot-Response",
112 "Disconnect-Request",
122 "IP-Address-Allocate",
127 void fr_printf_log(const char *fmt, ...)
132 if ((fr_debug_flag == 0) || !fr_log_fp) {
137 vfprintf(fr_log_fp, fmt, ap);
143 static void print_hex(RADIUS_PACKET *packet)
147 if (!packet->data) return;
149 printf(" Code:\t\t%u\n", packet->data[0]);
150 printf(" Id:\t\t%u\n", packet->data[1]);
151 printf(" Length:\t%u\n", ((packet->data[2] << 8) |
153 printf(" Vector:\t");
154 for (i = 4; i < 20; i++) {
155 printf("%02x", packet->data[i]);
159 if (packet->data_len > 20) {
164 total = packet->data_len - 20;
165 ptr = packet->data + 20;
171 if (total < 2) { /* too short */
172 printf("%02x\n", *ptr);
176 if (ptr[1] > total) { /* too long */
177 for (i = 0; i < total; i++) {
178 printf("%02x ", ptr[i]);
183 printf("%02x %02x ", ptr[0], ptr[1]);
184 attrlen = ptr[1] - 2;
188 for (i = 0; i < attrlen; i++) {
189 if ((i > 0) && ((i & 0x0f) == 0x00))
191 printf("%02x ", ptr[i]);
192 if ((i & 0x0f) == 0x0f) printf("\n");
195 if ((attrlen & 0x0f) != 0x00) printf("\n");
206 * Wrapper for sendto which handles sendfromto, IPv6, and all
207 * possible combinations.
209 static int rad_sendto(int sockfd, void *data, size_t data_len, int flags,
210 fr_ipaddr_t *src_ipaddr, int src_port,
211 fr_ipaddr_t *dst_ipaddr, int dst_port)
213 struct sockaddr_storage dst;
214 socklen_t sizeof_dst;
216 #ifdef WITH_UDPFROMTO
217 struct sockaddr_storage src;
218 socklen_t sizeof_src;
220 fr_ipaddr2sockaddr(src_ipaddr, src_port, &src, &sizeof_src);
222 src_port = src_port; /* -Wunused */
225 if (!fr_ipaddr2sockaddr(dst_ipaddr, dst_port, &dst, &sizeof_dst)) {
229 #ifdef WITH_UDPFROMTO
231 * Only IPv4 is supported for udpfromto.
233 * And if they don't specify a source IP address, don't
236 if ((dst_ipaddr->af == AF_INET) ||
237 (src_ipaddr->af != AF_UNSPEC)) {
238 return sendfromto(sockfd, data, data_len, flags,
239 (struct sockaddr *)&src, sizeof_src,
240 (struct sockaddr *)&dst, sizeof_dst);
243 src_ipaddr = src_ipaddr; /* -Wunused */
247 * No udpfromto, OR an IPv6 socket, fail gracefully.
249 return sendto(sockfd, data, data_len, flags,
250 (struct sockaddr *) &dst, sizeof_dst);
254 void rad_recv_discard(int sockfd)
257 struct sockaddr_storage src;
258 socklen_t sizeof_src = sizeof(src);
260 recvfrom(sockfd, header, sizeof(header), 0,
261 (struct sockaddr *)&src, &sizeof_src);
265 ssize_t rad_recv_header(int sockfd, fr_ipaddr_t *src_ipaddr, int *src_port,
268 ssize_t data_len, packet_len;
270 struct sockaddr_storage src;
271 socklen_t sizeof_src = sizeof(src);
273 data_len = recvfrom(sockfd, header, sizeof(header), MSG_PEEK,
274 (struct sockaddr *)&src, &sizeof_src);
276 if ((errno == EAGAIN) || (errno == EINTR)) return 0;
281 * Too little data is available, discard the packet.
284 recvfrom(sockfd, header, sizeof(header), 0,
285 (struct sockaddr *)&src, &sizeof_src);
288 } else { /* we got 4 bytes of data. */
290 * See how long the packet says it is.
292 packet_len = (header[2] * 256) + header[3];
295 * The length in the packet says it's less than
296 * a RADIUS header length: discard it.
298 if (packet_len < AUTH_HDR_LEN) {
299 recvfrom(sockfd, header, sizeof(header), 0,
300 (struct sockaddr *)&src, &sizeof_src);
304 * Enforce RFC requirements, for sanity.
305 * Anything after 4k will be discarded.
307 } else if (packet_len > MAX_PACKET_LEN) {
308 recvfrom(sockfd, header, sizeof(header), 0,
309 (struct sockaddr *)&src, &sizeof_src);
315 * Convert AF. If unknown, discard packet.
317 if (!fr_sockaddr2ipaddr(&src, sizeof_src, src_ipaddr, src_port)) {
318 recvfrom(sockfd, header, sizeof(header), 0,
319 (struct sockaddr *)&src, &sizeof_src);
326 * The packet says it's this long, but the actual UDP
327 * size could still be smaller.
334 * wrapper for recvfrom, which handles recvfromto, IPv6, and all
335 * possible combinations.
337 static ssize_t rad_recvfrom(int sockfd, uint8_t **pbuf, int flags,
338 fr_ipaddr_t *src_ipaddr, uint16_t *src_port,
339 fr_ipaddr_t *dst_ipaddr, uint16_t *dst_port)
341 struct sockaddr_storage src;
342 struct sockaddr_storage dst;
343 socklen_t sizeof_src = sizeof(src);
344 socklen_t sizeof_dst = sizeof(dst);
351 memset(&src, 0, sizeof_src);
352 memset(&dst, 0, sizeof_dst);
355 * Get address family, etc. first, so we know if we
356 * need to do udpfromto.
358 * FIXME: udpfromto also does this, but it's not
359 * a critical problem.
361 if (getsockname(sockfd, (struct sockaddr *)&dst,
362 &sizeof_dst) < 0) return -1;
365 * Read the length of the packet, from the packet.
366 * This lets us allocate the buffer to use for
367 * reading the rest of the packet.
369 data_len = recvfrom(sockfd, header, sizeof(header), MSG_PEEK,
370 (struct sockaddr *)&src, &sizeof_src);
372 if ((errno == EAGAIN) || (errno == EINTR)) return 0;
377 * Too little data is available, discard the packet.
380 recvfrom(sockfd, header, sizeof(header), flags,
381 (struct sockaddr *)&src, &sizeof_src);
384 } else { /* we got 4 bytes of data. */
386 * See how long the packet says it is.
388 len = (header[2] * 256) + header[3];
391 * The length in the packet says it's less than
392 * a RADIUS header length: discard it.
394 if (len < AUTH_HDR_LEN) {
395 recvfrom(sockfd, header, sizeof(header), flags,
396 (struct sockaddr *)&src, &sizeof_src);
400 * Enforce RFC requirements, for sanity.
401 * Anything after 4k will be discarded.
403 } else if (len > MAX_PACKET_LEN) {
404 recvfrom(sockfd, header, sizeof(header), flags,
405 (struct sockaddr *)&src, &sizeof_src);
414 * Receive the packet. The OS will discard any data in the
415 * packet after "len" bytes.
417 #ifdef WITH_UDPFROMTO
418 if (dst.ss_family == AF_INET) {
419 data_len = recvfromto(sockfd, buf, len, flags,
420 (struct sockaddr *)&src, &sizeof_src,
421 (struct sockaddr *)&dst, &sizeof_dst);
425 * No udpfromto, OR an IPv6 socket. Fail gracefully.
427 data_len = recvfrom(sockfd, buf, len, flags,
428 (struct sockaddr *)&src, &sizeof_src);
434 if (!fr_sockaddr2ipaddr(&src, sizeof_src, src_ipaddr, &port)) {
436 return -1; /* Unknown address family, Die Die Die! */
440 fr_sockaddr2ipaddr(&dst, sizeof_dst, dst_ipaddr, &port);
444 * Different address families should never happen.
446 if (src.ss_family != dst.ss_family) {
452 * Tell the caller about the data
460 #define AUTH_PASS_LEN (AUTH_VECTOR_LEN)
461 /*************************************************************************
463 * Function: make_secret
465 * Purpose: Build an encrypted secret value to return in a reply
466 * packet. The secret is hidden by xoring with a MD5 digest
467 * created from the shared secret and the authentication
468 * vector. We put them into MD5 in the reverse order from
469 * that used when encrypting passwords to RADIUS.
471 *************************************************************************/
472 static void make_secret(uint8_t *digest, const uint8_t *vector,
473 const char *secret, const uint8_t *value)
478 fr_MD5Init(&context);
479 fr_MD5Update(&context, vector, AUTH_VECTOR_LEN);
480 fr_MD5Update(&context, (const uint8_t *) secret, strlen(secret));
481 fr_MD5Final(digest, &context);
483 for ( i = 0; i < AUTH_VECTOR_LEN; i++ ) {
484 digest[i] ^= value[i];
488 #define MAX_PASS_LEN (128)
489 static void make_passwd(uint8_t *output, size_t *outlen,
490 const uint8_t *input, size_t inlen,
491 const char *secret, const uint8_t *vector)
493 FR_MD5_CTX context, old;
494 uint8_t digest[AUTH_VECTOR_LEN];
495 uint8_t passwd[MAX_PASS_LEN];
500 * If the length is zero, round it up.
504 if (len > MAX_PASS_LEN) len = MAX_PASS_LEN;
506 memcpy(passwd, input, len);
507 memset(passwd + len, 0, sizeof(passwd) - len);
513 else if ((len & 0x0f) != 0) {
519 fr_MD5Init(&context);
520 fr_MD5Update(&context, (const uint8_t *) secret, strlen(secret));
526 fr_MD5Update(&context, vector, AUTH_PASS_LEN);
528 for (n = 0; n < len; n += AUTH_PASS_LEN) {
531 fr_MD5Update(&context,
532 passwd + n - AUTH_PASS_LEN,
536 fr_MD5Final(digest, &context);
537 for (i = 0; i < AUTH_PASS_LEN; i++) {
538 passwd[i + n] ^= digest[i];
542 memcpy(output, passwd, len);
545 static void make_tunnel_passwd(uint8_t *output, size_t *outlen,
546 const uint8_t *input, size_t inlen, size_t room,
547 const char *secret, const uint8_t *vector)
549 FR_MD5_CTX context, old;
550 uint8_t digest[AUTH_VECTOR_LEN];
551 uint8_t passwd[MAX_STRING_LEN + AUTH_VECTOR_LEN];
558 if (room > 253) room = 253;
561 * Account for 2 bytes of the salt, and round the room
562 * available down to the nearest multiple of 16. Then,
563 * subtract one from that to account for the length byte,
564 * and the resulting number is the upper bound on the data
567 * We could short-cut this calculation just be forcing
568 * inlen to be no more than 239. It would work for all
569 * VSA's, as we don't pack multiple VSA's into one
572 * However, this calculation is more general, if a little
573 * complex. And it will work in the future for all possible
574 * kinds of weird attribute packing.
577 room -= (room & 0x0f);
580 if (inlen > room) inlen = room;
583 * Length of the encrypted data is password length plus
584 * one byte for the length of the password.
587 if ((len & 0x0f) != 0) {
591 *outlen = len + 2; /* account for the salt */
594 * Copy the password over.
596 memcpy(passwd + 3, input, inlen);
597 memset(passwd + 3 + inlen, 0, sizeof(passwd) - 3 - inlen);
600 * Generate salt. The RFC's say:
602 * The high bit of salt[0] must be set, each salt in a
603 * packet should be unique, and they should be random
605 * So, we set the high bit, add in a counter, and then
606 * add in some CSPRNG data. should be OK..
608 passwd[0] = (0x80 | ( ((salt_offset++) & 0x0f) << 3) |
610 passwd[1] = fr_rand();
611 passwd[2] = inlen; /* length of the password string */
613 fr_MD5Init(&context);
614 fr_MD5Update(&context, (const uint8_t *) secret, strlen(secret));
617 fr_MD5Update(&context, vector, AUTH_VECTOR_LEN);
618 fr_MD5Update(&context, &passwd[0], 2);
620 for (n = 0; n < len; n += AUTH_PASS_LEN) {
623 fr_MD5Update(&context,
624 passwd + 2 + n - AUTH_PASS_LEN,
628 fr_MD5Final(digest, &context);
629 for (i = 0; i < AUTH_PASS_LEN; i++) {
630 passwd[i + 2 + n] ^= digest[i];
633 memcpy(output, passwd, len + 2);
637 * Returns the end of the data.
639 static int vp2data(const RADIUS_PACKET *packet, const RADIUS_PACKET *original,
640 const char *secret, const VALUE_PAIR *vp, uint8_t *start,
646 uint8_t *ptr = start;
650 * Set up the default sources for the data.
652 data = vp->vp_octets;
659 case PW_TYPE_IPV6ADDR:
660 case PW_TYPE_IPV6PREFIX:
661 case PW_TYPE_ABINARY:
662 /* nothing more to do */
666 len = 1; /* just in case */
667 array[0] = vp->vp_integer & 0xff;
672 len = 2; /* just in case */
673 array[0] = (vp->vp_integer >> 8) & 0xff;
674 array[1] = vp->vp_integer & 0xff;
678 case PW_TYPE_INTEGER:
679 len = 4; /* just in case */
680 lvalue = htonl(vp->vp_integer);
681 memcpy(array, &lvalue, sizeof(lvalue));
686 data = (const uint8_t *) &vp->vp_ipaddr;
687 len = 4; /* just in case */
691 * There are no tagged date attributes.
694 lvalue = htonl(vp->vp_date);
695 data = (const uint8_t *) &lvalue;
696 len = 4; /* just in case */
703 len = 4; /* just in case */
704 slvalue = htonl(vp->vp_signed);
705 memcpy(array, &slvalue, sizeof(slvalue));
712 fr_strerror_printf("ERROR: Cannot encode NULL TLV");
715 if (vp->length > room) return 0; /* can't chop TLVs to fit */
718 default: /* unknown type: ignore it */
719 fr_strerror_printf("ERROR: Unknown attribute type %d", vp->type);
724 * Bound the data to the calling size
726 if (len > room) len = room;
729 * Encrypt the various password styles
731 * Attributes with encrypted values MUST be less than
734 switch (vp->flags.encrypt) {
735 case FLAG_ENCRYPT_USER_PASSWORD:
736 make_passwd(ptr, &len, data, len,
737 secret, packet->vector);
740 case FLAG_ENCRYPT_TUNNEL_PASSWORD:
742 * Check if there's enough room. If there isn't,
743 * we discard the attribute.
745 * This is ONLY a problem if we have multiple VSA's
746 * in one Vendor-Specific, though.
748 if (room < 19) return 0;
750 switch (packet->code) {
751 case PW_AUTHENTICATION_ACK:
752 case PW_AUTHENTICATION_REJECT:
753 case PW_ACCESS_CHALLENGE:
756 fr_strerror_printf("ERROR: No request packet, cannot encrypt %s attribute in the vp.", vp->name);
759 ptr[0] = vp->flags.tag;
760 make_tunnel_passwd(ptr + 1, &len, data, len - 1, room,
761 secret, original->vector);
763 case PW_ACCOUNTING_REQUEST:
764 case PW_DISCONNECT_REQUEST:
766 ptr[0] = vp->flags.tag;
767 make_tunnel_passwd(ptr + 1, &len, data, len - 1, room,
768 secret, packet->vector);
774 * The code above ensures that this attribute
777 case FLAG_ENCRYPT_ASCEND_SECRET:
778 make_secret(ptr, packet->vector, secret, data);
779 len = AUTH_VECTOR_LEN;
784 if (vp->flags.has_tag && TAG_VALID(vp->flags.tag)) {
785 if (vp->type == PW_TYPE_STRING) {
786 if (len > (room - 1)) len = room - 1;
787 ptr[0] = vp->flags.tag;
789 } else if (vp->type == PW_TYPE_INTEGER) {
790 array[0] = vp->flags.tag;
791 } /* else it can't be any other type */
793 memcpy(ptr, data, len);
795 } /* switch over encryption flags */
797 return len + (ptr - start);;
801 static int rad_vp2rfc(const RADIUS_PACKET *packet,
802 const RADIUS_PACKET *original,
803 const char *secret, const VALUE_PAIR *vp,
804 unsigned int attribute, uint8_t *ptr, size_t room)
808 if (room < 2) return 0;
810 ptr[0] = attribute & 0xff; /* NOT vp->attribute */
813 len = vp2data(packet, original, secret, vp, ptr + 2, room - 2);
814 if (len < 0) return len;
823 * Parse a data structure into a RADIUS attribute.
825 int rad_vp2attr(const RADIUS_PACKET *packet, const RADIUS_PACKET *original,
826 const char *secret, const VALUE_PAIR *vp, uint8_t *start,
830 int len, total_length;
832 uint8_t *ptr, *length_ptr, *vsa_length_ptr, *tlv_length_ptr;
833 uint8_t *sub_length_ptr; /* evil */
836 vendorcode = total_length = 0;
837 length_ptr = vsa_length_ptr = tlv_length_ptr = sub_length_ptr = NULL;
840 * For interoperability, always put vendor attributes
841 * into their own VSA.
843 if ((vendorcode = vp->vendor) == 0) {
844 len = rad_vp2rfc(packet, original, secret, vp,
845 vp->attribute, start, room);
846 if (len < 0) return -1;
849 * RFC 2865 section 5 says that zero-length
850 * attributes MUST NOT be sent.
852 * ... and the WiMAX forum ignores
853 * this... because of one vendor. Don't they
854 * have anything better to do with their time?
857 (vp->attribute != PW_CHARGEABLE_USER_IDENTITY)) return 0;
865 DICT_VENDOR *dv = dict_vendorbyvalue(vendorcode);
868 * This must be an RFC-format attribute. If it
869 * wasn't, then the "decode" function would have
870 * made a Vendor-Specific attribute (i.e. type
871 * 26), and we would have "vendorcode == 0" here.
875 vsa_llen = dv->length;
876 if (dv->flags) vsa_offset = 1;
879 if (room < (6 + vsa_tlen + vsa_llen + vsa_offset)) return 0;
880 room -= 6 + vsa_tlen + vsa_llen + vsa_offset;
883 * Build a VSA header.
885 *ptr++ = PW_VENDOR_SPECIFIC;
886 vsa_length_ptr = ptr;
888 lvalue = htonl(vendorcode);
889 memcpy(ptr, &lvalue, 4);
895 ptr[0] = (vp->attribute & 0xFF);
899 ptr[0] = ((vp->attribute >> 8) & 0xFF);
900 ptr[1] = (vp->attribute & 0xFF);
906 ptr[2] = ((vp->attribute >> 8) & 0xFF);
907 ptr[3] = (vp->attribute & 0xFF);
911 return 0; /* silently discard it */
917 length_ptr = vsa_length_ptr;
918 vsa_length_ptr = NULL;
927 length_ptr = ptr + 1;
931 return 0; /* silently discard it */
936 * Allow for some continuation.
943 * Ignore TLVs that don't have data, OR
944 * have too much data to fit in the
945 * packet, OR have too much data to fit
948 * This shouldn't happen in normal
949 * operation, as the code assumes that
950 * the "tlv" type shouldn't be used.
952 if (vp->flags.has_tlv &&
953 (!vp->vp_tlv || (vp->length > room) ||
956 * 6 + 1 (vsa_tlen) + 1 (vsa_llen)
959 (vp->length > (255 - 9)))) return 0;
963 * sub-TLV's can only be in one format.
965 if (vp->flags.is_tlv) {
966 if (room < 2) return 0;
969 *(ptr++) = (vp->attribute & 0xff00) >> 8;
970 tlv_length_ptr = ptr;
975 * WiMAX is like sticking knitting
976 * needles up your nose, and claiming
979 if ((vp->attribute & 0xff0000) != 0) {
980 *(ptr++) = (vp->attribute >> 16) & 0xff;
981 sub_length_ptr = ptr;
984 *tlv_length_ptr += 2;
989 total_length += vsa_tlen + vsa_llen + vsa_offset;
990 if (vsa_length_ptr) *vsa_length_ptr += vsa_tlen + vsa_llen + vsa_offset;
991 *length_ptr += vsa_tlen + vsa_llen + vsa_offset;
994 len = vp2data(packet, original, secret, vp, ptr, room);
995 if (len < 0) return len;
998 * Update the various lengths.
1001 if (vsa_length_ptr) *vsa_length_ptr += len;
1002 if (tlv_length_ptr) *tlv_length_ptr += len;
1003 if (sub_length_ptr) *sub_length_ptr += len;
1005 total_length += len;
1007 return total_length; /* of attribute */
1013 #define REORDER(x) ((x & 0xff00) << 8) | ((x & 0xff0000) >> 8) | ((x & 0xff000000 >> 24))
1015 static int rad_encode_wimax(const RADIUS_PACKET *packet,
1016 const RADIUS_PACKET *original,
1017 const char *secret, VALUE_PAIR *reply,
1018 uint8_t *start, size_t room)
1020 int len, total_len = 0;
1021 uint8_t *wimax = NULL;
1022 uint8_t *ptr = start;
1024 VALUE_PAIR *vp = reply;
1027 * Swap the order of the WiMAX hacks, to make later
1028 * comparisons easier.
1030 maxattr = REORDER(vp->attribute);
1033 len = rad_vp2attr(packet, original, secret, vp, ptr,
1034 (start + room) - ptr);
1035 if (len <= 0) return total_len;
1038 * After adding an attribute with the simplest encoding,
1039 * check to see if we can append it to the previous one.
1042 if ((wimax[1] + (ptr[1] - 6)) <= 255) {
1046 memmove(ptr, ptr + 9, hack);
1052 * See if we can nest sub-TLVs, too, in
1053 * order to shorten the encoding.
1057 wimax[8] = 0x80; /* set continuation */
1067 vp->flags.encoded = 1;
1071 * Look at the NEXT tlv. Ensure that we encode
1072 * attributes into a common VSA *only* if they are for
1073 * the same WiMAX VSA, AND if the TLVs are in numerically
1076 if (vp && vp->flags.is_tlv && (reply->vendor == vp->vendor) &&
1077 ((reply->attribute & 0xff) == (vp->attribute & 0xff))) {
1080 attr = REORDER(vp->attribute);
1081 if (attr >= maxattr) {
1094 int rad_encode(RADIUS_PACKET *packet, const RADIUS_PACKET *original,
1097 radius_packet_t *hdr;
1099 uint16_t total_length;
1103 char ip_buffer[128];
1106 * A 4K packet, aligned on 64-bits.
1108 uint64_t data[MAX_PACKET_LEN / sizeof(uint64_t)];
1110 if ((packet->code > 0) && (packet->code < FR_MAX_PACKET_CODE)) {
1111 what = fr_packet_codes[packet->code];
1116 DEBUG("Sending %s of id %d to %s port %d\n",
1118 inet_ntop(packet->dst_ipaddr.af,
1119 &packet->dst_ipaddr.ipaddr,
1120 ip_buffer, sizeof(ip_buffer)),
1124 * Double-check some things based on packet code.
1126 switch (packet->code) {
1127 case PW_AUTHENTICATION_ACK:
1128 case PW_AUTHENTICATION_REJECT:
1129 case PW_ACCESS_CHALLENGE:
1131 fr_strerror_printf("ERROR: Cannot sign response packet without a request packet.");
1137 * These packet vectors start off as all zero.
1139 case PW_ACCOUNTING_REQUEST:
1140 case PW_DISCONNECT_REQUEST:
1141 case PW_COA_REQUEST:
1142 memset(packet->vector, 0, sizeof(packet->vector));
1150 * Use memory on the stack, until we know how
1151 * large the packet will be.
1153 hdr = (radius_packet_t *) data;
1156 * Build standard header
1158 hdr->code = packet->code;
1159 hdr->id = packet->id;
1161 memcpy(hdr->vector, packet->vector, sizeof(hdr->vector));
1163 total_length = AUTH_HDR_LEN;
1166 * Load up the configuration values for the user
1172 * FIXME: Loop twice over the reply list. The first time,
1173 * calculate the total length of data. The second time,
1174 * allocate the memory, and fill in the VP's.
1176 * Hmm... this may be slower than just doing a small
1181 * Loop over the reply attributes for the packet.
1183 for (reply = packet->vps; reply; reply = reply->next) {
1185 * Ignore non-wire attributes
1187 if ((reply->vendor == 0) &&
1188 ((reply->attribute & 0xFFFF) > 0xff)) {
1191 * Permit the admin to send BADLY formatted
1192 * attributes with a debug build.
1194 if (reply->attribute == PW_RAW_ATTRIBUTE) {
1195 memcpy(ptr, reply->vp_octets, reply->length);
1196 len = reply->length;
1204 * Set the Message-Authenticator to the correct
1205 * length and initial value.
1207 if (reply->attribute == PW_MESSAGE_AUTHENTICATOR) {
1208 reply->length = AUTH_VECTOR_LEN;
1209 memset(reply->vp_strvalue, 0, AUTH_VECTOR_LEN);
1212 * Cache the offset to the
1213 * Message-Authenticator
1215 packet->offset = total_length;
1219 * Print out ONLY the attributes which
1220 * we're sending over the wire, and print
1221 * them out BEFORE they're encrypted.
1226 * Skip attributes that are encoded.
1228 if (reply->flags.encoded) continue;
1230 if (reply->flags.is_tlv) {
1231 len = rad_encode_wimax(packet, original, secret,
1233 ((uint8_t *) data) + sizeof(data) - ptr);
1236 len = rad_vp2attr(packet, original, secret, reply, ptr,
1237 ((uint8_t *) data) + sizeof(data) - ptr);
1240 if (len < 0) return -1;
1244 total_length += len;
1245 } /* done looping over all attributes */
1248 * Fill in the rest of the fields, and copy the data over
1249 * from the local stack to the newly allocated memory.
1251 * Yes, all this 'memcpy' is slow, but it means
1252 * that we only allocate the minimum amount of
1253 * memory for a request.
1255 packet->data_len = total_length;
1256 packet->data = (uint8_t *) malloc(packet->data_len);
1257 if (!packet->data) {
1258 fr_strerror_printf("Out of memory");
1262 memcpy(packet->data, hdr, packet->data_len);
1263 hdr = (radius_packet_t *) packet->data;
1265 total_length = htons(total_length);
1266 memcpy(hdr->length, &total_length, sizeof(total_length));
1273 * Sign a previously encoded packet.
1275 int rad_sign(RADIUS_PACKET *packet, const RADIUS_PACKET *original,
1278 radius_packet_t *hdr = (radius_packet_t *)packet->data;
1281 * It wasn't assigned an Id, this is bad!
1283 if (packet->id < 0) {
1284 fr_strerror_printf("ERROR: RADIUS packets must be assigned an Id.");
1288 if (!packet->data || (packet->data_len < AUTH_HDR_LEN) ||
1289 (packet->offset < 0)) {
1290 fr_strerror_printf("ERROR: You must call rad_encode() before rad_sign()");
1295 * If there's a Message-Authenticator, update it
1296 * now, BEFORE updating the authentication vector.
1298 if (packet->offset > 0) {
1299 uint8_t calc_auth_vector[AUTH_VECTOR_LEN];
1301 switch (packet->code) {
1302 case PW_ACCOUNTING_REQUEST:
1303 case PW_ACCOUNTING_RESPONSE:
1304 case PW_DISCONNECT_REQUEST:
1305 case PW_DISCONNECT_ACK:
1306 case PW_DISCONNECT_NAK:
1307 case PW_COA_REQUEST:
1310 memset(hdr->vector, 0, AUTH_VECTOR_LEN);
1313 case PW_AUTHENTICATION_ACK:
1314 case PW_AUTHENTICATION_REJECT:
1315 case PW_ACCESS_CHALLENGE:
1317 fr_strerror_printf("ERROR: Cannot sign response packet without a request packet.");
1320 memcpy(hdr->vector, original->vector,
1324 default: /* others have vector already set to zero */
1330 * Set the authentication vector to zero,
1331 * calculate the signature, and put it
1332 * into the Message-Authenticator
1335 fr_hmac_md5(packet->data, packet->data_len,
1336 (const uint8_t *) secret, strlen(secret),
1338 memcpy(packet->data + packet->offset + 2,
1339 calc_auth_vector, AUTH_VECTOR_LEN);
1342 * Copy the original request vector back
1343 * to the raw packet.
1345 memcpy(hdr->vector, packet->vector, AUTH_VECTOR_LEN);
1349 * Switch over the packet code, deciding how to
1352 switch (packet->code) {
1354 * Request packets are not signed, bur
1355 * have a random authentication vector.
1357 case PW_AUTHENTICATION_REQUEST:
1358 case PW_STATUS_SERVER:
1362 * Reply packets are signed with the
1363 * authentication vector of the request.
1370 fr_MD5Init(&context);
1371 fr_MD5Update(&context, packet->data, packet->data_len);
1372 fr_MD5Update(&context, (const uint8_t *) secret,
1374 fr_MD5Final(digest, &context);
1376 memcpy(hdr->vector, digest, AUTH_VECTOR_LEN);
1377 memcpy(packet->vector, digest, AUTH_VECTOR_LEN);
1380 }/* switch over packet codes */
1386 * Reply to the request. Also attach
1387 * reply attribute value pairs and any user message provided.
1389 int rad_send(RADIUS_PACKET *packet, const RADIUS_PACKET *original,
1394 char ip_buffer[128];
1397 * Maybe it's a fake packet. Don't send it.
1399 if (!packet || (packet->sockfd < 0)) {
1403 if ((packet->code > 0) && (packet->code < FR_MAX_PACKET_CODE)) {
1404 what = fr_packet_codes[packet->code];
1410 * First time through, allocate room for the packet
1412 if (!packet->data) {
1414 * Encode the packet.
1416 if (rad_encode(packet, original, secret) < 0) {
1421 * Re-sign it, including updating the
1422 * Message-Authenticator.
1424 if (rad_sign(packet, original, secret) < 0) {
1429 * If packet->data points to data, then we print out
1430 * the VP list again only for debugging.
1432 } else if (fr_debug_flag) {
1433 DEBUG("Sending %s of id %d to %s port %d\n", what, packet->id,
1434 inet_ntop(packet->dst_ipaddr.af,
1435 &packet->dst_ipaddr.ipaddr,
1436 ip_buffer, sizeof(ip_buffer)),
1439 for (reply = packet->vps; reply; reply = reply->next) {
1440 if ((reply->vendor == 0) &&
1441 ((reply->attribute & 0xFFFF) > 0xff)) continue;
1447 * And send it on it's way.
1449 return rad_sendto(packet->sockfd, packet->data, packet->data_len, 0,
1450 &packet->src_ipaddr, packet->src_port,
1451 &packet->dst_ipaddr, packet->dst_port);
1455 * Do a comparison of two authentication digests by comparing
1456 * the FULL digest. Otehrwise, the server can be subject to
1457 * timing attacks that allow attackers find a valid message
1460 * http://www.cs.rice.edu/~dwallach/pub/crosby-timing2009.pdf
1462 static int digest_cmp(const uint8_t *a, const uint8_t *b, size_t length)
1467 for (i = 0; i < length; i++) {
1468 result |= a[i] ^ b[i];
1471 return result; /* 0 is OK, !0 is !OK, just like memcmp */
1476 * Validates the requesting client NAS. Calculates the
1477 * signature based on the clients private key.
1479 static int calc_acctdigest(RADIUS_PACKET *packet, const char *secret)
1481 uint8_t digest[AUTH_VECTOR_LEN];
1485 * Zero out the auth_vector in the received packet.
1486 * Then append the shared secret to the received packet,
1487 * and calculate the MD5 sum. This must be the same
1488 * as the original MD5 sum (packet->vector).
1490 memset(packet->data + 4, 0, AUTH_VECTOR_LEN);
1493 * MD5(packet + secret);
1495 fr_MD5Init(&context);
1496 fr_MD5Update(&context, packet->data, packet->data_len);
1497 fr_MD5Update(&context, (const uint8_t *) secret, strlen(secret));
1498 fr_MD5Final(digest, &context);
1501 * Return 0 if OK, 2 if not OK.
1503 if (digest_cmp(digest, packet->vector, AUTH_VECTOR_LEN) != 0) return 2;
1509 * Validates the requesting client NAS. Calculates the
1510 * signature based on the clients private key.
1512 static int calc_replydigest(RADIUS_PACKET *packet, RADIUS_PACKET *original,
1515 uint8_t calc_digest[AUTH_VECTOR_LEN];
1521 if (original == NULL) {
1526 * Copy the original vector in place.
1528 memcpy(packet->data + 4, original->vector, AUTH_VECTOR_LEN);
1531 * MD5(packet + secret);
1533 fr_MD5Init(&context);
1534 fr_MD5Update(&context, packet->data, packet->data_len);
1535 fr_MD5Update(&context, (const uint8_t *) secret, strlen(secret));
1536 fr_MD5Final(calc_digest, &context);
1539 * Copy the packet's vector back to the packet.
1541 memcpy(packet->data + 4, packet->vector, AUTH_VECTOR_LEN);
1544 * Return 0 if OK, 2 if not OK.
1546 if (digest_cmp(packet->vector, calc_digest, AUTH_VECTOR_LEN) != 0) return 2;
1552 * See if the data pointed to by PTR is a valid RADIUS packet.
1554 * packet is not 'const * const' because we may update data_len,
1555 * if there's more data in the UDP packet than in the RADIUS packet.
1557 int rad_packet_ok(RADIUS_PACKET *packet, int flags)
1562 radius_packet_t *hdr;
1563 char host_ipaddr[128];
1569 * Check for packets smaller than the packet header.
1571 * RFC 2865, Section 3., subsection 'length' says:
1573 * "The minimum length is 20 ..."
1575 if (packet->data_len < AUTH_HDR_LEN) {
1576 fr_strerror_printf("WARNING: Malformed RADIUS packet from host %s: too short (received %d < minimum %d)",
1577 inet_ntop(packet->src_ipaddr.af,
1578 &packet->src_ipaddr.ipaddr,
1579 host_ipaddr, sizeof(host_ipaddr)),
1580 (int) packet->data_len, AUTH_HDR_LEN);
1585 * RFC 2865, Section 3., subsection 'length' says:
1587 * " ... and maximum length is 4096."
1589 if (packet->data_len > MAX_PACKET_LEN) {
1590 fr_strerror_printf("WARNING: Malformed RADIUS packet from host %s: too long (received %d > maximum %d)",
1591 inet_ntop(packet->src_ipaddr.af,
1592 &packet->src_ipaddr.ipaddr,
1593 host_ipaddr, sizeof(host_ipaddr)),
1594 (int) packet->data_len, MAX_PACKET_LEN);
1599 * Check for packets with mismatched size.
1600 * i.e. We've received 128 bytes, and the packet header
1601 * says it's 256 bytes long.
1603 totallen = (packet->data[2] << 8) | packet->data[3];
1604 hdr = (radius_packet_t *)packet->data;
1607 * Code of 0 is not understood.
1608 * Code of 16 or greate is not understood.
1610 if ((hdr->code == 0) ||
1611 (hdr->code >= FR_MAX_PACKET_CODE)) {
1612 fr_strerror_printf("WARNING: Bad RADIUS packet from host %s: unknown packet code%d ",
1613 inet_ntop(packet->src_ipaddr.af,
1614 &packet->src_ipaddr.ipaddr,
1615 host_ipaddr, sizeof(host_ipaddr)),
1621 * Message-Authenticator is required in Status-Server
1622 * packets, otherwise they can be trivially forged.
1624 if (hdr->code == PW_STATUS_SERVER) require_ma = 1;
1627 * It's also required if the caller asks for it.
1629 if (flags) require_ma = 1;
1632 * Repeat the length checks. This time, instead of
1633 * looking at the data we received, look at the value
1634 * of the 'length' field inside of the packet.
1636 * Check for packets smaller than the packet header.
1638 * RFC 2865, Section 3., subsection 'length' says:
1640 * "The minimum length is 20 ..."
1642 if (totallen < AUTH_HDR_LEN) {
1643 fr_strerror_printf("WARNING: Malformed RADIUS packet from host %s: too short (length %d < minimum %d)",
1644 inet_ntop(packet->src_ipaddr.af,
1645 &packet->src_ipaddr.ipaddr,
1646 host_ipaddr, sizeof(host_ipaddr)),
1647 totallen, AUTH_HDR_LEN);
1652 * And again, for the value of the 'length' field.
1654 * RFC 2865, Section 3., subsection 'length' says:
1656 * " ... and maximum length is 4096."
1658 if (totallen > MAX_PACKET_LEN) {
1659 fr_strerror_printf("WARNING: Malformed RADIUS packet from host %s: too long (length %d > maximum %d)",
1660 inet_ntop(packet->src_ipaddr.af,
1661 &packet->src_ipaddr.ipaddr,
1662 host_ipaddr, sizeof(host_ipaddr)),
1663 totallen, MAX_PACKET_LEN);
1668 * RFC 2865, Section 3., subsection 'length' says:
1670 * "If the packet is shorter than the Length field
1671 * indicates, it MUST be silently discarded."
1673 * i.e. No response to the NAS.
1675 if (packet->data_len < totallen) {
1676 fr_strerror_printf("WARNING: Malformed RADIUS packet from host %s: received %d octets, packet length says %d",
1677 inet_ntop(packet->src_ipaddr.af,
1678 &packet->src_ipaddr.ipaddr,
1679 host_ipaddr, sizeof(host_ipaddr)),
1680 (int) packet->data_len, totallen);
1685 * RFC 2865, Section 3., subsection 'length' says:
1687 * "Octets outside the range of the Length field MUST be
1688 * treated as padding and ignored on reception."
1690 if (packet->data_len > totallen) {
1692 * We're shortening the packet below, but just
1693 * to be paranoid, zero out the extra data.
1695 memset(packet->data + totallen, 0, packet->data_len - totallen);
1696 packet->data_len = totallen;
1700 * Walk through the packet's attributes, ensuring that
1701 * they add up EXACTLY to the size of the packet.
1703 * If they don't, then the attributes either under-fill
1704 * or over-fill the packet. Any parsing of the packet
1705 * is impossible, and will result in unknown side effects.
1707 * This would ONLY happen with buggy RADIUS implementations,
1708 * or with an intentional attack. Either way, we do NOT want
1709 * to be vulnerable to this problem.
1712 count = totallen - AUTH_HDR_LEN;
1717 * Attribute number zero is NOT defined.
1720 fr_strerror_printf("WARNING: Malformed RADIUS packet from host %s: Invalid attribute 0",
1721 inet_ntop(packet->src_ipaddr.af,
1722 &packet->src_ipaddr.ipaddr,
1723 host_ipaddr, sizeof(host_ipaddr)));
1728 * Attributes are at LEAST as long as the ID & length
1729 * fields. Anything shorter is an invalid attribute.
1732 fr_strerror_printf("WARNING: Malformed RADIUS packet from host %s: attribute %d too short",
1733 inet_ntop(packet->src_ipaddr.af,
1734 &packet->src_ipaddr.ipaddr,
1735 host_ipaddr, sizeof(host_ipaddr)),
1741 * Sanity check the attributes for length.
1744 default: /* don't do anything by default */
1748 * If there's an EAP-Message, we require
1749 * a Message-Authenticator.
1751 case PW_EAP_MESSAGE:
1755 case PW_MESSAGE_AUTHENTICATOR:
1756 if (attr[1] != 2 + AUTH_VECTOR_LEN) {
1757 fr_strerror_printf("WARNING: Malformed RADIUS packet from host %s: Message-Authenticator has invalid length %d",
1758 inet_ntop(packet->src_ipaddr.af,
1759 &packet->src_ipaddr.ipaddr,
1760 host_ipaddr, sizeof(host_ipaddr)),
1769 * FIXME: Look up the base 255 attributes in the
1770 * dictionary, and switch over their type. For
1771 * integer/date/ip, the attribute length SHOULD
1774 count -= attr[1]; /* grab the attribute length */
1776 num_attributes++; /* seen one more attribute */
1780 * If the attributes add up to a packet, it's allowed.
1782 * If not, we complain, and throw the packet away.
1785 fr_strerror_printf("WARNING: Malformed RADIUS packet from host %s: packet attributes do NOT exactly fill the packet",
1786 inet_ntop(packet->src_ipaddr.af,
1787 &packet->src_ipaddr.ipaddr,
1788 host_ipaddr, sizeof(host_ipaddr)));
1793 * If we're configured to look for a maximum number of
1794 * attributes, and we've seen more than that maximum,
1795 * then throw the packet away, as a possible DoS.
1797 if ((fr_max_attributes > 0) &&
1798 (num_attributes > fr_max_attributes)) {
1799 fr_strerror_printf("WARNING: Possible DoS attack from host %s: Too many attributes in request (received %d, max %d are allowed).",
1800 inet_ntop(packet->src_ipaddr.af,
1801 &packet->src_ipaddr.ipaddr,
1802 host_ipaddr, sizeof(host_ipaddr)),
1803 num_attributes, fr_max_attributes);
1808 * http://www.freeradius.org/rfc/rfc2869.html#EAP-Message
1810 * A packet with an EAP-Message attribute MUST also have
1811 * a Message-Authenticator attribute.
1813 * A Message-Authenticator all by itself is OK, though.
1815 * Similarly, Status-Server packets MUST contain
1816 * Message-Authenticator attributes.
1818 if (require_ma && ! seen_ma) {
1819 fr_strerror_printf("WARNING: Insecure packet from host %s: Packet does not contain required Message-Authenticator attribute",
1820 inet_ntop(packet->src_ipaddr.af,
1821 &packet->src_ipaddr.ipaddr,
1822 host_ipaddr, sizeof(host_ipaddr)));
1827 * Fill RADIUS header fields
1829 packet->code = hdr->code;
1830 packet->id = hdr->id;
1831 memcpy(packet->vector, hdr->vector, AUTH_VECTOR_LEN);
1838 * Receive UDP client requests, and fill in
1839 * the basics of a RADIUS_PACKET structure.
1841 RADIUS_PACKET *rad_recv(int fd, int flags)
1844 RADIUS_PACKET *packet;
1847 * Allocate the new request data structure
1849 if ((packet = malloc(sizeof(*packet))) == NULL) {
1850 fr_strerror_printf("out of memory");
1853 memset(packet, 0, sizeof(*packet));
1856 sock_flags = MSG_PEEK;
1860 packet->data_len = rad_recvfrom(fd, &packet->data, sock_flags,
1861 &packet->src_ipaddr, &packet->src_port,
1862 &packet->dst_ipaddr, &packet->dst_port);
1865 * Check for socket errors.
1867 if (packet->data_len < 0) {
1868 fr_strerror_printf("Error receiving packet: %s", strerror(errno));
1869 /* packet->data is NULL */
1875 * If the packet is too big, then rad_recvfrom did NOT
1876 * allocate memory. Instead, it just discarded the
1879 if (packet->data_len > MAX_PACKET_LEN) {
1880 fr_strerror_printf("Discarding packet: Larger than RFC limitation of 4096 bytes.");
1881 /* packet->data is NULL */
1887 * Read no data. Continue.
1888 * This check is AFTER the MAX_PACKET_LEN check above, because
1889 * if the packet is larger than MAX_PACKET_LEN, we also have
1890 * packet->data == NULL
1892 if ((packet->data_len == 0) || !packet->data) {
1893 fr_strerror_printf("Empty packet: Socket is not ready.");
1899 * See if it's a well-formed RADIUS packet.
1901 if (!rad_packet_ok(packet, flags)) {
1907 * Remember which socket we read the packet from.
1909 packet->sockfd = fd;
1912 * FIXME: Do even more filtering by only permitting
1913 * certain IP's. The problem is that we don't know
1914 * how to do this properly for all possible clients...
1918 * Explicitely set the VP list to empty.
1922 if (fr_debug_flag) {
1923 char host_ipaddr[128];
1925 if ((packet->code > 0) && (packet->code < FR_MAX_PACKET_CODE)) {
1926 DEBUG("rad_recv: %s packet from host %s port %d",
1927 fr_packet_codes[packet->code],
1928 inet_ntop(packet->src_ipaddr.af,
1929 &packet->src_ipaddr.ipaddr,
1930 host_ipaddr, sizeof(host_ipaddr)),
1933 DEBUG("rad_recv: Packet from host %s port %d code=%d",
1934 inet_ntop(packet->src_ipaddr.af,
1935 &packet->src_ipaddr.ipaddr,
1936 host_ipaddr, sizeof(host_ipaddr)),
1940 DEBUG(", id=%d, length=%d\n",
1941 packet->id, (int) packet->data_len);
1949 * Verify the signature of a packet.
1951 int rad_verify(RADIUS_PACKET *packet, RADIUS_PACKET *original,
1958 if (!packet || !packet->data) return -1;
1961 * Before we allocate memory for the attributes, do more
1964 ptr = packet->data + AUTH_HDR_LEN;
1965 length = packet->data_len - AUTH_HDR_LEN;
1966 while (length > 0) {
1967 uint8_t msg_auth_vector[AUTH_VECTOR_LEN];
1968 uint8_t calc_auth_vector[AUTH_VECTOR_LEN];
1973 default: /* don't do anything. */
1977 * Note that more than one Message-Authenticator
1978 * attribute is invalid.
1980 case PW_MESSAGE_AUTHENTICATOR:
1981 memcpy(msg_auth_vector, &ptr[2], sizeof(msg_auth_vector));
1982 memset(&ptr[2], 0, AUTH_VECTOR_LEN);
1984 switch (packet->code) {
1988 case PW_ACCOUNTING_REQUEST:
1989 case PW_ACCOUNTING_RESPONSE:
1990 case PW_DISCONNECT_REQUEST:
1991 case PW_DISCONNECT_ACK:
1992 case PW_DISCONNECT_NAK:
1993 case PW_COA_REQUEST:
1996 memset(packet->data + 4, 0, AUTH_VECTOR_LEN);
1999 case PW_AUTHENTICATION_ACK:
2000 case PW_AUTHENTICATION_REJECT:
2001 case PW_ACCESS_CHALLENGE:
2003 fr_strerror_printf("ERROR: Cannot validate Message-Authenticator in response packet without a request packet.");
2006 memcpy(packet->data + 4, original->vector, AUTH_VECTOR_LEN);
2010 fr_hmac_md5(packet->data, packet->data_len,
2011 (const uint8_t *) secret, strlen(secret),
2013 if (digest_cmp(calc_auth_vector, msg_auth_vector,
2014 sizeof(calc_auth_vector)) != 0) {
2016 fr_strerror_printf("Received packet from %s with invalid Message-Authenticator! (Shared secret is incorrect.)",
2017 inet_ntop(packet->src_ipaddr.af,
2018 &packet->src_ipaddr.ipaddr,
2019 buffer, sizeof(buffer)));
2020 /* Silently drop packet, according to RFC 3579 */
2022 } /* else the message authenticator was good */
2025 * Reinitialize Authenticators.
2027 memcpy(&ptr[2], msg_auth_vector, AUTH_VECTOR_LEN);
2028 memcpy(packet->data + 4, packet->vector, AUTH_VECTOR_LEN);
2030 } /* switch over the attributes */
2034 } /* loop over the packet, sanity checking the attributes */
2037 * It looks like a RADIUS packet, but we can't validate
2040 if ((packet->code == 0) || (packet->code >= FR_MAX_PACKET_CODE)) {
2042 fr_strerror_printf("Received Unknown packet code %d "
2043 "from client %s port %d: Cannot validate signature.",
2045 inet_ntop(packet->src_ipaddr.af,
2046 &packet->src_ipaddr.ipaddr,
2047 buffer, sizeof(buffer)),
2053 * Calculate and/or verify digest.
2055 switch(packet->code) {
2059 case PW_AUTHENTICATION_REQUEST:
2060 case PW_STATUS_SERVER:
2062 * The authentication vector is random
2063 * nonsense, invented by the client.
2067 case PW_COA_REQUEST:
2068 case PW_DISCONNECT_REQUEST:
2069 case PW_ACCOUNTING_REQUEST:
2070 if (calc_acctdigest(packet, secret) > 1) {
2071 fr_strerror_printf("Received %s packet "
2072 "from %s with invalid signature! (Shared secret is incorrect.)",
2073 fr_packet_codes[packet->code],
2074 inet_ntop(packet->src_ipaddr.af,
2075 &packet->src_ipaddr.ipaddr,
2076 buffer, sizeof(buffer)));
2081 /* Verify the reply digest */
2082 case PW_AUTHENTICATION_ACK:
2083 case PW_AUTHENTICATION_REJECT:
2084 case PW_ACCESS_CHALLENGE:
2085 case PW_ACCOUNTING_RESPONSE:
2086 case PW_DISCONNECT_ACK:
2087 case PW_DISCONNECT_NAK:
2090 rcode = calc_replydigest(packet, original, secret);
2092 fr_strerror_printf("Received %s packet "
2093 "from client %s port %d with invalid signature (err=%d)! (Shared secret is incorrect.)",
2094 fr_packet_codes[packet->code],
2095 inet_ntop(packet->src_ipaddr.af,
2096 &packet->src_ipaddr.ipaddr,
2097 buffer, sizeof(buffer)),
2105 fr_strerror_printf("Received Unknown packet code %d "
2106 "from client %s port %d: Cannot validate signature",
2108 inet_ntop(packet->src_ipaddr.af,
2109 &packet->src_ipaddr.ipaddr,
2110 buffer, sizeof(buffer)),
2119 static VALUE_PAIR *data2vp(const RADIUS_PACKET *packet,
2120 const RADIUS_PACKET *original,
2121 const char *secret, size_t length,
2122 const uint8_t *data, VALUE_PAIR *vp)
2127 * If length is greater than 253, something is SERIOUSLY
2130 if (length > 253) length = 253; /* paranoia (pair-anoia?) */
2132 vp->length = length;
2133 vp->operator = T_OP_EQ;
2139 if (vp->flags.has_tag) {
2140 if (TAG_VALID(data[0]) ||
2141 (vp->flags.encrypt == FLAG_ENCRYPT_TUNNEL_PASSWORD)) {
2143 * Tunnel passwords REQUIRE a tag, even
2144 * if don't have a valid tag.
2146 vp->flags.tag = data[0];
2148 if ((vp->type == PW_TYPE_STRING) ||
2149 (vp->type == PW_TYPE_OCTETS)) offset = 1;
2154 * Copy the data to be decrypted
2156 memcpy(&vp->vp_octets[0], data + offset, length - offset);
2157 vp->length -= offset;
2160 * Decrypt the attribute.
2162 switch (vp->flags.encrypt) {
2166 case FLAG_ENCRYPT_USER_PASSWORD:
2168 rad_pwdecode((char *)vp->vp_strvalue,
2172 rad_pwdecode((char *)vp->vp_strvalue,
2176 if (vp->attribute == PW_USER_PASSWORD) {
2177 vp->length = strlen(vp->vp_strvalue);
2182 * Tunnel-Password's may go ONLY
2183 * in response packets.
2185 case FLAG_ENCRYPT_TUNNEL_PASSWORD:
2186 if (!original) goto raw;
2188 if (rad_tunnel_pwdecode(vp->vp_octets, &vp->length,
2189 secret, original->vector) < 0) {
2195 * Ascend-Send-Secret
2196 * Ascend-Receive-Secret
2198 case FLAG_ENCRYPT_ASCEND_SECRET:
2202 uint8_t my_digest[AUTH_VECTOR_LEN];
2203 make_secret(my_digest,
2206 memcpy(vp->vp_strvalue, my_digest,
2208 vp->vp_strvalue[AUTH_VECTOR_LEN] = '\0';
2209 vp->length = strlen(vp->vp_strvalue);
2215 } /* switch over encryption flags */
2219 case PW_TYPE_STRING:
2220 case PW_TYPE_OCTETS:
2221 case PW_TYPE_ABINARY:
2222 /* nothing more to do */
2226 if (vp->length != 1) goto raw;
2228 vp->vp_integer = vp->vp_octets[0];
2233 if (vp->length != 2) goto raw;
2235 vp->vp_integer = (vp->vp_octets[0] << 8) | vp->vp_octets[1];
2238 case PW_TYPE_INTEGER:
2239 if (vp->length != 4) goto raw;
2241 memcpy(&vp->vp_integer, vp->vp_octets, 4);
2242 vp->vp_integer = ntohl(vp->vp_integer);
2244 if (vp->flags.has_tag) vp->vp_integer &= 0x00ffffff;
2247 * Try to get named VALUEs
2251 dval = dict_valbyattr(vp->attribute, vp->vendor,
2254 strlcpy(vp->vp_strvalue,
2256 sizeof(vp->vp_strvalue));
2262 if (vp->length != 4) goto raw;
2264 memcpy(&vp->vp_date, vp->vp_octets, 4);
2265 vp->vp_date = ntohl(vp->vp_date);
2269 case PW_TYPE_IPADDR:
2270 if (vp->length != 4) goto raw;
2272 memcpy(&vp->vp_ipaddr, vp->vp_octets, 4);
2276 * IPv6 interface ID is 8 octets long.
2279 if (vp->length != 8) goto raw;
2280 /* vp->vp_ifid == vp->vp_octets */
2284 * IPv6 addresses are 16 octets long
2286 case PW_TYPE_IPV6ADDR:
2287 if (vp->length != 16) goto raw;
2288 /* vp->vp_ipv6addr == vp->vp_octets */
2292 * IPv6 prefixes are 2 to 18 octets long.
2294 * RFC 3162: The first octet is unused.
2295 * The second is the length of the prefix
2296 * the rest are the prefix data.
2298 * The prefix length can have value 0 to 128.
2300 case PW_TYPE_IPV6PREFIX:
2301 if (vp->length < 2 || vp->length > 18) goto raw;
2302 if (vp->vp_octets[1] > 128) goto raw;
2305 * FIXME: double-check that
2306 * (vp->vp_octets[1] >> 3) matches vp->length + 2
2308 if (vp->length < 18) {
2309 memset(vp->vp_octets + vp->length, 0,
2314 case PW_TYPE_SIGNED:
2315 if (vp->length != 4) goto raw;
2318 * Overload vp_integer for ntohl, which takes
2319 * uint32_t, not int32_t
2321 memcpy(&vp->vp_integer, vp->vp_octets, 4);
2322 vp->vp_integer = ntohl(vp->vp_integer);
2323 memcpy(&vp->vp_signed, &vp->vp_integer, 4);
2327 vp->length = length;
2328 vp->vp_tlv = malloc(length);
2331 fr_strerror_printf("No memory");
2334 memcpy(vp->vp_tlv, data, length);
2337 case PW_TYPE_COMBO_IP:
2338 if (vp->length == 4) {
2339 vp->type = PW_TYPE_IPADDR;
2340 memcpy(&vp->vp_ipaddr, vp->vp_octets, 4);
2343 } else if (vp->length == 16) {
2344 vp->type = PW_TYPE_IPV6ADDR;
2345 /* vp->vp_ipv6addr == vp->vp_octets */
2353 vp->type = PW_TYPE_OCTETS;
2354 vp->length = length;
2355 memcpy(vp->vp_octets, data, length);
2359 * Ensure there's no encryption or tag stuff,
2360 * we just pass the attribute as-is.
2362 memset(&vp->flags, 0, sizeof(vp->flags));
2368 static void rad_sortvp(VALUE_PAIR **head)
2371 VALUE_PAIR *vp, **tail;
2374 * Walk over the VP's, sorting them in order. Did I
2375 * mention that I hate WiMAX continuations?
2377 * And bubble sort! WTF is up with that?
2384 if (!vp->next) break;
2386 if (vp->attribute > vp->next->attribute) {
2388 vp->next = (*tail)->next;
2399 * Walk the packet, looking for continuations of this attribute.
2401 * This is (worst-case) O(N^2) in the number of RADIUS
2402 * attributes. That happens only when perverse clients create
2403 * continued attributes, AND separate the fragmented portions
2404 * with a lot of other attributes.
2406 * Sane clients should put the fragments next to each other, in
2407 * which case this is O(N), in the number of fragments.
2409 static uint8_t *rad_coalesce(unsigned int attribute, int vendor,
2410 size_t length, uint8_t *data,
2411 size_t packet_length, size_t *ptlv_length)
2415 size_t tlv_length = length;
2416 uint8_t *ptr, *tlv, *tlv_data;
2418 for (ptr = data + length;
2419 ptr != (data + packet_length);
2421 /* FIXME: Check that there are 6 bytes of data here... */
2422 if ((ptr[0] != PW_VENDOR_SPECIFIC) ||
2423 (ptr[1] < (2 + 4 + 3)) || /* WiMAX VSA with continuation */
2424 (ptr[2] != 0) || (ptr[3] != 0) || /* our requirement */
2425 (ptr[4] != ((vendor >> 8) & 0xff)) ||
2426 (ptr[5] != (vendor & 0xff))) {
2430 memcpy(&lvalue, ptr + 2, 4); /* Vendor Id */
2431 lvalue = ntohl(lvalue);
2433 lvalue |= ptr[2 + 4]; /* add in VSA number */
2434 if (lvalue != attribute) continue;
2437 * If the vendor-length is too small, it's badly
2438 * formed, so we stop.
2440 if ((ptr[2 + 4 + 1]) < 3) break;
2442 tlv_length += ptr[2 + 4 + 1] - 3;
2443 if ((ptr[2 + 4 + 1 + 1] & 0x80) == 0) break;
2446 tlv = tlv_data = malloc(tlv_length);
2447 if (!tlv_data) return NULL;
2449 memcpy(tlv, data, length);
2453 * Now we walk the list again, copying the data over to
2454 * our newly created memory.
2456 for (ptr = data + length;
2457 ptr != (data + packet_length);
2461 if ((ptr[0] != PW_VENDOR_SPECIFIC) ||
2462 (ptr[1] < (2 + 4 + 3)) || /* WiMAX VSA with continuation */
2463 (ptr[2] != 0) || (ptr[3] != 0)) { /* our requirement */
2467 memcpy(&lvalue, ptr + 2, 4);
2468 lvalue = ntohl(lvalue);
2470 lvalue |= ptr[2 + 4];
2471 if (lvalue != attribute) continue;
2474 * If the vendor-length is too small, it's badly
2475 * formed, so we stop.
2477 if ((ptr[2 + 4 + 1]) < 3) break;
2479 this_length = ptr[2 + 4 + 1] - 3;
2480 memcpy(tlv, ptr + 2 + 4 + 3, this_length);
2483 ptr[2 + 4] = 0; /* What a hack! */
2484 if ((ptr[2 + 4 + 1 + 1] & 0x80) == 0) break;
2487 *ptlv_length = tlv_length;
2492 * Walk over Evil WIMAX Hell, creating attributes.
2494 * Won't someone think of the children? What if they read this code?
2496 static VALUE_PAIR *recurse_evil(const RADIUS_PACKET *packet,
2497 const RADIUS_PACKET *original,
2499 int attribute, int vendor,
2500 uint8_t *ptr, size_t len)
2502 VALUE_PAIR *head = NULL;
2503 VALUE_PAIR **tail = &head;
2505 uint8_t *y; /* why do I need to do this? */
2508 * Sanity check the attribute.
2510 for (y = ptr; y < (ptr + len); y += y[1]) {
2511 if ((y[0] == 0) || ((y + 2) > (ptr + len)) ||
2512 (y[1] < 2) || ((y + y[1]) > (ptr + len))) {
2517 for (y = ptr; y < (ptr + len); y += y[1]) {
2518 vp = paircreate(attribute | (ptr[0] << 16), vendor,
2526 if (!data2vp(packet, original, secret,
2527 y[1] - 2, y + 2, vp)) {
2539 * Start at the *data* portion of a continued attribute. search
2540 * through the rest of the attributes to find a matching one, and
2541 * add it's contents to our contents.
2543 static VALUE_PAIR *rad_continuation2vp(const RADIUS_PACKET *packet,
2544 const RADIUS_PACKET *original,
2545 const char *secret, int attribute,
2547 int length, /* CANNOT be zero */
2548 uint8_t *data, size_t packet_length,
2549 int flag, DICT_ATTR *da)
2551 size_t tlv_length, left;
2554 VALUE_PAIR *vp, *head, **tail;
2558 * Ensure we have data that hasn't been split across
2559 * multiple attributes.
2562 tlv_data = rad_coalesce(attribute, vendor, length,
2563 data, packet_length, &tlv_length);
2564 if (!tlv_data) return NULL;
2567 tlv_length = length;
2571 * Non-TLV types cannot be continued across multiple
2572 * attributes. This is true even of keys that are
2573 * encrypted with the tunnel-password method. The spec
2574 * says that they can be continued... but also that the
2575 * keys are 160 bits, which means that they CANNOT be
2578 * Note that we don't check "flag" here. The calling
2581 if (!da || (da->type != PW_TYPE_TLV)) {
2583 if (tlv_data == data) { /* true if we had 'goto' */
2584 tlv_data = malloc(tlv_length);
2585 if (!tlv_data) return NULL;
2586 memcpy(tlv_data, data, tlv_length);
2589 vp = paircreate(attribute, vendor, PW_TYPE_OCTETS);
2590 if (!vp) return NULL;
2592 vp->type = PW_TYPE_TLV;
2593 vp->flags.encrypt = FLAG_ENCRYPT_NONE;
2594 vp->flags.has_tag = 0;
2595 vp->flags.is_tlv = 0;
2596 vp->vp_tlv = tlv_data;
2597 vp->length = tlv_length;
2599 } /* else it WAS a TLV, go decode the sub-tlv's */
2602 * Now (sigh) we walk over the TLV, seeing if it is
2606 for (ptr = tlv_data;
2607 ptr != (tlv_data + tlv_length);
2612 goto not_well_formed;
2619 * Now we walk over the TLV *again*, creating sub-tlv's.
2624 for (ptr = tlv_data;
2625 ptr != (tlv_data + tlv_length);
2628 tlv_da = dict_attrbyvalue(attribute | (ptr[0] << 8), vendor);
2629 if (tlv_da && (tlv_da->type == PW_TYPE_TLV)) {
2630 vp = recurse_evil(packet, original, secret,
2631 attribute | (ptr[0] << 8),
2632 vendor, ptr + 2, ptr[1] - 2);
2636 goto not_well_formed;
2639 vp = paircreate(attribute | (ptr[0] << 8), vendor,
2643 goto not_well_formed;
2646 if (!data2vp(packet, original, secret,
2647 ptr[1] - 2, ptr + 2, vp)) {
2649 goto not_well_formed;
2655 while (*tail) tail = &((*tail)->next);
2659 * TLV's MAY be continued, but sometimes they're not.
2661 if (tlv_data != data) free(tlv_data);
2663 if (head->next) rad_sortvp(&head);
2670 * Parse a RADIUS attribute into a data structure.
2672 VALUE_PAIR *rad_attr2vp(const RADIUS_PACKET *packet,
2673 const RADIUS_PACKET *original,
2674 const char *secret, int attribute, int vendor,
2675 int length, const uint8_t *data)
2679 vp = paircreate(attribute, vendor, PW_TYPE_OCTETS);
2680 if (!vp) return NULL;
2682 return data2vp(packet, original, secret, length, data, vp);
2687 * Calculate/check digest, and decode radius attributes.
2689 * -1 on decoding error
2692 int rad_decode(RADIUS_PACKET *packet, RADIUS_PACKET *original,
2696 uint32_t vendorcode;
2699 uint8_t *ptr, *vsa_ptr;
2704 radius_packet_t *hdr;
2705 int vsa_tlen, vsa_llen, vsa_offset;
2706 DICT_VENDOR *dv = NULL;
2707 int num_attributes = 0;
2710 * Extract attribute-value pairs
2712 hdr = (radius_packet_t *)packet->data;
2714 packet_length = packet->data_len - AUTH_HDR_LEN;
2717 * There may be VP's already in the packet. Don't
2720 for (tail = &packet->vps; *tail != NULL; tail = &((*tail)->next)) {
2726 vsa_tlen = vsa_llen = 1;
2730 * We have to read at least two bytes.
2732 * rad_recv() above ensures that this is OK.
2734 while (packet_length > 0) {
2739 * Normal attribute, handle it like normal.
2741 if (vendorcode == 0) {
2743 * No room to read attr/length,
2744 * or bad attribute, or attribute is
2745 * too short, or attribute is too long,
2746 * stop processing the packet.
2748 if ((packet_length < 2) ||
2749 (ptr[0] == 0) || (ptr[1] < 2) ||
2750 (ptr[1] > packet_length)) break;
2758 if (attribute != PW_VENDOR_SPECIFIC) goto create_pair;
2761 * No vendor code, or ONLY vendor code.
2763 if (attrlen <= 4) goto create_pair;
2769 * Handle Vendor-Specific
2771 if (vendorlen == 0) {
2777 * attrlen was checked above.
2779 memcpy(&lvalue, ptr, 4);
2780 myvendor = ntohl(lvalue);
2783 * Zero isn't allowed.
2785 if (myvendor == 0) goto create_pair;
2788 * This is an implementation issue.
2789 * We currently pack vendor into the upper
2790 * 16 bits of a 32-bit attribute number,
2791 * so we can't handle vendor numbers larger
2794 if (myvendor > 65535) goto create_pair;
2796 vsa_tlen = vsa_llen = 1;
2798 dv = dict_vendorbyvalue(myvendor);
2800 vsa_tlen = dv->type;
2801 vsa_llen = dv->length;
2802 if (dv->flags) vsa_offset = 1;
2806 * Sweep through the list of VSA's,
2807 * seeing if they exactly fill the
2808 * outer Vendor-Specific attribute.
2810 * If not, create a raw Vendor-Specific.
2813 sublen = attrlen - 4;
2816 * See if we can parse it.
2822 * Not enough room for one more
2825 if (sublen < (vsa_tlen + vsa_llen + vsa_offset)) goto create_pair;
2828 * Ensure that the attribute number
2837 myattr = (subptr[0] << 8) | subptr[1];
2841 if ((subptr[0] != 0) ||
2842 (subptr[1] != 0)) goto create_pair;
2844 myattr = (subptr[2] << 8) | subptr[3];
2848 * Our dictionary is broken.
2857 ptr += 4 + vsa_tlen;
2858 attrlen -= (4 + vsa_tlen);
2859 packet_length -= 4 + vsa_tlen;
2863 if (subptr[vsa_tlen] < (vsa_tlen + vsa_llen + vsa_offset))
2866 if (subptr[vsa_tlen] > sublen)
2871 * Reserved bits MUST be
2875 ((subptr[vsa_tlen + vsa_llen] & 0x7f) != 0))
2878 sublen -= subptr[vsa_tlen];
2879 subptr += subptr[vsa_tlen];
2883 if (subptr[vsa_tlen] != 0) goto create_pair;
2884 if (subptr[vsa_tlen + 1] < (vsa_tlen + vsa_llen))
2886 if (subptr[vsa_tlen + 1] > sublen)
2888 sublen -= subptr[vsa_tlen + 1];
2889 subptr += subptr[vsa_tlen + 1];
2893 * Our dictionaries are
2899 } while (sublen > 0);
2901 vendorcode = myvendor;
2902 vendorlen = attrlen - 4;
2909 * attrlen is the length of this attribute.
2910 * total_len is the length of the encompassing
2919 attribute = (ptr[0] << 8) | ptr[1];
2922 default: /* can't hit this. */
2930 attrlen = ptr[0] - (vsa_tlen + vsa_llen + vsa_offset);
2934 attrlen = ptr[1] - (vsa_tlen + vsa_llen);
2937 default: /* can't hit this. */
2941 ptr += vsa_llen + vsa_offset;
2942 vendorlen -= vsa_tlen + vsa_llen + vsa_offset + attrlen;
2943 packet_length -= (vsa_tlen + vsa_llen + vsa_offset);
2946 * Ignore VSAs that have no data.
2948 if (attrlen == 0) goto next;
2951 * WiMAX attributes of type 0 are ignored. They
2952 * are a secret flag to us that the attribute has
2953 * already been dealt with.
2955 if ((vendorcode == VENDORPEC_WIMAX) && (attribute == 0)) {
2962 da = dict_attrbyvalue(attribute, vendorcode);
2965 * If it's NOT continued, AND we know
2966 * about it, AND it's not a TLV, we can
2967 * create a normal pair.
2969 if (((vsa_ptr[2] & 0x80) == 0) &&
2970 da && (da->type != PW_TYPE_TLV)) goto create_pair;
2973 * Else it IS continued, or it's a TLV.
2974 * Go do a lot of work to find the stuff.
2976 pair = rad_continuation2vp(packet, original, secret,
2977 attribute, vendorcode,
2980 ((vsa_ptr[2] & 0x80) != 0),
2986 * Create the attribute, setting the default type
2987 * to 'octets'. If the type in the dictionary
2988 * is different, then the dictionary type will
2989 * over-ride this one.
2991 * If the attribute has no data, then discard it.
2993 * Unless it's CUI. Damn you, CUI!
2997 (attribute != PW_CHARGEABLE_USER_IDENTITY)) goto next;
2999 pair = rad_attr2vp(packet, original, secret,
3000 attribute, vendorcode, attrlen, ptr);
3002 pairfree(&packet->vps);
3003 fr_strerror_printf("out of memory");
3017 * VSA's may not have been counted properly in
3018 * rad_packet_ok() above, as it is hard to count
3019 * then without using the dictionary. We
3020 * therefore enforce the limits here, too.
3022 if ((fr_max_attributes > 0) &&
3023 (num_attributes > fr_max_attributes)) {
3024 char host_ipaddr[128];
3026 pairfree(&packet->vps);
3027 fr_strerror_printf("WARNING: Possible DoS attack from host %s: Too many attributes in request (received %d, max %d are allowed).",
3028 inet_ntop(packet->src_ipaddr.af,
3029 &packet->src_ipaddr.ipaddr,
3030 host_ipaddr, sizeof(host_ipaddr)),
3031 num_attributes, fr_max_attributes);
3036 if (vendorlen == 0) vendorcode = 0;
3038 packet_length -= attrlen;
3042 * Merge information from the outside world into our
3045 fr_rand_seed(packet->data, AUTH_HDR_LEN);
3054 * We assume that the passwd buffer passed is big enough.
3055 * RFC2138 says the password is max 128 chars, so the size
3056 * of the passwd buffer must be at least 129 characters.
3057 * Preferably it's just MAX_STRING_LEN.
3059 * int *pwlen is updated to the new length of the encrypted
3060 * password - a multiple of 16 bytes.
3062 int rad_pwencode(char *passwd, size_t *pwlen, const char *secret,
3063 const uint8_t *vector)
3065 FR_MD5_CTX context, old;
3066 uint8_t digest[AUTH_VECTOR_LEN];
3067 int i, n, secretlen;
3071 * RFC maximum is 128 bytes.
3073 * If length is zero, pad it out with zeros.
3075 * If the length isn't aligned to 16 bytes,
3076 * zero out the extra data.
3080 if (len > 128) len = 128;
3083 memset(passwd, 0, AUTH_PASS_LEN);
3084 len = AUTH_PASS_LEN;
3085 } else if ((len % AUTH_PASS_LEN) != 0) {
3086 memset(&passwd[len], 0, AUTH_PASS_LEN - (len % AUTH_PASS_LEN));
3087 len += AUTH_PASS_LEN - (len % AUTH_PASS_LEN);
3092 * Use the secret to setup the decryption digest
3094 secretlen = strlen(secret);
3096 fr_MD5Init(&context);
3097 fr_MD5Update(&context, (const uint8_t *) secret, secretlen);
3098 old = context; /* save intermediate work */
3101 * Encrypt it in place. Don't bother checking
3102 * len, as we've ensured above that it's OK.
3104 for (n = 0; n < len; n += AUTH_PASS_LEN) {
3106 fr_MD5Update(&context, vector, AUTH_PASS_LEN);
3107 fr_MD5Final(digest, &context);
3110 fr_MD5Update(&context,
3111 (uint8_t *) passwd + n - AUTH_PASS_LEN,
3113 fr_MD5Final(digest, &context);
3116 for (i = 0; i < AUTH_PASS_LEN; i++) {
3117 passwd[i + n] ^= digest[i];
3127 int rad_pwdecode(char *passwd, size_t pwlen, const char *secret,
3128 const uint8_t *vector)
3130 FR_MD5_CTX context, old;
3131 uint8_t digest[AUTH_VECTOR_LEN];
3133 size_t n, secretlen;
3136 * The RFC's say that the maximum is 128.
3137 * The buffer we're putting it into above is 254, so
3138 * we don't need to do any length checking.
3140 if (pwlen > 128) pwlen = 128;
3145 if (pwlen == 0) goto done;
3148 * Use the secret to setup the decryption digest
3150 secretlen = strlen(secret);
3152 fr_MD5Init(&context);
3153 fr_MD5Update(&context, (const uint8_t *) secret, secretlen);
3154 old = context; /* save intermediate work */
3157 * The inverse of the code above.
3159 for (n = 0; n < pwlen; n += AUTH_PASS_LEN) {
3161 fr_MD5Update(&context, vector, AUTH_VECTOR_LEN);
3162 fr_MD5Final(digest, &context);
3165 if (pwlen > AUTH_PASS_LEN) {
3166 fr_MD5Update(&context, (uint8_t *) passwd,
3170 fr_MD5Final(digest, &context);
3173 if (pwlen > (n + AUTH_PASS_LEN)) {
3174 fr_MD5Update(&context, (uint8_t *) passwd + n,
3179 for (i = 0; i < AUTH_PASS_LEN; i++) {
3180 passwd[i + n] ^= digest[i];
3185 passwd[pwlen] = '\0';
3186 return strlen(passwd);
3191 * Encode Tunnel-Password attributes when sending them out on the wire.
3193 * int *pwlen is updated to the new length of the encrypted
3194 * password - a multiple of 16 bytes.
3196 * This is per RFC-2868 which adds a two char SALT to the initial intermediate
3199 int rad_tunnel_pwencode(char *passwd, size_t *pwlen, const char *secret,
3200 const uint8_t *vector)
3202 uint8_t buffer[AUTH_VECTOR_LEN + MAX_STRING_LEN + 3];
3203 unsigned char digest[AUTH_VECTOR_LEN];
3205 int i, n, secretlen;
3210 if (len > 127) len = 127;
3213 * Shift the password 3 positions right to place a salt and original
3214 * length, tag will be added automatically on packet send
3216 for (n=len ; n>=0 ; n--) passwd[n+3] = passwd[n];
3220 * save original password length as first password character;
3227 * Generate salt. The RFC's say:
3229 * The high bit of salt[0] must be set, each salt in a
3230 * packet should be unique, and they should be random
3232 * So, we set the high bit, add in a counter, and then
3233 * add in some CSPRNG data. should be OK..
3235 salt[0] = (0x80 | ( ((salt_offset++) & 0x0f) << 3) |
3236 (fr_rand() & 0x07));
3237 salt[1] = fr_rand();
3240 * Padd password to multiple of AUTH_PASS_LEN bytes.
3242 n = len % AUTH_PASS_LEN;
3244 n = AUTH_PASS_LEN - n;
3245 for (; n > 0; n--, len++)
3248 /* set new password length */
3252 * Use the secret to setup the decryption digest
3254 secretlen = strlen(secret);
3255 memcpy(buffer, secret, secretlen);
3257 for (n2 = 0; n2 < len; n2+=AUTH_PASS_LEN) {
3259 memcpy(buffer + secretlen, vector, AUTH_VECTOR_LEN);
3260 memcpy(buffer + secretlen + AUTH_VECTOR_LEN, salt, 2);
3261 fr_md5_calc(digest, buffer, secretlen + AUTH_VECTOR_LEN + 2);
3263 memcpy(buffer + secretlen, passwd + n2 - AUTH_PASS_LEN, AUTH_PASS_LEN);
3264 fr_md5_calc(digest, buffer, secretlen + AUTH_PASS_LEN);
3267 for (i = 0; i < AUTH_PASS_LEN; i++) {
3268 passwd[i + n2] ^= digest[i];
3276 * Decode Tunnel-Password encrypted attributes.
3278 * Defined in RFC-2868, this uses a two char SALT along with the
3279 * initial intermediate value, to differentiate it from the
3282 int rad_tunnel_pwdecode(uint8_t *passwd, size_t *pwlen, const char *secret,
3283 const uint8_t *vector)
3285 FR_MD5_CTX context, old;
3286 uint8_t digest[AUTH_VECTOR_LEN];
3288 unsigned i, n, len, reallen;
3293 * We need at least a salt.
3296 fr_strerror_printf("tunnel password is too short");
3301 * There's a salt, but no password. Or, there's a salt
3302 * and a 'data_len' octet. It's wrong, but at least we
3303 * can figure out what it means: the password is empty.
3305 * Note that this means we ignore the 'data_len' field,
3306 * if the attribute length tells us that there's no
3307 * more data. So the 'data_len' field may be wrong,
3316 len -= 2; /* discount the salt */
3319 * Use the secret to setup the decryption digest
3321 secretlen = strlen(secret);
3323 fr_MD5Init(&context);
3324 fr_MD5Update(&context, (const uint8_t *) secret, secretlen);
3325 old = context; /* save intermediate work */
3328 * Set up the initial key:
3330 * b(1) = MD5(secret + vector + salt)
3332 fr_MD5Update(&context, vector, AUTH_VECTOR_LEN);
3333 fr_MD5Update(&context, passwd, 2);
3336 for (n = 0; n < len; n += AUTH_PASS_LEN) {
3340 fr_MD5Final(digest, &context);
3345 * A quick check: decrypt the first octet
3346 * of the password, which is the
3347 * 'data_len' field. Ensure it's sane.
3349 reallen = passwd[2] ^ digest[0];
3350 if (reallen >= len) {
3351 fr_strerror_printf("tunnel password is too long for the attribute");
3355 fr_MD5Update(&context, passwd + 2, AUTH_PASS_LEN);
3359 fr_MD5Final(digest, &context);
3362 fr_MD5Update(&context, passwd + n + 2, AUTH_PASS_LEN);
3365 for (i = base; i < AUTH_PASS_LEN; i++) {
3366 passwd[n + i - 1] = passwd[n + i + 2] ^ digest[i];
3371 * See make_tunnel_password, above.
3373 if (reallen > 239) reallen = 239;
3376 passwd[reallen] = 0;
3382 * Encode a CHAP password
3384 * FIXME: might not work with Ascend because
3385 * we use vp->length, and Ascend gear likes
3386 * to send an extra '\0' in the string!
3388 int rad_chap_encode(RADIUS_PACKET *packet, uint8_t *output, int id,
3389 VALUE_PAIR *password)
3393 uint8_t string[MAX_STRING_LEN * 2 + 1];
3394 VALUE_PAIR *challenge;
3397 * Sanity check the input parameters
3399 if ((packet == NULL) || (password == NULL)) {
3404 * Note that the password VP can be EITHER
3405 * a User-Password attribute (from a check-item list),
3406 * or a CHAP-Password attribute (the client asking
3407 * the library to encode it).
3415 memcpy(ptr, password->vp_strvalue, password->length);
3416 ptr += password->length;
3417 i += password->length;
3420 * Use Chap-Challenge pair if present,
3421 * Request-Authenticator otherwise.
3423 challenge = pairfind(packet->vps, PW_CHAP_CHALLENGE, 0);
3425 memcpy(ptr, challenge->vp_strvalue, challenge->length);
3426 i += challenge->length;
3428 memcpy(ptr, packet->vector, AUTH_VECTOR_LEN);
3429 i += AUTH_VECTOR_LEN;
3433 fr_md5_calc((uint8_t *)output + 1, (uint8_t *)string, i);
3440 * Seed the random number generator.
3442 * May be called any number of times.
3444 void fr_rand_seed(const void *data, size_t size)
3449 * Ensure that the pool is initialized.
3451 if (!fr_rand_initialized) {
3454 memset(&fr_rand_pool, 0, sizeof(fr_rand_pool));
3456 fd = open("/dev/urandom", O_RDONLY);
3462 while (total < sizeof(fr_rand_pool.randrsl)) {
3463 this = read(fd, fr_rand_pool.randrsl,
3464 sizeof(fr_rand_pool.randrsl) - total);
3465 if ((this < 0) && (errno != EINTR)) break;
3466 if (this > 0) total += this;
3470 fr_rand_pool.randrsl[0] = fd;
3471 fr_rand_pool.randrsl[1] = time(NULL);
3472 fr_rand_pool.randrsl[2] = errno;
3475 fr_randinit(&fr_rand_pool, 1);
3476 fr_rand_pool.randcnt = 0;
3477 fr_rand_initialized = 1;
3483 * Hash the user data
3486 if (!hash) hash = fr_rand();
3487 hash = fr_hash_update(data, size, hash);
3489 fr_rand_pool.randmem[fr_rand_pool.randcnt] ^= hash;
3494 * Return a 32-bit random number.
3496 uint32_t fr_rand(void)
3501 * Ensure that the pool is initialized.
3503 if (!fr_rand_initialized) {
3504 fr_rand_seed(NULL, 0);
3507 num = fr_rand_pool.randrsl[fr_rand_pool.randcnt++];
3508 if (fr_rand_pool.randcnt >= 256) {
3509 fr_rand_pool.randcnt = 0;
3510 fr_isaac(&fr_rand_pool);
3518 * Allocate a new RADIUS_PACKET
3520 RADIUS_PACKET *rad_alloc(int newvector)
3524 if ((rp = malloc(sizeof(RADIUS_PACKET))) == NULL) {
3525 fr_strerror_printf("out of memory");
3528 memset(rp, 0, sizeof(*rp));
3534 uint32_t hash, base;
3537 * Don't expose the actual contents of the random
3541 for (i = 0; i < AUTH_VECTOR_LEN; i += sizeof(uint32_t)) {
3542 hash = fr_rand() ^ base;
3543 memcpy(rp->vector + i, &hash, sizeof(hash));
3546 fr_rand(); /* stir the pool again */
3551 RADIUS_PACKET *rad_alloc_reply(RADIUS_PACKET *packet)
3553 RADIUS_PACKET *reply;
3555 if (!packet) return NULL;
3557 reply = rad_alloc(0);
3558 if (!reply) return NULL;
3561 * Initialize the fields from the request.
3563 reply->sockfd = packet->sockfd;
3564 reply->dst_ipaddr = packet->src_ipaddr;
3565 reply->src_ipaddr = packet->dst_ipaddr;
3566 reply->dst_port = packet->src_port;
3567 reply->src_port = packet->dst_port;
3568 reply->id = packet->id;
3569 reply->code = 0; /* UNKNOWN code */
3570 memcpy(reply->vector, packet->vector,
3571 sizeof(reply->vector));
3574 reply->data_len = 0;
3581 * Free a RADIUS_PACKET
3583 void rad_free(RADIUS_PACKET **radius_packet_ptr)
3585 RADIUS_PACKET *radius_packet;
3587 if (!radius_packet_ptr || !*radius_packet_ptr) return;
3588 radius_packet = *radius_packet_ptr;
3590 free(radius_packet->data);
3592 pairfree(&radius_packet->vps);
3594 free(radius_packet);
3596 *radius_packet_ptr = NULL;