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 uint8_t *vp2data(const RADIUS_PACKET *packet,
640 const RADIUS_PACKET *original,
641 const char *secret, const VALUE_PAIR *vp, uint8_t *ptr,
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 < 18) return ptr;
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 make_tunnel_passwd(ptr, &len, data, len, room,
760 secret, original->vector);
762 case PW_ACCOUNTING_REQUEST:
763 case PW_DISCONNECT_REQUEST:
765 make_tunnel_passwd(ptr, &len, data, len, room,
766 secret, packet->vector);
772 * The code above ensures that this attribute
775 case FLAG_ENCRYPT_ASCEND_SECRET:
776 make_secret(ptr, packet->vector, secret, data);
777 len = AUTH_VECTOR_LEN;
783 * Just copy the data over
785 memcpy(ptr, data, len);
787 } /* switch over encryption flags */
793 static int packvp(const RADIUS_PACKET *packet,
794 const RADIUS_PACKET *original,
795 const char *secret, const VALUE_PAIR *vp,
796 uint8_t *start, size_t room)
798 uint8_t *ptr = start;
802 * Insert tags for string attributes. They go BEFORE
805 if (vp->flags.has_tag && (vp->type == PW_TYPE_STRING) &&
806 (TAG_VALID(vp->flags.tag) ||
807 (vp->flags.encrypt == FLAG_ENCRYPT_TUNNEL_PASSWORD))) {
808 if (room < (1 + vp->length)) return 0;
810 ptr[0] = vp->flags.tag;
811 end = vp2data(packet, original, secret, vp, ptr + 1,
814 if (room < vp->length) return 0;
815 end = vp2data(packet, original, secret, vp, ptr, room);
820 * Insert tags for integer attributes. They go at the START
821 * of the integer, and over-write the first byte.
823 if (vp->flags.has_tag && (vp->type == PW_TYPE_INTEGER)) {
824 ptr[0] = vp->flags.tag;
830 static int rad_vp2rfc(const RADIUS_PACKET *packet,
831 const RADIUS_PACKET *original,
832 const char *secret, const VALUE_PAIR *vp,
833 unsigned int attribute, uint8_t *ptr, size_t room)
837 if (room < 2) return 0;
839 ptr[0] = attribute & 0xff; /* NOT vp->attribute */
842 len = packvp(packet, original, secret, vp, ptr + 2, room - 2);
843 if (len < 0) return len;
846 * RFC 2865 section 5 says that zero-length attributes
849 * ... and the WiMAX forum ignores this... because of
850 * one vendor. Don't they have anything better to do
853 if ((len == 0) && (vp->vendor == 0) &&
854 (vp->attribute != PW_CHARGEABLE_USER_IDENTITY)) return 0;
863 * Parse a data structure into a RADIUS attribute.
865 int rad_vp2attr(const RADIUS_PACKET *packet, const RADIUS_PACKET *original,
866 const char *secret, const VALUE_PAIR *vp, uint8_t *start,
870 int len, total_length;
872 uint8_t *ptr, *length_ptr, *vsa_length_ptr, *tlv_length_ptr;
873 uint8_t *sub_length_ptr; /* evil */
876 vendorcode = total_length = 0;
877 length_ptr = vsa_length_ptr = tlv_length_ptr = sub_length_ptr = NULL;
880 * For interoperability, always put vendor attributes
881 * into their own VSA.
883 if ((vendorcode = vp->vendor) == 0) {
884 if (room < 2) return 0;
887 *(ptr++) = vp->attribute & 0xff;
896 DICT_VENDOR *dv = dict_vendorbyvalue(vendorcode);
899 * This must be an RFC-format attribute. If it
900 * wasn't, then the "decode" function would have
901 * made a Vendor-Specific attribute (i.e. type
902 * 26), and we would have "vendorcode == 0" here.
906 vsa_llen = dv->length;
907 if (dv->flags) vsa_offset = 1;
910 if (room < (6 + vsa_tlen + vsa_llen + vsa_offset)) return 0;
911 room -= 6 + vsa_tlen + vsa_llen + vsa_offset;
914 * Build a VSA header.
916 *ptr++ = PW_VENDOR_SPECIFIC;
917 vsa_length_ptr = ptr;
919 lvalue = htonl(vendorcode);
920 memcpy(ptr, &lvalue, 4);
926 ptr[0] = (vp->attribute & 0xFF);
930 ptr[0] = ((vp->attribute >> 8) & 0xFF);
931 ptr[1] = (vp->attribute & 0xFF);
937 ptr[2] = ((vp->attribute >> 8) & 0xFF);
938 ptr[3] = (vp->attribute & 0xFF);
942 return 0; /* silently discard it */
948 length_ptr = vsa_length_ptr;
949 vsa_length_ptr = NULL;
958 length_ptr = ptr + 1;
962 return 0; /* silently discard it */
967 * Allow for some continuation.
974 * Ignore TLVs that don't have data, OR
975 * have too much data to fit in the
976 * packet, OR have too much data to fit
979 * This shouldn't happen in normal
980 * operation, as the code assumes that
981 * the "tlv" type shouldn't be used.
983 if (vp->flags.has_tlv &&
984 (!vp->vp_tlv || (vp->length > room) ||
987 * 6 + 1 (vsa_tlen) + 1 (vsa_llen)
990 (vp->length > (255 - 9)))) return 0;
994 * sub-TLV's can only be in one format.
996 if (vp->flags.is_tlv) {
997 if (room < 2) return 0;
1000 *(ptr++) = (vp->attribute & 0xff00) >> 8;
1001 tlv_length_ptr = ptr;
1006 * WiMAX is like sticking knitting
1007 * needles up your nose, and claiming
1010 if ((vp->attribute & 0xff0000) != 0) {
1011 *(ptr++) = (vp->attribute >> 16) & 0xff;
1012 sub_length_ptr = ptr;
1015 *tlv_length_ptr += 2;
1020 total_length += vsa_tlen + vsa_llen + vsa_offset;
1021 if (vsa_length_ptr) *vsa_length_ptr += vsa_tlen + vsa_llen + vsa_offset;
1022 *length_ptr += vsa_tlen + vsa_llen + vsa_offset;
1025 len = packvp(packet, original, secret, vp, ptr, room);
1026 if (len < 0) return len;
1029 * RFC 2865 section 5 says that zero-length attributes
1032 * ... and the WiMAX forum ignores this... because of
1033 * one vendor. Don't they have anything better to do
1037 (vp->attribute != PW_CHARGEABLE_USER_IDENTITY)) return 0;
1040 * Update the various lengths.
1043 if (vsa_length_ptr) *vsa_length_ptr += len;
1044 if (tlv_length_ptr) *tlv_length_ptr += len;
1045 if (sub_length_ptr) *sub_length_ptr += len;
1047 total_length += len;
1049 return total_length; /* of attribute */
1055 #define REORDER(x) ((x & 0xff00) << 8) | ((x & 0xff0000) >> 8) | ((x & 0xff000000 >> 24))
1057 static int rad_encode_wimax(const RADIUS_PACKET *packet,
1058 const RADIUS_PACKET *original,
1059 const char *secret, VALUE_PAIR *reply,
1060 uint8_t *start, size_t room)
1062 int len, total_len = 0;
1063 uint8_t *wimax = NULL;
1064 uint8_t *ptr = start;
1066 VALUE_PAIR *vp = reply;
1069 * Swap the order of the WiMAX hacks, to make later
1070 * comparisons easier.
1072 maxattr = REORDER(vp->attribute);
1075 len = rad_vp2attr(packet, original, secret, vp, ptr,
1076 (start + room) - ptr);
1077 if (len <= 0) return total_len;
1080 * After adding an attribute with the simplest encoding,
1081 * check to see if we can append it to the previous one.
1084 if ((wimax[1] + (ptr[1] - 6)) <= 255) {
1088 memmove(ptr, ptr + 9, hack);
1094 * See if we can nest sub-TLVs, too, in
1095 * order to shorten the encoding.
1099 wimax[8] = 0x80; /* set continuation */
1109 vp->flags.encoded = 1;
1113 * Look at the NEXT tlv. Ensure that we encode
1114 * attributes into a common VSA *only* if they are for
1115 * the same WiMAX VSA, AND if the TLVs are in numerically
1118 if (vp && vp->flags.is_tlv && (reply->vendor == vp->vendor) &&
1119 ((reply->attribute & 0xff) == (vp->attribute & 0xff))) {
1122 attr = REORDER(vp->attribute);
1123 if (attr >= maxattr) {
1136 int rad_encode(RADIUS_PACKET *packet, const RADIUS_PACKET *original,
1139 radius_packet_t *hdr;
1141 uint16_t total_length;
1145 char ip_buffer[128];
1148 * A 4K packet, aligned on 64-bits.
1150 uint64_t data[MAX_PACKET_LEN / sizeof(uint64_t)];
1152 if ((packet->code > 0) && (packet->code < FR_MAX_PACKET_CODE)) {
1153 what = fr_packet_codes[packet->code];
1158 DEBUG("Sending %s of id %d to %s port %d\n",
1160 inet_ntop(packet->dst_ipaddr.af,
1161 &packet->dst_ipaddr.ipaddr,
1162 ip_buffer, sizeof(ip_buffer)),
1166 * Double-check some things based on packet code.
1168 switch (packet->code) {
1169 case PW_AUTHENTICATION_ACK:
1170 case PW_AUTHENTICATION_REJECT:
1171 case PW_ACCESS_CHALLENGE:
1173 fr_strerror_printf("ERROR: Cannot sign response packet without a request packet.");
1179 * These packet vectors start off as all zero.
1181 case PW_ACCOUNTING_REQUEST:
1182 case PW_DISCONNECT_REQUEST:
1183 case PW_COA_REQUEST:
1184 memset(packet->vector, 0, sizeof(packet->vector));
1192 * Use memory on the stack, until we know how
1193 * large the packet will be.
1195 hdr = (radius_packet_t *) data;
1198 * Build standard header
1200 hdr->code = packet->code;
1201 hdr->id = packet->id;
1203 memcpy(hdr->vector, packet->vector, sizeof(hdr->vector));
1205 total_length = AUTH_HDR_LEN;
1208 * Load up the configuration values for the user
1214 * FIXME: Loop twice over the reply list. The first time,
1215 * calculate the total length of data. The second time,
1216 * allocate the memory, and fill in the VP's.
1218 * Hmm... this may be slower than just doing a small
1223 * Loop over the reply attributes for the packet.
1225 for (reply = packet->vps; reply; reply = reply->next) {
1227 * Ignore non-wire attributes
1229 if ((reply->vendor == 0) &&
1230 ((reply->attribute & 0xFFFF) > 0xff)) {
1233 * Permit the admin to send BADLY formatted
1234 * attributes with a debug build.
1236 if (reply->attribute == PW_RAW_ATTRIBUTE) {
1237 memcpy(ptr, reply->vp_octets, reply->length);
1238 len = reply->length;
1246 * Set the Message-Authenticator to the correct
1247 * length and initial value.
1249 if (reply->attribute == PW_MESSAGE_AUTHENTICATOR) {
1250 reply->length = AUTH_VECTOR_LEN;
1251 memset(reply->vp_strvalue, 0, AUTH_VECTOR_LEN);
1254 * Cache the offset to the
1255 * Message-Authenticator
1257 packet->offset = total_length;
1261 * Print out ONLY the attributes which
1262 * we're sending over the wire, and print
1263 * them out BEFORE they're encrypted.
1268 * Skip attributes that are encoded.
1270 if (reply->flags.encoded) continue;
1272 if (reply->flags.is_tlv) {
1273 len = rad_encode_wimax(packet, original, secret,
1275 ((uint8_t *) data) + sizeof(data) - ptr);
1278 len = rad_vp2attr(packet, original, secret, reply, ptr,
1279 ((uint8_t *) data) + sizeof(data) - ptr);
1282 if (len < 0) return -1;
1286 total_length += len;
1287 } /* done looping over all attributes */
1290 * Fill in the rest of the fields, and copy the data over
1291 * from the local stack to the newly allocated memory.
1293 * Yes, all this 'memcpy' is slow, but it means
1294 * that we only allocate the minimum amount of
1295 * memory for a request.
1297 packet->data_len = total_length;
1298 packet->data = (uint8_t *) malloc(packet->data_len);
1299 if (!packet->data) {
1300 fr_strerror_printf("Out of memory");
1304 memcpy(packet->data, hdr, packet->data_len);
1305 hdr = (radius_packet_t *) packet->data;
1307 total_length = htons(total_length);
1308 memcpy(hdr->length, &total_length, sizeof(total_length));
1315 * Sign a previously encoded packet.
1317 int rad_sign(RADIUS_PACKET *packet, const RADIUS_PACKET *original,
1320 radius_packet_t *hdr = (radius_packet_t *)packet->data;
1323 * It wasn't assigned an Id, this is bad!
1325 if (packet->id < 0) {
1326 fr_strerror_printf("ERROR: RADIUS packets must be assigned an Id.");
1330 if (!packet->data || (packet->data_len < AUTH_HDR_LEN) ||
1331 (packet->offset < 0)) {
1332 fr_strerror_printf("ERROR: You must call rad_encode() before rad_sign()");
1337 * If there's a Message-Authenticator, update it
1338 * now, BEFORE updating the authentication vector.
1340 if (packet->offset > 0) {
1341 uint8_t calc_auth_vector[AUTH_VECTOR_LEN];
1343 switch (packet->code) {
1344 case PW_ACCOUNTING_REQUEST:
1345 case PW_ACCOUNTING_RESPONSE:
1346 case PW_DISCONNECT_REQUEST:
1347 case PW_DISCONNECT_ACK:
1348 case PW_DISCONNECT_NAK:
1349 case PW_COA_REQUEST:
1352 memset(hdr->vector, 0, AUTH_VECTOR_LEN);
1355 case PW_AUTHENTICATION_ACK:
1356 case PW_AUTHENTICATION_REJECT:
1357 case PW_ACCESS_CHALLENGE:
1359 fr_strerror_printf("ERROR: Cannot sign response packet without a request packet.");
1362 memcpy(hdr->vector, original->vector,
1366 default: /* others have vector already set to zero */
1372 * Set the authentication vector to zero,
1373 * calculate the signature, and put it
1374 * into the Message-Authenticator
1377 fr_hmac_md5(packet->data, packet->data_len,
1378 (const uint8_t *) secret, strlen(secret),
1380 memcpy(packet->data + packet->offset + 2,
1381 calc_auth_vector, AUTH_VECTOR_LEN);
1384 * Copy the original request vector back
1385 * to the raw packet.
1387 memcpy(hdr->vector, packet->vector, AUTH_VECTOR_LEN);
1391 * Switch over the packet code, deciding how to
1394 switch (packet->code) {
1396 * Request packets are not signed, bur
1397 * have a random authentication vector.
1399 case PW_AUTHENTICATION_REQUEST:
1400 case PW_STATUS_SERVER:
1404 * Reply packets are signed with the
1405 * authentication vector of the request.
1412 fr_MD5Init(&context);
1413 fr_MD5Update(&context, packet->data, packet->data_len);
1414 fr_MD5Update(&context, (const uint8_t *) secret,
1416 fr_MD5Final(digest, &context);
1418 memcpy(hdr->vector, digest, AUTH_VECTOR_LEN);
1419 memcpy(packet->vector, digest, AUTH_VECTOR_LEN);
1422 }/* switch over packet codes */
1428 * Reply to the request. Also attach
1429 * reply attribute value pairs and any user message provided.
1431 int rad_send(RADIUS_PACKET *packet, const RADIUS_PACKET *original,
1436 char ip_buffer[128];
1439 * Maybe it's a fake packet. Don't send it.
1441 if (!packet || (packet->sockfd < 0)) {
1445 if ((packet->code > 0) && (packet->code < FR_MAX_PACKET_CODE)) {
1446 what = fr_packet_codes[packet->code];
1452 * First time through, allocate room for the packet
1454 if (!packet->data) {
1456 * Encode the packet.
1458 if (rad_encode(packet, original, secret) < 0) {
1463 * Re-sign it, including updating the
1464 * Message-Authenticator.
1466 if (rad_sign(packet, original, secret) < 0) {
1471 * If packet->data points to data, then we print out
1472 * the VP list again only for debugging.
1474 } else if (fr_debug_flag) {
1475 DEBUG("Sending %s of id %d to %s port %d\n", what, packet->id,
1476 inet_ntop(packet->dst_ipaddr.af,
1477 &packet->dst_ipaddr.ipaddr,
1478 ip_buffer, sizeof(ip_buffer)),
1481 for (reply = packet->vps; reply; reply = reply->next) {
1482 if ((reply->vendor == 0) &&
1483 ((reply->attribute & 0xFFFF) > 0xff)) continue;
1489 * And send it on it's way.
1491 return rad_sendto(packet->sockfd, packet->data, packet->data_len, 0,
1492 &packet->src_ipaddr, packet->src_port,
1493 &packet->dst_ipaddr, packet->dst_port);
1497 * Do a comparison of two authentication digests by comparing
1498 * the FULL digest. Otehrwise, the server can be subject to
1499 * timing attacks that allow attackers find a valid message
1502 * http://www.cs.rice.edu/~dwallach/pub/crosby-timing2009.pdf
1504 static int digest_cmp(const uint8_t *a, const uint8_t *b, size_t length)
1509 for (i = 0; i < length; i++) {
1510 result |= a[i] ^ b[i];
1513 return result; /* 0 is OK, !0 is !OK, just like memcmp */
1518 * Validates the requesting client NAS. Calculates the
1519 * signature based on the clients private key.
1521 static int calc_acctdigest(RADIUS_PACKET *packet, const char *secret)
1523 uint8_t digest[AUTH_VECTOR_LEN];
1527 * Zero out the auth_vector in the received packet.
1528 * Then append the shared secret to the received packet,
1529 * and calculate the MD5 sum. This must be the same
1530 * as the original MD5 sum (packet->vector).
1532 memset(packet->data + 4, 0, AUTH_VECTOR_LEN);
1535 * MD5(packet + secret);
1537 fr_MD5Init(&context);
1538 fr_MD5Update(&context, packet->data, packet->data_len);
1539 fr_MD5Update(&context, (const uint8_t *) secret, strlen(secret));
1540 fr_MD5Final(digest, &context);
1543 * Return 0 if OK, 2 if not OK.
1545 if (digest_cmp(digest, packet->vector, AUTH_VECTOR_LEN) != 0) return 2;
1551 * Validates the requesting client NAS. Calculates the
1552 * signature based on the clients private key.
1554 static int calc_replydigest(RADIUS_PACKET *packet, RADIUS_PACKET *original,
1557 uint8_t calc_digest[AUTH_VECTOR_LEN];
1563 if (original == NULL) {
1568 * Copy the original vector in place.
1570 memcpy(packet->data + 4, original->vector, AUTH_VECTOR_LEN);
1573 * MD5(packet + secret);
1575 fr_MD5Init(&context);
1576 fr_MD5Update(&context, packet->data, packet->data_len);
1577 fr_MD5Update(&context, (const uint8_t *) secret, strlen(secret));
1578 fr_MD5Final(calc_digest, &context);
1581 * Copy the packet's vector back to the packet.
1583 memcpy(packet->data + 4, packet->vector, AUTH_VECTOR_LEN);
1586 * Return 0 if OK, 2 if not OK.
1588 if (digest_cmp(packet->vector, calc_digest, AUTH_VECTOR_LEN) != 0) return 2;
1594 * See if the data pointed to by PTR is a valid RADIUS packet.
1596 * packet is not 'const * const' because we may update data_len,
1597 * if there's more data in the UDP packet than in the RADIUS packet.
1599 int rad_packet_ok(RADIUS_PACKET *packet, int flags)
1604 radius_packet_t *hdr;
1605 char host_ipaddr[128];
1611 * Check for packets smaller than the packet header.
1613 * RFC 2865, Section 3., subsection 'length' says:
1615 * "The minimum length is 20 ..."
1617 if (packet->data_len < AUTH_HDR_LEN) {
1618 fr_strerror_printf("WARNING: Malformed RADIUS packet from host %s: too short (received %d < minimum %d)",
1619 inet_ntop(packet->src_ipaddr.af,
1620 &packet->src_ipaddr.ipaddr,
1621 host_ipaddr, sizeof(host_ipaddr)),
1622 (int) packet->data_len, AUTH_HDR_LEN);
1627 * RFC 2865, Section 3., subsection 'length' says:
1629 * " ... and maximum length is 4096."
1631 if (packet->data_len > MAX_PACKET_LEN) {
1632 fr_strerror_printf("WARNING: Malformed RADIUS packet from host %s: too long (received %d > maximum %d)",
1633 inet_ntop(packet->src_ipaddr.af,
1634 &packet->src_ipaddr.ipaddr,
1635 host_ipaddr, sizeof(host_ipaddr)),
1636 (int) packet->data_len, MAX_PACKET_LEN);
1641 * Check for packets with mismatched size.
1642 * i.e. We've received 128 bytes, and the packet header
1643 * says it's 256 bytes long.
1645 totallen = (packet->data[2] << 8) | packet->data[3];
1646 hdr = (radius_packet_t *)packet->data;
1649 * Code of 0 is not understood.
1650 * Code of 16 or greate is not understood.
1652 if ((hdr->code == 0) ||
1653 (hdr->code >= FR_MAX_PACKET_CODE)) {
1654 fr_strerror_printf("WARNING: Bad RADIUS packet from host %s: unknown packet code%d ",
1655 inet_ntop(packet->src_ipaddr.af,
1656 &packet->src_ipaddr.ipaddr,
1657 host_ipaddr, sizeof(host_ipaddr)),
1663 * Message-Authenticator is required in Status-Server
1664 * packets, otherwise they can be trivially forged.
1666 if (hdr->code == PW_STATUS_SERVER) require_ma = 1;
1669 * It's also required if the caller asks for it.
1671 if (flags) require_ma = 1;
1674 * Repeat the length checks. This time, instead of
1675 * looking at the data we received, look at the value
1676 * of the 'length' field inside of the packet.
1678 * Check for packets smaller than the packet header.
1680 * RFC 2865, Section 3., subsection 'length' says:
1682 * "The minimum length is 20 ..."
1684 if (totallen < AUTH_HDR_LEN) {
1685 fr_strerror_printf("WARNING: Malformed RADIUS packet from host %s: too short (length %d < minimum %d)",
1686 inet_ntop(packet->src_ipaddr.af,
1687 &packet->src_ipaddr.ipaddr,
1688 host_ipaddr, sizeof(host_ipaddr)),
1689 totallen, AUTH_HDR_LEN);
1694 * And again, for the value of the 'length' field.
1696 * RFC 2865, Section 3., subsection 'length' says:
1698 * " ... and maximum length is 4096."
1700 if (totallen > MAX_PACKET_LEN) {
1701 fr_strerror_printf("WARNING: Malformed RADIUS packet from host %s: too long (length %d > maximum %d)",
1702 inet_ntop(packet->src_ipaddr.af,
1703 &packet->src_ipaddr.ipaddr,
1704 host_ipaddr, sizeof(host_ipaddr)),
1705 totallen, MAX_PACKET_LEN);
1710 * RFC 2865, Section 3., subsection 'length' says:
1712 * "If the packet is shorter than the Length field
1713 * indicates, it MUST be silently discarded."
1715 * i.e. No response to the NAS.
1717 if (packet->data_len < totallen) {
1718 fr_strerror_printf("WARNING: Malformed RADIUS packet from host %s: received %d octets, packet length says %d",
1719 inet_ntop(packet->src_ipaddr.af,
1720 &packet->src_ipaddr.ipaddr,
1721 host_ipaddr, sizeof(host_ipaddr)),
1722 (int) packet->data_len, totallen);
1727 * RFC 2865, Section 3., subsection 'length' says:
1729 * "Octets outside the range of the Length field MUST be
1730 * treated as padding and ignored on reception."
1732 if (packet->data_len > totallen) {
1734 * We're shortening the packet below, but just
1735 * to be paranoid, zero out the extra data.
1737 memset(packet->data + totallen, 0, packet->data_len - totallen);
1738 packet->data_len = totallen;
1742 * Walk through the packet's attributes, ensuring that
1743 * they add up EXACTLY to the size of the packet.
1745 * If they don't, then the attributes either under-fill
1746 * or over-fill the packet. Any parsing of the packet
1747 * is impossible, and will result in unknown side effects.
1749 * This would ONLY happen with buggy RADIUS implementations,
1750 * or with an intentional attack. Either way, we do NOT want
1751 * to be vulnerable to this problem.
1754 count = totallen - AUTH_HDR_LEN;
1759 * Attribute number zero is NOT defined.
1762 fr_strerror_printf("WARNING: Malformed RADIUS packet from host %s: Invalid attribute 0",
1763 inet_ntop(packet->src_ipaddr.af,
1764 &packet->src_ipaddr.ipaddr,
1765 host_ipaddr, sizeof(host_ipaddr)));
1770 * Attributes are at LEAST as long as the ID & length
1771 * fields. Anything shorter is an invalid attribute.
1774 fr_strerror_printf("WARNING: Malformed RADIUS packet from host %s: attribute %d too short",
1775 inet_ntop(packet->src_ipaddr.af,
1776 &packet->src_ipaddr.ipaddr,
1777 host_ipaddr, sizeof(host_ipaddr)),
1783 * Sanity check the attributes for length.
1786 default: /* don't do anything by default */
1790 * If there's an EAP-Message, we require
1791 * a Message-Authenticator.
1793 case PW_EAP_MESSAGE:
1797 case PW_MESSAGE_AUTHENTICATOR:
1798 if (attr[1] != 2 + AUTH_VECTOR_LEN) {
1799 fr_strerror_printf("WARNING: Malformed RADIUS packet from host %s: Message-Authenticator has invalid length %d",
1800 inet_ntop(packet->src_ipaddr.af,
1801 &packet->src_ipaddr.ipaddr,
1802 host_ipaddr, sizeof(host_ipaddr)),
1811 * FIXME: Look up the base 255 attributes in the
1812 * dictionary, and switch over their type. For
1813 * integer/date/ip, the attribute length SHOULD
1816 count -= attr[1]; /* grab the attribute length */
1818 num_attributes++; /* seen one more attribute */
1822 * If the attributes add up to a packet, it's allowed.
1824 * If not, we complain, and throw the packet away.
1827 fr_strerror_printf("WARNING: Malformed RADIUS packet from host %s: packet attributes do NOT exactly fill the packet",
1828 inet_ntop(packet->src_ipaddr.af,
1829 &packet->src_ipaddr.ipaddr,
1830 host_ipaddr, sizeof(host_ipaddr)));
1835 * If we're configured to look for a maximum number of
1836 * attributes, and we've seen more than that maximum,
1837 * then throw the packet away, as a possible DoS.
1839 if ((fr_max_attributes > 0) &&
1840 (num_attributes > fr_max_attributes)) {
1841 fr_strerror_printf("WARNING: Possible DoS attack from host %s: Too many attributes in request (received %d, max %d are allowed).",
1842 inet_ntop(packet->src_ipaddr.af,
1843 &packet->src_ipaddr.ipaddr,
1844 host_ipaddr, sizeof(host_ipaddr)),
1845 num_attributes, fr_max_attributes);
1850 * http://www.freeradius.org/rfc/rfc2869.html#EAP-Message
1852 * A packet with an EAP-Message attribute MUST also have
1853 * a Message-Authenticator attribute.
1855 * A Message-Authenticator all by itself is OK, though.
1857 * Similarly, Status-Server packets MUST contain
1858 * Message-Authenticator attributes.
1860 if (require_ma && ! seen_ma) {
1861 fr_strerror_printf("WARNING: Insecure packet from host %s: Packet does not contain required Message-Authenticator attribute",
1862 inet_ntop(packet->src_ipaddr.af,
1863 &packet->src_ipaddr.ipaddr,
1864 host_ipaddr, sizeof(host_ipaddr)));
1869 * Fill RADIUS header fields
1871 packet->code = hdr->code;
1872 packet->id = hdr->id;
1873 memcpy(packet->vector, hdr->vector, AUTH_VECTOR_LEN);
1880 * Receive UDP client requests, and fill in
1881 * the basics of a RADIUS_PACKET structure.
1883 RADIUS_PACKET *rad_recv(int fd, int flags)
1886 RADIUS_PACKET *packet;
1889 * Allocate the new request data structure
1891 if ((packet = malloc(sizeof(*packet))) == NULL) {
1892 fr_strerror_printf("out of memory");
1895 memset(packet, 0, sizeof(*packet));
1898 sock_flags = MSG_PEEK;
1902 packet->data_len = rad_recvfrom(fd, &packet->data, sock_flags,
1903 &packet->src_ipaddr, &packet->src_port,
1904 &packet->dst_ipaddr, &packet->dst_port);
1907 * Check for socket errors.
1909 if (packet->data_len < 0) {
1910 fr_strerror_printf("Error receiving packet: %s", strerror(errno));
1911 /* packet->data is NULL */
1917 * If the packet is too big, then rad_recvfrom did NOT
1918 * allocate memory. Instead, it just discarded the
1921 if (packet->data_len > MAX_PACKET_LEN) {
1922 fr_strerror_printf("Discarding packet: Larger than RFC limitation of 4096 bytes.");
1923 /* packet->data is NULL */
1929 * Read no data. Continue.
1930 * This check is AFTER the MAX_PACKET_LEN check above, because
1931 * if the packet is larger than MAX_PACKET_LEN, we also have
1932 * packet->data == NULL
1934 if ((packet->data_len == 0) || !packet->data) {
1935 fr_strerror_printf("Empty packet: Socket is not ready.");
1941 * See if it's a well-formed RADIUS packet.
1943 if (!rad_packet_ok(packet, flags)) {
1949 * Remember which socket we read the packet from.
1951 packet->sockfd = fd;
1954 * FIXME: Do even more filtering by only permitting
1955 * certain IP's. The problem is that we don't know
1956 * how to do this properly for all possible clients...
1960 * Explicitely set the VP list to empty.
1964 if (fr_debug_flag) {
1965 char host_ipaddr[128];
1967 if ((packet->code > 0) && (packet->code < FR_MAX_PACKET_CODE)) {
1968 DEBUG("rad_recv: %s packet from host %s port %d",
1969 fr_packet_codes[packet->code],
1970 inet_ntop(packet->src_ipaddr.af,
1971 &packet->src_ipaddr.ipaddr,
1972 host_ipaddr, sizeof(host_ipaddr)),
1975 DEBUG("rad_recv: Packet from host %s port %d code=%d",
1976 inet_ntop(packet->src_ipaddr.af,
1977 &packet->src_ipaddr.ipaddr,
1978 host_ipaddr, sizeof(host_ipaddr)),
1982 DEBUG(", id=%d, length=%d\n",
1983 packet->id, (int) packet->data_len);
1991 * Verify the signature of a packet.
1993 int rad_verify(RADIUS_PACKET *packet, RADIUS_PACKET *original,
2000 if (!packet || !packet->data) return -1;
2003 * Before we allocate memory for the attributes, do more
2006 ptr = packet->data + AUTH_HDR_LEN;
2007 length = packet->data_len - AUTH_HDR_LEN;
2008 while (length > 0) {
2009 uint8_t msg_auth_vector[AUTH_VECTOR_LEN];
2010 uint8_t calc_auth_vector[AUTH_VECTOR_LEN];
2015 default: /* don't do anything. */
2019 * Note that more than one Message-Authenticator
2020 * attribute is invalid.
2022 case PW_MESSAGE_AUTHENTICATOR:
2023 memcpy(msg_auth_vector, &ptr[2], sizeof(msg_auth_vector));
2024 memset(&ptr[2], 0, AUTH_VECTOR_LEN);
2026 switch (packet->code) {
2030 case PW_ACCOUNTING_REQUEST:
2031 case PW_ACCOUNTING_RESPONSE:
2032 case PW_DISCONNECT_REQUEST:
2033 case PW_DISCONNECT_ACK:
2034 case PW_DISCONNECT_NAK:
2035 case PW_COA_REQUEST:
2038 memset(packet->data + 4, 0, AUTH_VECTOR_LEN);
2041 case PW_AUTHENTICATION_ACK:
2042 case PW_AUTHENTICATION_REJECT:
2043 case PW_ACCESS_CHALLENGE:
2045 fr_strerror_printf("ERROR: Cannot validate Message-Authenticator in response packet without a request packet.");
2048 memcpy(packet->data + 4, original->vector, AUTH_VECTOR_LEN);
2052 fr_hmac_md5(packet->data, packet->data_len,
2053 (const uint8_t *) secret, strlen(secret),
2055 if (digest_cmp(calc_auth_vector, msg_auth_vector,
2056 sizeof(calc_auth_vector)) != 0) {
2058 fr_strerror_printf("Received packet from %s with invalid Message-Authenticator! (Shared secret is incorrect.)",
2059 inet_ntop(packet->src_ipaddr.af,
2060 &packet->src_ipaddr.ipaddr,
2061 buffer, sizeof(buffer)));
2062 /* Silently drop packet, according to RFC 3579 */
2064 } /* else the message authenticator was good */
2067 * Reinitialize Authenticators.
2069 memcpy(&ptr[2], msg_auth_vector, AUTH_VECTOR_LEN);
2070 memcpy(packet->data + 4, packet->vector, AUTH_VECTOR_LEN);
2072 } /* switch over the attributes */
2076 } /* loop over the packet, sanity checking the attributes */
2079 * It looks like a RADIUS packet, but we can't validate
2082 if ((packet->code == 0) || (packet->code >= FR_MAX_PACKET_CODE)) {
2084 fr_strerror_printf("Received Unknown packet code %d "
2085 "from client %s port %d: Cannot validate signature.",
2087 inet_ntop(packet->src_ipaddr.af,
2088 &packet->src_ipaddr.ipaddr,
2089 buffer, sizeof(buffer)),
2095 * Calculate and/or verify digest.
2097 switch(packet->code) {
2101 case PW_AUTHENTICATION_REQUEST:
2102 case PW_STATUS_SERVER:
2104 * The authentication vector is random
2105 * nonsense, invented by the client.
2109 case PW_COA_REQUEST:
2110 case PW_DISCONNECT_REQUEST:
2111 case PW_ACCOUNTING_REQUEST:
2112 if (calc_acctdigest(packet, secret) > 1) {
2113 fr_strerror_printf("Received %s packet "
2114 "from %s with invalid signature! (Shared secret is incorrect.)",
2115 fr_packet_codes[packet->code],
2116 inet_ntop(packet->src_ipaddr.af,
2117 &packet->src_ipaddr.ipaddr,
2118 buffer, sizeof(buffer)));
2123 /* Verify the reply digest */
2124 case PW_AUTHENTICATION_ACK:
2125 case PW_AUTHENTICATION_REJECT:
2126 case PW_ACCESS_CHALLENGE:
2127 case PW_ACCOUNTING_RESPONSE:
2128 case PW_DISCONNECT_ACK:
2129 case PW_DISCONNECT_NAK:
2132 rcode = calc_replydigest(packet, original, secret);
2134 fr_strerror_printf("Received %s packet "
2135 "from client %s port %d with invalid signature (err=%d)! (Shared secret is incorrect.)",
2136 fr_packet_codes[packet->code],
2137 inet_ntop(packet->src_ipaddr.af,
2138 &packet->src_ipaddr.ipaddr,
2139 buffer, sizeof(buffer)),
2147 fr_strerror_printf("Received Unknown packet code %d "
2148 "from client %s port %d: Cannot validate signature",
2150 inet_ntop(packet->src_ipaddr.af,
2151 &packet->src_ipaddr.ipaddr,
2152 buffer, sizeof(buffer)),
2161 static VALUE_PAIR *data2vp(const RADIUS_PACKET *packet,
2162 const RADIUS_PACKET *original,
2163 const char *secret, size_t length,
2164 const uint8_t *data, VALUE_PAIR *vp)
2169 * If length is greater than 253, something is SERIOUSLY
2172 if (length > 253) length = 253; /* paranoia (pair-anoia?) */
2174 vp->length = length;
2175 vp->operator = T_OP_EQ;
2181 if (vp->flags.has_tag) {
2182 if (TAG_VALID(data[0]) ||
2183 (vp->flags.encrypt == FLAG_ENCRYPT_TUNNEL_PASSWORD)) {
2185 * Tunnel passwords REQUIRE a tag, even
2186 * if don't have a valid tag.
2188 vp->flags.tag = data[0];
2190 if ((vp->type == PW_TYPE_STRING) ||
2191 (vp->type == PW_TYPE_OCTETS)) offset = 1;
2196 * Copy the data to be decrypted
2198 memcpy(&vp->vp_octets[0], data + offset, length - offset);
2199 vp->length -= offset;
2202 * Decrypt the attribute.
2204 switch (vp->flags.encrypt) {
2208 case FLAG_ENCRYPT_USER_PASSWORD:
2210 rad_pwdecode((char *)vp->vp_strvalue,
2214 rad_pwdecode((char *)vp->vp_strvalue,
2218 if (vp->attribute == PW_USER_PASSWORD) {
2219 vp->length = strlen(vp->vp_strvalue);
2224 * Tunnel-Password's may go ONLY
2225 * in response packets.
2227 case FLAG_ENCRYPT_TUNNEL_PASSWORD:
2228 if (!original) goto raw;
2230 if (rad_tunnel_pwdecode(vp->vp_octets, &vp->length,
2231 secret, original->vector) < 0) {
2237 * Ascend-Send-Secret
2238 * Ascend-Receive-Secret
2240 case FLAG_ENCRYPT_ASCEND_SECRET:
2244 uint8_t my_digest[AUTH_VECTOR_LEN];
2245 make_secret(my_digest,
2248 memcpy(vp->vp_strvalue, my_digest,
2250 vp->vp_strvalue[AUTH_VECTOR_LEN] = '\0';
2251 vp->length = strlen(vp->vp_strvalue);
2257 } /* switch over encryption flags */
2261 case PW_TYPE_STRING:
2262 case PW_TYPE_OCTETS:
2263 case PW_TYPE_ABINARY:
2264 /* nothing more to do */
2268 if (vp->length != 1) goto raw;
2270 vp->vp_integer = vp->vp_octets[0];
2275 if (vp->length != 2) goto raw;
2277 vp->vp_integer = (vp->vp_octets[0] << 8) | vp->vp_octets[1];
2280 case PW_TYPE_INTEGER:
2281 if (vp->length != 4) goto raw;
2283 memcpy(&vp->vp_integer, vp->vp_octets, 4);
2284 vp->vp_integer = ntohl(vp->vp_integer);
2286 if (vp->flags.has_tag) vp->vp_integer &= 0x00ffffff;
2289 * Try to get named VALUEs
2293 dval = dict_valbyattr(vp->attribute, vp->vendor,
2296 strlcpy(vp->vp_strvalue,
2298 sizeof(vp->vp_strvalue));
2304 if (vp->length != 4) goto raw;
2306 memcpy(&vp->vp_date, vp->vp_octets, 4);
2307 vp->vp_date = ntohl(vp->vp_date);
2311 case PW_TYPE_IPADDR:
2312 if (vp->length != 4) goto raw;
2314 memcpy(&vp->vp_ipaddr, vp->vp_octets, 4);
2318 * IPv6 interface ID is 8 octets long.
2321 if (vp->length != 8) goto raw;
2322 /* vp->vp_ifid == vp->vp_octets */
2326 * IPv6 addresses are 16 octets long
2328 case PW_TYPE_IPV6ADDR:
2329 if (vp->length != 16) goto raw;
2330 /* vp->vp_ipv6addr == vp->vp_octets */
2334 * IPv6 prefixes are 2 to 18 octets long.
2336 * RFC 3162: The first octet is unused.
2337 * The second is the length of the prefix
2338 * the rest are the prefix data.
2340 * The prefix length can have value 0 to 128.
2342 case PW_TYPE_IPV6PREFIX:
2343 if (vp->length < 2 || vp->length > 18) goto raw;
2344 if (vp->vp_octets[1] > 128) goto raw;
2347 * FIXME: double-check that
2348 * (vp->vp_octets[1] >> 3) matches vp->length + 2
2350 if (vp->length < 18) {
2351 memset(vp->vp_octets + vp->length, 0,
2356 case PW_TYPE_SIGNED:
2357 if (vp->length != 4) goto raw;
2360 * Overload vp_integer for ntohl, which takes
2361 * uint32_t, not int32_t
2363 memcpy(&vp->vp_integer, vp->vp_octets, 4);
2364 vp->vp_integer = ntohl(vp->vp_integer);
2365 memcpy(&vp->vp_signed, &vp->vp_integer, 4);
2369 vp->length = length;
2370 vp->vp_tlv = malloc(length);
2373 fr_strerror_printf("No memory");
2376 memcpy(vp->vp_tlv, data, length);
2379 case PW_TYPE_COMBO_IP:
2380 if (vp->length == 4) {
2381 vp->type = PW_TYPE_IPADDR;
2382 memcpy(&vp->vp_ipaddr, vp->vp_octets, 4);
2385 } else if (vp->length == 16) {
2386 vp->type = PW_TYPE_IPV6ADDR;
2387 /* vp->vp_ipv6addr == vp->vp_octets */
2395 vp->type = PW_TYPE_OCTETS;
2396 vp->length = length;
2397 memcpy(vp->vp_octets, data, length);
2401 * Ensure there's no encryption or tag stuff,
2402 * we just pass the attribute as-is.
2404 memset(&vp->flags, 0, sizeof(vp->flags));
2410 static void rad_sortvp(VALUE_PAIR **head)
2413 VALUE_PAIR *vp, **tail;
2416 * Walk over the VP's, sorting them in order. Did I
2417 * mention that I hate WiMAX continuations?
2419 * And bubble sort! WTF is up with that?
2426 if (!vp->next) break;
2428 if (vp->attribute > vp->next->attribute) {
2430 vp->next = (*tail)->next;
2441 * Walk the packet, looking for continuations of this attribute.
2443 * This is (worst-case) O(N^2) in the number of RADIUS
2444 * attributes. That happens only when perverse clients create
2445 * continued attributes, AND separate the fragmented portions
2446 * with a lot of other attributes.
2448 * Sane clients should put the fragments next to each other, in
2449 * which case this is O(N), in the number of fragments.
2451 static uint8_t *rad_coalesce(unsigned int attribute, int vendor,
2452 size_t length, uint8_t *data,
2453 size_t packet_length, size_t *ptlv_length)
2457 size_t tlv_length = length;
2458 uint8_t *ptr, *tlv, *tlv_data;
2460 for (ptr = data + length;
2461 ptr != (data + packet_length);
2463 /* FIXME: Check that there are 6 bytes of data here... */
2464 if ((ptr[0] != PW_VENDOR_SPECIFIC) ||
2465 (ptr[1] < (2 + 4 + 3)) || /* WiMAX VSA with continuation */
2466 (ptr[2] != 0) || (ptr[3] != 0) || /* our requirement */
2467 (ptr[4] != ((vendor >> 8) & 0xff)) ||
2468 (ptr[5] != (vendor & 0xff))) {
2472 memcpy(&lvalue, ptr + 2, 4); /* Vendor Id */
2473 lvalue = ntohl(lvalue);
2475 lvalue |= ptr[2 + 4]; /* add in VSA number */
2476 if (lvalue != attribute) continue;
2479 * If the vendor-length is too small, it's badly
2480 * formed, so we stop.
2482 if ((ptr[2 + 4 + 1]) < 3) break;
2484 tlv_length += ptr[2 + 4 + 1] - 3;
2485 if ((ptr[2 + 4 + 1 + 1] & 0x80) == 0) break;
2488 tlv = tlv_data = malloc(tlv_length);
2489 if (!tlv_data) return NULL;
2491 memcpy(tlv, data, length);
2495 * Now we walk the list again, copying the data over to
2496 * our newly created memory.
2498 for (ptr = data + length;
2499 ptr != (data + packet_length);
2503 if ((ptr[0] != PW_VENDOR_SPECIFIC) ||
2504 (ptr[1] < (2 + 4 + 3)) || /* WiMAX VSA with continuation */
2505 (ptr[2] != 0) || (ptr[3] != 0)) { /* our requirement */
2509 memcpy(&lvalue, ptr + 2, 4);
2510 lvalue = ntohl(lvalue);
2512 lvalue |= ptr[2 + 4];
2513 if (lvalue != attribute) continue;
2516 * If the vendor-length is too small, it's badly
2517 * formed, so we stop.
2519 if ((ptr[2 + 4 + 1]) < 3) break;
2521 this_length = ptr[2 + 4 + 1] - 3;
2522 memcpy(tlv, ptr + 2 + 4 + 3, this_length);
2525 ptr[2 + 4] = 0; /* What a hack! */
2526 if ((ptr[2 + 4 + 1 + 1] & 0x80) == 0) break;
2529 *ptlv_length = tlv_length;
2534 * Walk over Evil WIMAX Hell, creating attributes.
2536 * Won't someone think of the children? What if they read this code?
2538 static VALUE_PAIR *recurse_evil(const RADIUS_PACKET *packet,
2539 const RADIUS_PACKET *original,
2541 int attribute, int vendor,
2542 uint8_t *ptr, size_t len)
2544 VALUE_PAIR *head = NULL;
2545 VALUE_PAIR **tail = &head;
2547 uint8_t *y; /* why do I need to do this? */
2550 * Sanity check the attribute.
2552 for (y = ptr; y < (ptr + len); y += y[1]) {
2553 if ((y[0] == 0) || ((y + 2) > (ptr + len)) ||
2554 (y[1] < 2) || ((y + y[1]) > (ptr + len))) {
2559 for (y = ptr; y < (ptr + len); y += y[1]) {
2560 vp = paircreate(attribute | (ptr[0] << 16), vendor,
2568 if (!data2vp(packet, original, secret,
2569 y[1] - 2, y + 2, vp)) {
2581 * Start at the *data* portion of a continued attribute. search
2582 * through the rest of the attributes to find a matching one, and
2583 * add it's contents to our contents.
2585 static VALUE_PAIR *rad_continuation2vp(const RADIUS_PACKET *packet,
2586 const RADIUS_PACKET *original,
2587 const char *secret, int attribute,
2589 int length, /* CANNOT be zero */
2590 uint8_t *data, size_t packet_length,
2591 int flag, DICT_ATTR *da)
2593 size_t tlv_length, left;
2596 VALUE_PAIR *vp, *head, **tail;
2600 * Ensure we have data that hasn't been split across
2601 * multiple attributes.
2604 tlv_data = rad_coalesce(attribute, vendor, length,
2605 data, packet_length, &tlv_length);
2606 if (!tlv_data) return NULL;
2609 tlv_length = length;
2613 * Non-TLV types cannot be continued across multiple
2614 * attributes. This is true even of keys that are
2615 * encrypted with the tunnel-password method. The spec
2616 * says that they can be continued... but also that the
2617 * keys are 160 bits, which means that they CANNOT be
2620 * Note that we don't check "flag" here. The calling
2623 if (!da || (da->type != PW_TYPE_TLV)) {
2625 if (tlv_data == data) { /* true if we had 'goto' */
2626 tlv_data = malloc(tlv_length);
2627 if (!tlv_data) return NULL;
2628 memcpy(tlv_data, data, tlv_length);
2631 vp = paircreate(attribute, vendor, PW_TYPE_OCTETS);
2632 if (!vp) return NULL;
2634 vp->type = PW_TYPE_TLV;
2635 vp->flags.encrypt = FLAG_ENCRYPT_NONE;
2636 vp->flags.has_tag = 0;
2637 vp->flags.is_tlv = 0;
2638 vp->vp_tlv = tlv_data;
2639 vp->length = tlv_length;
2641 } /* else it WAS a TLV, go decode the sub-tlv's */
2644 * Now (sigh) we walk over the TLV, seeing if it is
2648 for (ptr = tlv_data;
2649 ptr != (tlv_data + tlv_length);
2654 goto not_well_formed;
2661 * Now we walk over the TLV *again*, creating sub-tlv's.
2666 for (ptr = tlv_data;
2667 ptr != (tlv_data + tlv_length);
2670 tlv_da = dict_attrbyvalue(attribute | (ptr[0] << 8), vendor);
2671 if (tlv_da && (tlv_da->type == PW_TYPE_TLV)) {
2672 vp = recurse_evil(packet, original, secret,
2673 attribute | (ptr[0] << 8),
2674 vendor, ptr + 2, ptr[1] - 2);
2678 goto not_well_formed;
2681 vp = paircreate(attribute | (ptr[0] << 8), vendor,
2685 goto not_well_formed;
2688 if (!data2vp(packet, original, secret,
2689 ptr[1] - 2, ptr + 2, vp)) {
2691 goto not_well_formed;
2697 while (*tail) tail = &((*tail)->next);
2701 * TLV's MAY be continued, but sometimes they're not.
2703 if (tlv_data != data) free(tlv_data);
2705 if (head->next) rad_sortvp(&head);
2712 * Parse a RADIUS attribute into a data structure.
2714 VALUE_PAIR *rad_attr2vp(const RADIUS_PACKET *packet,
2715 const RADIUS_PACKET *original,
2716 const char *secret, int attribute, int vendor,
2717 int length, const uint8_t *data)
2721 vp = paircreate(attribute, vendor, PW_TYPE_OCTETS);
2722 if (!vp) return NULL;
2724 return data2vp(packet, original, secret, length, data, vp);
2729 * Calculate/check digest, and decode radius attributes.
2731 * -1 on decoding error
2734 int rad_decode(RADIUS_PACKET *packet, RADIUS_PACKET *original,
2738 uint32_t vendorcode;
2741 uint8_t *ptr, *vsa_ptr;
2746 radius_packet_t *hdr;
2747 int vsa_tlen, vsa_llen, vsa_offset;
2748 DICT_VENDOR *dv = NULL;
2749 int num_attributes = 0;
2752 * Extract attribute-value pairs
2754 hdr = (radius_packet_t *)packet->data;
2756 packet_length = packet->data_len - AUTH_HDR_LEN;
2759 * There may be VP's already in the packet. Don't
2762 for (tail = &packet->vps; *tail != NULL; tail = &((*tail)->next)) {
2768 vsa_tlen = vsa_llen = 1;
2772 * We have to read at least two bytes.
2774 * rad_recv() above ensures that this is OK.
2776 while (packet_length > 0) {
2781 * Normal attribute, handle it like normal.
2783 if (vendorcode == 0) {
2785 * No room to read attr/length,
2786 * or bad attribute, or attribute is
2787 * too short, or attribute is too long,
2788 * stop processing the packet.
2790 if ((packet_length < 2) ||
2791 (ptr[0] == 0) || (ptr[1] < 2) ||
2792 (ptr[1] > packet_length)) break;
2800 if (attribute != PW_VENDOR_SPECIFIC) goto create_pair;
2803 * No vendor code, or ONLY vendor code.
2805 if (attrlen <= 4) goto create_pair;
2811 * Handle Vendor-Specific
2813 if (vendorlen == 0) {
2819 * attrlen was checked above.
2821 memcpy(&lvalue, ptr, 4);
2822 myvendor = ntohl(lvalue);
2825 * Zero isn't allowed.
2827 if (myvendor == 0) goto create_pair;
2830 * This is an implementation issue.
2831 * We currently pack vendor into the upper
2832 * 16 bits of a 32-bit attribute number,
2833 * so we can't handle vendor numbers larger
2836 if (myvendor > 65535) goto create_pair;
2838 vsa_tlen = vsa_llen = 1;
2840 dv = dict_vendorbyvalue(myvendor);
2842 vsa_tlen = dv->type;
2843 vsa_llen = dv->length;
2844 if (dv->flags) vsa_offset = 1;
2848 * Sweep through the list of VSA's,
2849 * seeing if they exactly fill the
2850 * outer Vendor-Specific attribute.
2852 * If not, create a raw Vendor-Specific.
2855 sublen = attrlen - 4;
2858 * See if we can parse it.
2864 * Not enough room for one more
2867 if (sublen < (vsa_tlen + vsa_llen + vsa_offset)) goto create_pair;
2870 * Ensure that the attribute number
2879 myattr = (subptr[0] << 8) | subptr[1];
2883 if ((subptr[0] != 0) ||
2884 (subptr[1] != 0)) goto create_pair;
2886 myattr = (subptr[2] << 8) | subptr[3];
2890 * Our dictionary is broken.
2899 ptr += 4 + vsa_tlen;
2900 attrlen -= (4 + vsa_tlen);
2901 packet_length -= 4 + vsa_tlen;
2905 if (subptr[vsa_tlen] < (vsa_tlen + vsa_llen + vsa_offset))
2908 if (subptr[vsa_tlen] > sublen)
2913 * Reserved bits MUST be
2917 ((subptr[vsa_tlen + vsa_llen] & 0x7f) != 0))
2920 sublen -= subptr[vsa_tlen];
2921 subptr += subptr[vsa_tlen];
2925 if (subptr[vsa_tlen] != 0) goto create_pair;
2926 if (subptr[vsa_tlen + 1] < (vsa_tlen + vsa_llen))
2928 if (subptr[vsa_tlen + 1] > sublen)
2930 sublen -= subptr[vsa_tlen + 1];
2931 subptr += subptr[vsa_tlen + 1];
2935 * Our dictionaries are
2941 } while (sublen > 0);
2943 vendorcode = myvendor;
2944 vendorlen = attrlen - 4;
2951 * attrlen is the length of this attribute.
2952 * total_len is the length of the encompassing
2961 attribute = (ptr[0] << 8) | ptr[1];
2964 default: /* can't hit this. */
2972 attrlen = ptr[0] - (vsa_tlen + vsa_llen + vsa_offset);
2976 attrlen = ptr[1] - (vsa_tlen + vsa_llen);
2979 default: /* can't hit this. */
2983 ptr += vsa_llen + vsa_offset;
2984 vendorlen -= vsa_tlen + vsa_llen + vsa_offset + attrlen;
2985 packet_length -= (vsa_tlen + vsa_llen + vsa_offset);
2988 * Ignore VSAs that have no data.
2990 if (attrlen == 0) goto next;
2993 * WiMAX attributes of type 0 are ignored. They
2994 * are a secret flag to us that the attribute has
2995 * already been dealt with.
2997 if ((vendorcode == VENDORPEC_WIMAX) && (attribute == 0)) {
3004 da = dict_attrbyvalue(attribute, vendorcode);
3007 * If it's NOT continued, AND we know
3008 * about it, AND it's not a TLV, we can
3009 * create a normal pair.
3011 if (((vsa_ptr[2] & 0x80) == 0) &&
3012 da && (da->type != PW_TYPE_TLV)) goto create_pair;
3015 * Else it IS continued, or it's a TLV.
3016 * Go do a lot of work to find the stuff.
3018 pair = rad_continuation2vp(packet, original, secret,
3019 attribute, vendorcode,
3022 ((vsa_ptr[2] & 0x80) != 0),
3028 * Create the attribute, setting the default type
3029 * to 'octets'. If the type in the dictionary
3030 * is different, then the dictionary type will
3031 * over-ride this one.
3033 * If the attribute has no data, then discard it.
3035 * Unless it's CUI. Damn you, CUI!
3039 (attribute != PW_CHARGEABLE_USER_IDENTITY)) goto next;
3041 pair = rad_attr2vp(packet, original, secret,
3042 attribute, vendorcode, attrlen, ptr);
3044 pairfree(&packet->vps);
3045 fr_strerror_printf("out of memory");
3059 * VSA's may not have been counted properly in
3060 * rad_packet_ok() above, as it is hard to count
3061 * then without using the dictionary. We
3062 * therefore enforce the limits here, too.
3064 if ((fr_max_attributes > 0) &&
3065 (num_attributes > fr_max_attributes)) {
3066 char host_ipaddr[128];
3068 pairfree(&packet->vps);
3069 fr_strerror_printf("WARNING: Possible DoS attack from host %s: Too many attributes in request (received %d, max %d are allowed).",
3070 inet_ntop(packet->src_ipaddr.af,
3071 &packet->src_ipaddr.ipaddr,
3072 host_ipaddr, sizeof(host_ipaddr)),
3073 num_attributes, fr_max_attributes);
3078 if (vendorlen == 0) vendorcode = 0;
3080 packet_length -= attrlen;
3084 * Merge information from the outside world into our
3087 fr_rand_seed(packet->data, AUTH_HDR_LEN);
3096 * We assume that the passwd buffer passed is big enough.
3097 * RFC2138 says the password is max 128 chars, so the size
3098 * of the passwd buffer must be at least 129 characters.
3099 * Preferably it's just MAX_STRING_LEN.
3101 * int *pwlen is updated to the new length of the encrypted
3102 * password - a multiple of 16 bytes.
3104 int rad_pwencode(char *passwd, size_t *pwlen, const char *secret,
3105 const uint8_t *vector)
3107 FR_MD5_CTX context, old;
3108 uint8_t digest[AUTH_VECTOR_LEN];
3109 int i, n, secretlen;
3113 * RFC maximum is 128 bytes.
3115 * If length is zero, pad it out with zeros.
3117 * If the length isn't aligned to 16 bytes,
3118 * zero out the extra data.
3122 if (len > 128) len = 128;
3125 memset(passwd, 0, AUTH_PASS_LEN);
3126 len = AUTH_PASS_LEN;
3127 } else if ((len % AUTH_PASS_LEN) != 0) {
3128 memset(&passwd[len], 0, AUTH_PASS_LEN - (len % AUTH_PASS_LEN));
3129 len += AUTH_PASS_LEN - (len % AUTH_PASS_LEN);
3134 * Use the secret to setup the decryption digest
3136 secretlen = strlen(secret);
3138 fr_MD5Init(&context);
3139 fr_MD5Update(&context, (const uint8_t *) secret, secretlen);
3140 old = context; /* save intermediate work */
3143 * Encrypt it in place. Don't bother checking
3144 * len, as we've ensured above that it's OK.
3146 for (n = 0; n < len; n += AUTH_PASS_LEN) {
3148 fr_MD5Update(&context, vector, AUTH_PASS_LEN);
3149 fr_MD5Final(digest, &context);
3152 fr_MD5Update(&context,
3153 (uint8_t *) passwd + n - AUTH_PASS_LEN,
3155 fr_MD5Final(digest, &context);
3158 for (i = 0; i < AUTH_PASS_LEN; i++) {
3159 passwd[i + n] ^= digest[i];
3169 int rad_pwdecode(char *passwd, size_t pwlen, const char *secret,
3170 const uint8_t *vector)
3172 FR_MD5_CTX context, old;
3173 uint8_t digest[AUTH_VECTOR_LEN];
3175 size_t n, secretlen;
3178 * The RFC's say that the maximum is 128.
3179 * The buffer we're putting it into above is 254, so
3180 * we don't need to do any length checking.
3182 if (pwlen > 128) pwlen = 128;
3187 if (pwlen == 0) goto done;
3190 * Use the secret to setup the decryption digest
3192 secretlen = strlen(secret);
3194 fr_MD5Init(&context);
3195 fr_MD5Update(&context, (const uint8_t *) secret, secretlen);
3196 old = context; /* save intermediate work */
3199 * The inverse of the code above.
3201 for (n = 0; n < pwlen; n += AUTH_PASS_LEN) {
3203 fr_MD5Update(&context, vector, AUTH_VECTOR_LEN);
3204 fr_MD5Final(digest, &context);
3207 if (pwlen > AUTH_PASS_LEN) {
3208 fr_MD5Update(&context, (uint8_t *) passwd,
3212 fr_MD5Final(digest, &context);
3215 if (pwlen > (n + AUTH_PASS_LEN)) {
3216 fr_MD5Update(&context, (uint8_t *) passwd + n,
3221 for (i = 0; i < AUTH_PASS_LEN; i++) {
3222 passwd[i + n] ^= digest[i];
3227 passwd[pwlen] = '\0';
3228 return strlen(passwd);
3233 * Encode Tunnel-Password attributes when sending them out on the wire.
3235 * int *pwlen is updated to the new length of the encrypted
3236 * password - a multiple of 16 bytes.
3238 * This is per RFC-2868 which adds a two char SALT to the initial intermediate
3241 int rad_tunnel_pwencode(char *passwd, size_t *pwlen, const char *secret,
3242 const uint8_t *vector)
3244 uint8_t buffer[AUTH_VECTOR_LEN + MAX_STRING_LEN + 3];
3245 unsigned char digest[AUTH_VECTOR_LEN];
3247 int i, n, secretlen;
3252 if (len > 127) len = 127;
3255 * Shift the password 3 positions right to place a salt and original
3256 * length, tag will be added automatically on packet send
3258 for (n=len ; n>=0 ; n--) passwd[n+3] = passwd[n];
3262 * save original password length as first password character;
3269 * Generate salt. The RFC's say:
3271 * The high bit of salt[0] must be set, each salt in a
3272 * packet should be unique, and they should be random
3274 * So, we set the high bit, add in a counter, and then
3275 * add in some CSPRNG data. should be OK..
3277 salt[0] = (0x80 | ( ((salt_offset++) & 0x0f) << 3) |
3278 (fr_rand() & 0x07));
3279 salt[1] = fr_rand();
3282 * Padd password to multiple of AUTH_PASS_LEN bytes.
3284 n = len % AUTH_PASS_LEN;
3286 n = AUTH_PASS_LEN - n;
3287 for (; n > 0; n--, len++)
3290 /* set new password length */
3294 * Use the secret to setup the decryption digest
3296 secretlen = strlen(secret);
3297 memcpy(buffer, secret, secretlen);
3299 for (n2 = 0; n2 < len; n2+=AUTH_PASS_LEN) {
3301 memcpy(buffer + secretlen, vector, AUTH_VECTOR_LEN);
3302 memcpy(buffer + secretlen + AUTH_VECTOR_LEN, salt, 2);
3303 fr_md5_calc(digest, buffer, secretlen + AUTH_VECTOR_LEN + 2);
3305 memcpy(buffer + secretlen, passwd + n2 - AUTH_PASS_LEN, AUTH_PASS_LEN);
3306 fr_md5_calc(digest, buffer, secretlen + AUTH_PASS_LEN);
3309 for (i = 0; i < AUTH_PASS_LEN; i++) {
3310 passwd[i + n2] ^= digest[i];
3318 * Decode Tunnel-Password encrypted attributes.
3320 * Defined in RFC-2868, this uses a two char SALT along with the
3321 * initial intermediate value, to differentiate it from the
3324 int rad_tunnel_pwdecode(uint8_t *passwd, size_t *pwlen, const char *secret,
3325 const uint8_t *vector)
3327 FR_MD5_CTX context, old;
3328 uint8_t digest[AUTH_VECTOR_LEN];
3330 unsigned i, n, len, reallen;
3335 * We need at least a salt.
3338 fr_strerror_printf("tunnel password is too short");
3343 * There's a salt, but no password. Or, there's a salt
3344 * and a 'data_len' octet. It's wrong, but at least we
3345 * can figure out what it means: the password is empty.
3347 * Note that this means we ignore the 'data_len' field,
3348 * if the attribute length tells us that there's no
3349 * more data. So the 'data_len' field may be wrong,
3358 len -= 2; /* discount the salt */
3361 * Use the secret to setup the decryption digest
3363 secretlen = strlen(secret);
3365 fr_MD5Init(&context);
3366 fr_MD5Update(&context, (const uint8_t *) secret, secretlen);
3367 old = context; /* save intermediate work */
3370 * Set up the initial key:
3372 * b(1) = MD5(secret + vector + salt)
3374 fr_MD5Update(&context, vector, AUTH_VECTOR_LEN);
3375 fr_MD5Update(&context, passwd, 2);
3378 for (n = 0; n < len; n += AUTH_PASS_LEN) {
3382 fr_MD5Final(digest, &context);
3387 * A quick check: decrypt the first octet
3388 * of the password, which is the
3389 * 'data_len' field. Ensure it's sane.
3391 reallen = passwd[2] ^ digest[0];
3392 if (reallen >= len) {
3393 fr_strerror_printf("tunnel password is too long for the attribute");
3397 fr_MD5Update(&context, passwd + 2, AUTH_PASS_LEN);
3401 fr_MD5Final(digest, &context);
3404 fr_MD5Update(&context, passwd + n + 2, AUTH_PASS_LEN);
3407 for (i = base; i < AUTH_PASS_LEN; i++) {
3408 passwd[n + i - 1] = passwd[n + i + 2] ^ digest[i];
3413 * See make_tunnel_password, above.
3415 if (reallen > 239) reallen = 239;
3418 passwd[reallen] = 0;
3424 * Encode a CHAP password
3426 * FIXME: might not work with Ascend because
3427 * we use vp->length, and Ascend gear likes
3428 * to send an extra '\0' in the string!
3430 int rad_chap_encode(RADIUS_PACKET *packet, uint8_t *output, int id,
3431 VALUE_PAIR *password)
3435 uint8_t string[MAX_STRING_LEN * 2 + 1];
3436 VALUE_PAIR *challenge;
3439 * Sanity check the input parameters
3441 if ((packet == NULL) || (password == NULL)) {
3446 * Note that the password VP can be EITHER
3447 * a User-Password attribute (from a check-item list),
3448 * or a CHAP-Password attribute (the client asking
3449 * the library to encode it).
3457 memcpy(ptr, password->vp_strvalue, password->length);
3458 ptr += password->length;
3459 i += password->length;
3462 * Use Chap-Challenge pair if present,
3463 * Request-Authenticator otherwise.
3465 challenge = pairfind(packet->vps, PW_CHAP_CHALLENGE, 0);
3467 memcpy(ptr, challenge->vp_strvalue, challenge->length);
3468 i += challenge->length;
3470 memcpy(ptr, packet->vector, AUTH_VECTOR_LEN);
3471 i += AUTH_VECTOR_LEN;
3475 fr_md5_calc((uint8_t *)output + 1, (uint8_t *)string, i);
3482 * Seed the random number generator.
3484 * May be called any number of times.
3486 void fr_rand_seed(const void *data, size_t size)
3491 * Ensure that the pool is initialized.
3493 if (!fr_rand_initialized) {
3496 memset(&fr_rand_pool, 0, sizeof(fr_rand_pool));
3498 fd = open("/dev/urandom", O_RDONLY);
3504 while (total < sizeof(fr_rand_pool.randrsl)) {
3505 this = read(fd, fr_rand_pool.randrsl,
3506 sizeof(fr_rand_pool.randrsl) - total);
3507 if ((this < 0) && (errno != EINTR)) break;
3508 if (this > 0) total += this;
3512 fr_rand_pool.randrsl[0] = fd;
3513 fr_rand_pool.randrsl[1] = time(NULL);
3514 fr_rand_pool.randrsl[2] = errno;
3517 fr_randinit(&fr_rand_pool, 1);
3518 fr_rand_pool.randcnt = 0;
3519 fr_rand_initialized = 1;
3525 * Hash the user data
3528 if (!hash) hash = fr_rand();
3529 hash = fr_hash_update(data, size, hash);
3531 fr_rand_pool.randmem[fr_rand_pool.randcnt] ^= hash;
3536 * Return a 32-bit random number.
3538 uint32_t fr_rand(void)
3543 * Ensure that the pool is initialized.
3545 if (!fr_rand_initialized) {
3546 fr_rand_seed(NULL, 0);
3549 num = fr_rand_pool.randrsl[fr_rand_pool.randcnt++];
3550 if (fr_rand_pool.randcnt >= 256) {
3551 fr_rand_pool.randcnt = 0;
3552 fr_isaac(&fr_rand_pool);
3560 * Allocate a new RADIUS_PACKET
3562 RADIUS_PACKET *rad_alloc(int newvector)
3566 if ((rp = malloc(sizeof(RADIUS_PACKET))) == NULL) {
3567 fr_strerror_printf("out of memory");
3570 memset(rp, 0, sizeof(*rp));
3576 uint32_t hash, base;
3579 * Don't expose the actual contents of the random
3583 for (i = 0; i < AUTH_VECTOR_LEN; i += sizeof(uint32_t)) {
3584 hash = fr_rand() ^ base;
3585 memcpy(rp->vector + i, &hash, sizeof(hash));
3588 fr_rand(); /* stir the pool again */
3593 RADIUS_PACKET *rad_alloc_reply(RADIUS_PACKET *packet)
3595 RADIUS_PACKET *reply;
3597 if (!packet) return NULL;
3599 reply = rad_alloc(0);
3600 if (!reply) return NULL;
3603 * Initialize the fields from the request.
3605 reply->sockfd = packet->sockfd;
3606 reply->dst_ipaddr = packet->src_ipaddr;
3607 reply->src_ipaddr = packet->dst_ipaddr;
3608 reply->dst_port = packet->src_port;
3609 reply->src_port = packet->dst_port;
3610 reply->id = packet->id;
3611 reply->code = 0; /* UNKNOWN code */
3612 memcpy(reply->vector, packet->vector,
3613 sizeof(reply->vector));
3616 reply->data_len = 0;
3623 * Free a RADIUS_PACKET
3625 void rad_free(RADIUS_PACKET **radius_packet_ptr)
3627 RADIUS_PACKET *radius_packet;
3629 if (!radius_packet_ptr || !*radius_packet_ptr) return;
3630 radius_packet = *radius_packet_ptr;
3632 free(radius_packet->data);
3634 pairfree(&radius_packet->vps);
3636 free(radius_packet);
3638 *radius_packet_ptr = NULL;