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 */
794 * Parse a data structure into a RADIUS attribute.
796 int rad_vp2attr(const RADIUS_PACKET *packet, const RADIUS_PACKET *original,
797 const char *secret, const VALUE_PAIR *vp, uint8_t *start,
801 int len, total_length;
803 uint8_t *ptr, *length_ptr, *vsa_length_ptr, *tlv_length_ptr;
804 uint8_t *end, *sub_length_ptr; /* evil */
807 vendorcode = total_length = 0;
808 length_ptr = vsa_length_ptr = tlv_length_ptr = sub_length_ptr = NULL;
811 * For interoperability, always put vendor attributes
812 * into their own VSA.
814 if ((vendorcode = vp->vendor) == 0) {
815 if (room < 2) return 0;
818 *(ptr++) = vp->attribute & 0xff;
827 DICT_VENDOR *dv = dict_vendorbyvalue(vendorcode);
830 * This must be an RFC-format attribute. If it
831 * wasn't, then the "decode" function would have
832 * made a Vendor-Specific attribute (i.e. type
833 * 26), and we would have "vendorcode == 0" here.
837 vsa_llen = dv->length;
838 if (dv->flags) vsa_offset = 1;
841 if (room < (6 + vsa_tlen + vsa_llen + vsa_offset)) return 0;
842 room -= 6 + vsa_tlen + vsa_llen + vsa_offset;
845 * Build a VSA header.
847 *ptr++ = PW_VENDOR_SPECIFIC;
848 vsa_length_ptr = ptr;
850 lvalue = htonl(vendorcode);
851 memcpy(ptr, &lvalue, 4);
857 ptr[0] = (vp->attribute & 0xFF);
861 ptr[0] = ((vp->attribute >> 8) & 0xFF);
862 ptr[1] = (vp->attribute & 0xFF);
868 ptr[2] = ((vp->attribute >> 8) & 0xFF);
869 ptr[3] = (vp->attribute & 0xFF);
873 return 0; /* silently discard it */
879 length_ptr = vsa_length_ptr;
880 vsa_length_ptr = NULL;
889 length_ptr = ptr + 1;
893 return 0; /* silently discard it */
898 * Allow for some continuation.
905 * Ignore TLVs that don't have data, OR
906 * have too much data to fit in the
907 * packet, OR have too much data to fit
910 * This shouldn't happen in normal
911 * operation, as the code assumes that
912 * the "tlv" type shouldn't be used.
914 if (vp->flags.has_tlv &&
915 (!vp->vp_tlv || (vp->length > room) ||
918 * 6 + 1 (vsa_tlen) + 1 (vsa_llen)
921 (vp->length > (255 - 9)))) return 0;
925 * sub-TLV's can only be in one format.
927 if (vp->flags.is_tlv) {
928 if (room < 2) return 0;
931 *(ptr++) = (vp->attribute & 0xff00) >> 8;
932 tlv_length_ptr = ptr;
937 * WiMAX is like sticking knitting
938 * needles up your nose, and claiming
941 if ((vp->attribute & 0xff0000) != 0) {
942 *(ptr++) = (vp->attribute >> 16) & 0xff;
943 sub_length_ptr = ptr;
946 *tlv_length_ptr += 2;
951 total_length += vsa_tlen + vsa_llen + vsa_offset;
952 if (vsa_length_ptr) *vsa_length_ptr += vsa_tlen + vsa_llen + vsa_offset;
953 *length_ptr += vsa_tlen + vsa_llen + vsa_offset;
957 * Insert tags for string attributes. They go BEFORE
960 if (vp->flags.has_tag && (vp->type == PW_TYPE_STRING) &&
961 (TAG_VALID(vp->flags.tag) ||
962 (vp->flags.encrypt == FLAG_ENCRYPT_TUNNEL_PASSWORD))) {
963 if (room < (1 + vp->length)) return 0;
965 ptr[0] = vp->flags.tag;
966 end = vp2data(packet, original, secret, vp, ptr + 1,
969 if (room < vp->length) return 0;
970 end = vp2data(packet, original, secret, vp, ptr,
976 * Insert tags for integer attributes. They go at the START
977 * of the integer, and over-write the first byte.
979 if (vp->flags.has_tag && (vp->type == PW_TYPE_INTEGER)) {
980 ptr[0] = vp->flags.tag;
984 * RFC 2865 section 5 says that zero-length attributes
987 * ... and the WiMAX forum ignores this... because of
988 * one vendor. Don't they have anything better to do
992 (vp->attribute != PW_CHARGEABLE_USER_IDENTITY)) return 0;
997 * Update the various lengths.
1000 if (vsa_length_ptr) *vsa_length_ptr += len;
1001 if (tlv_length_ptr) *tlv_length_ptr += len;
1002 if (sub_length_ptr) *sub_length_ptr += len;
1004 total_length += len;
1006 return total_length; /* of attribute */
1013 int rad_encode(RADIUS_PACKET *packet, const RADIUS_PACKET *original,
1016 radius_packet_t *hdr;
1017 uint8_t *ptr, *wimax = NULL;
1018 uint16_t total_length;
1022 char ip_buffer[128];
1025 * A 4K packet, aligned on 64-bits.
1027 uint64_t data[MAX_PACKET_LEN / sizeof(uint64_t)];
1029 if ((packet->code > 0) && (packet->code < FR_MAX_PACKET_CODE)) {
1030 what = fr_packet_codes[packet->code];
1035 DEBUG("Sending %s of id %d to %s port %d\n",
1037 inet_ntop(packet->dst_ipaddr.af,
1038 &packet->dst_ipaddr.ipaddr,
1039 ip_buffer, sizeof(ip_buffer)),
1043 * Double-check some things based on packet code.
1045 switch (packet->code) {
1046 case PW_AUTHENTICATION_ACK:
1047 case PW_AUTHENTICATION_REJECT:
1048 case PW_ACCESS_CHALLENGE:
1050 fr_strerror_printf("ERROR: Cannot sign response packet without a request packet.");
1056 * These packet vectors start off as all zero.
1058 case PW_ACCOUNTING_REQUEST:
1059 case PW_DISCONNECT_REQUEST:
1060 case PW_COA_REQUEST:
1061 memset(packet->vector, 0, sizeof(packet->vector));
1069 * Use memory on the stack, until we know how
1070 * large the packet will be.
1072 hdr = (radius_packet_t *) data;
1075 * Build standard header
1077 hdr->code = packet->code;
1078 hdr->id = packet->id;
1080 memcpy(hdr->vector, packet->vector, sizeof(hdr->vector));
1082 total_length = AUTH_HDR_LEN;
1085 * Load up the configuration values for the user
1091 * FIXME: Loop twice over the reply list. The first time,
1092 * calculate the total length of data. The second time,
1093 * allocate the memory, and fill in the VP's.
1095 * Hmm... this may be slower than just doing a small
1100 * Loop over the reply attributes for the packet.
1102 for (reply = packet->vps; reply; reply = reply->next) {
1104 * Ignore non-wire attributes
1106 if ((reply->vendor == 0) &&
1107 ((reply->attribute & 0xFFFF) > 0xff)) {
1110 * Permit the admin to send BADLY formatted
1111 * attributes with a debug build.
1113 if (reply->attribute == PW_RAW_ATTRIBUTE) {
1114 memcpy(ptr, reply->vp_octets, reply->length);
1115 len = reply->length;
1123 * Set the Message-Authenticator to the correct
1124 * length and initial value.
1126 if (reply->attribute == PW_MESSAGE_AUTHENTICATOR) {
1127 reply->length = AUTH_VECTOR_LEN;
1128 memset(reply->vp_strvalue, 0, AUTH_VECTOR_LEN);
1131 * Cache the offset to the
1132 * Message-Authenticator
1134 packet->offset = total_length;
1138 * Print out ONLY the attributes which
1139 * we're sending over the wire, and print
1140 * them out BEFORE they're encrypted.
1144 if (!reply->flags.is_tlv) wimax = NULL;
1146 len = rad_vp2attr(packet, original, secret, reply, ptr,
1147 ((uint8_t *) data) + sizeof(data) - ptr);
1149 if (len < 0) return -1;
1152 * After adding an attribute with the simplest
1153 * encoding, check to see if we can append it to
1156 if ((len > 0) && reply->flags.is_tlv) {
1157 if (wimax && (memcmp(wimax + 2, ptr + 2, 5) == 0)) {
1158 if ((wimax[1] + (ptr[1] - 6)) <= 255) {
1162 memmove(ptr, ptr + 9, hack);
1168 wimax[8] = 0x80; /* set continuation */
1178 total_length += len;
1179 } /* done looping over all attributes */
1182 * Fill in the rest of the fields, and copy the data over
1183 * from the local stack to the newly allocated memory.
1185 * Yes, all this 'memcpy' is slow, but it means
1186 * that we only allocate the minimum amount of
1187 * memory for a request.
1189 packet->data_len = total_length;
1190 packet->data = (uint8_t *) malloc(packet->data_len);
1191 if (!packet->data) {
1192 fr_strerror_printf("Out of memory");
1196 memcpy(packet->data, hdr, packet->data_len);
1197 hdr = (radius_packet_t *) packet->data;
1199 total_length = htons(total_length);
1200 memcpy(hdr->length, &total_length, sizeof(total_length));
1207 * Sign a previously encoded packet.
1209 int rad_sign(RADIUS_PACKET *packet, const RADIUS_PACKET *original,
1212 radius_packet_t *hdr = (radius_packet_t *)packet->data;
1215 * It wasn't assigned an Id, this is bad!
1217 if (packet->id < 0) {
1218 fr_strerror_printf("ERROR: RADIUS packets must be assigned an Id.");
1222 if (!packet->data || (packet->data_len < AUTH_HDR_LEN) ||
1223 (packet->offset < 0)) {
1224 fr_strerror_printf("ERROR: You must call rad_encode() before rad_sign()");
1229 * If there's a Message-Authenticator, update it
1230 * now, BEFORE updating the authentication vector.
1232 if (packet->offset > 0) {
1233 uint8_t calc_auth_vector[AUTH_VECTOR_LEN];
1235 switch (packet->code) {
1236 case PW_ACCOUNTING_REQUEST:
1237 case PW_ACCOUNTING_RESPONSE:
1238 case PW_DISCONNECT_REQUEST:
1239 case PW_DISCONNECT_ACK:
1240 case PW_DISCONNECT_NAK:
1241 case PW_COA_REQUEST:
1244 memset(hdr->vector, 0, AUTH_VECTOR_LEN);
1247 case PW_AUTHENTICATION_ACK:
1248 case PW_AUTHENTICATION_REJECT:
1249 case PW_ACCESS_CHALLENGE:
1251 fr_strerror_printf("ERROR: Cannot sign response packet without a request packet.");
1254 memcpy(hdr->vector, original->vector,
1258 default: /* others have vector already set to zero */
1264 * Set the authentication vector to zero,
1265 * calculate the signature, and put it
1266 * into the Message-Authenticator
1269 fr_hmac_md5(packet->data, packet->data_len,
1270 (const uint8_t *) secret, strlen(secret),
1272 memcpy(packet->data + packet->offset + 2,
1273 calc_auth_vector, AUTH_VECTOR_LEN);
1276 * Copy the original request vector back
1277 * to the raw packet.
1279 memcpy(hdr->vector, packet->vector, AUTH_VECTOR_LEN);
1283 * Switch over the packet code, deciding how to
1286 switch (packet->code) {
1288 * Request packets are not signed, bur
1289 * have a random authentication vector.
1291 case PW_AUTHENTICATION_REQUEST:
1292 case PW_STATUS_SERVER:
1296 * Reply packets are signed with the
1297 * authentication vector of the request.
1304 fr_MD5Init(&context);
1305 fr_MD5Update(&context, packet->data, packet->data_len);
1306 fr_MD5Update(&context, (const uint8_t *) secret,
1308 fr_MD5Final(digest, &context);
1310 memcpy(hdr->vector, digest, AUTH_VECTOR_LEN);
1311 memcpy(packet->vector, digest, AUTH_VECTOR_LEN);
1314 }/* switch over packet codes */
1320 * Reply to the request. Also attach
1321 * reply attribute value pairs and any user message provided.
1323 int rad_send(RADIUS_PACKET *packet, const RADIUS_PACKET *original,
1328 char ip_buffer[128];
1331 * Maybe it's a fake packet. Don't send it.
1333 if (!packet || (packet->sockfd < 0)) {
1337 if ((packet->code > 0) && (packet->code < FR_MAX_PACKET_CODE)) {
1338 what = fr_packet_codes[packet->code];
1344 * First time through, allocate room for the packet
1346 if (!packet->data) {
1348 * Encode the packet.
1350 if (rad_encode(packet, original, secret) < 0) {
1355 * Re-sign it, including updating the
1356 * Message-Authenticator.
1358 if (rad_sign(packet, original, secret) < 0) {
1363 * If packet->data points to data, then we print out
1364 * the VP list again only for debugging.
1366 } else if (fr_debug_flag) {
1367 DEBUG("Sending %s of id %d to %s port %d\n", what, packet->id,
1368 inet_ntop(packet->dst_ipaddr.af,
1369 &packet->dst_ipaddr.ipaddr,
1370 ip_buffer, sizeof(ip_buffer)),
1373 for (reply = packet->vps; reply; reply = reply->next) {
1374 if ((reply->vendor == 0) &&
1375 ((reply->attribute & 0xFFFF) > 0xff)) continue;
1381 * And send it on it's way.
1383 return rad_sendto(packet->sockfd, packet->data, packet->data_len, 0,
1384 &packet->src_ipaddr, packet->src_port,
1385 &packet->dst_ipaddr, packet->dst_port);
1389 * Do a comparison of two authentication digests by comparing
1390 * the FULL digest. Otehrwise, the server can be subject to
1391 * timing attacks that allow attackers find a valid message
1394 * http://www.cs.rice.edu/~dwallach/pub/crosby-timing2009.pdf
1396 static int digest_cmp(const uint8_t *a, const uint8_t *b, size_t length)
1401 for (i = 0; i < length; i++) {
1402 result |= a[i] ^ b[i];
1405 return result; /* 0 is OK, !0 is !OK, just like memcmp */
1410 * Validates the requesting client NAS. Calculates the
1411 * signature based on the clients private key.
1413 static int calc_acctdigest(RADIUS_PACKET *packet, const char *secret)
1415 uint8_t digest[AUTH_VECTOR_LEN];
1419 * Zero out the auth_vector in the received packet.
1420 * Then append the shared secret to the received packet,
1421 * and calculate the MD5 sum. This must be the same
1422 * as the original MD5 sum (packet->vector).
1424 memset(packet->data + 4, 0, AUTH_VECTOR_LEN);
1427 * MD5(packet + secret);
1429 fr_MD5Init(&context);
1430 fr_MD5Update(&context, packet->data, packet->data_len);
1431 fr_MD5Update(&context, (const uint8_t *) secret, strlen(secret));
1432 fr_MD5Final(digest, &context);
1435 * Return 0 if OK, 2 if not OK.
1437 if (digest_cmp(digest, packet->vector, AUTH_VECTOR_LEN) != 0) return 2;
1443 * Validates the requesting client NAS. Calculates the
1444 * signature based on the clients private key.
1446 static int calc_replydigest(RADIUS_PACKET *packet, RADIUS_PACKET *original,
1449 uint8_t calc_digest[AUTH_VECTOR_LEN];
1455 if (original == NULL) {
1460 * Copy the original vector in place.
1462 memcpy(packet->data + 4, original->vector, AUTH_VECTOR_LEN);
1465 * MD5(packet + secret);
1467 fr_MD5Init(&context);
1468 fr_MD5Update(&context, packet->data, packet->data_len);
1469 fr_MD5Update(&context, (const uint8_t *) secret, strlen(secret));
1470 fr_MD5Final(calc_digest, &context);
1473 * Copy the packet's vector back to the packet.
1475 memcpy(packet->data + 4, packet->vector, AUTH_VECTOR_LEN);
1478 * Return 0 if OK, 2 if not OK.
1480 if (digest_cmp(packet->vector, calc_digest, AUTH_VECTOR_LEN) != 0) return 2;
1486 * See if the data pointed to by PTR is a valid RADIUS packet.
1488 * packet is not 'const * const' because we may update data_len,
1489 * if there's more data in the UDP packet than in the RADIUS packet.
1491 int rad_packet_ok(RADIUS_PACKET *packet, int flags)
1496 radius_packet_t *hdr;
1497 char host_ipaddr[128];
1503 * Check for packets smaller than the packet header.
1505 * RFC 2865, Section 3., subsection 'length' says:
1507 * "The minimum length is 20 ..."
1509 if (packet->data_len < AUTH_HDR_LEN) {
1510 fr_strerror_printf("WARNING: Malformed RADIUS packet from host %s: too short (received %d < minimum %d)",
1511 inet_ntop(packet->src_ipaddr.af,
1512 &packet->src_ipaddr.ipaddr,
1513 host_ipaddr, sizeof(host_ipaddr)),
1514 (int) packet->data_len, AUTH_HDR_LEN);
1519 * RFC 2865, Section 3., subsection 'length' says:
1521 * " ... and maximum length is 4096."
1523 if (packet->data_len > MAX_PACKET_LEN) {
1524 fr_strerror_printf("WARNING: Malformed RADIUS packet from host %s: too long (received %d > maximum %d)",
1525 inet_ntop(packet->src_ipaddr.af,
1526 &packet->src_ipaddr.ipaddr,
1527 host_ipaddr, sizeof(host_ipaddr)),
1528 (int) packet->data_len, MAX_PACKET_LEN);
1533 * Check for packets with mismatched size.
1534 * i.e. We've received 128 bytes, and the packet header
1535 * says it's 256 bytes long.
1537 totallen = (packet->data[2] << 8) | packet->data[3];
1538 hdr = (radius_packet_t *)packet->data;
1541 * Code of 0 is not understood.
1542 * Code of 16 or greate is not understood.
1544 if ((hdr->code == 0) ||
1545 (hdr->code >= FR_MAX_PACKET_CODE)) {
1546 fr_strerror_printf("WARNING: Bad RADIUS packet from host %s: unknown packet code%d ",
1547 inet_ntop(packet->src_ipaddr.af,
1548 &packet->src_ipaddr.ipaddr,
1549 host_ipaddr, sizeof(host_ipaddr)),
1555 * Message-Authenticator is required in Status-Server
1556 * packets, otherwise they can be trivially forged.
1558 if (hdr->code == PW_STATUS_SERVER) require_ma = 1;
1561 * It's also required if the caller asks for it.
1563 if (flags) require_ma = 1;
1566 * Repeat the length checks. This time, instead of
1567 * looking at the data we received, look at the value
1568 * of the 'length' field inside of the packet.
1570 * Check for packets smaller than the packet header.
1572 * RFC 2865, Section 3., subsection 'length' says:
1574 * "The minimum length is 20 ..."
1576 if (totallen < AUTH_HDR_LEN) {
1577 fr_strerror_printf("WARNING: Malformed RADIUS packet from host %s: too short (length %d < minimum %d)",
1578 inet_ntop(packet->src_ipaddr.af,
1579 &packet->src_ipaddr.ipaddr,
1580 host_ipaddr, sizeof(host_ipaddr)),
1581 totallen, AUTH_HDR_LEN);
1586 * And again, for the value of the 'length' field.
1588 * RFC 2865, Section 3., subsection 'length' says:
1590 * " ... and maximum length is 4096."
1592 if (totallen > MAX_PACKET_LEN) {
1593 fr_strerror_printf("WARNING: Malformed RADIUS packet from host %s: too long (length %d > maximum %d)",
1594 inet_ntop(packet->src_ipaddr.af,
1595 &packet->src_ipaddr.ipaddr,
1596 host_ipaddr, sizeof(host_ipaddr)),
1597 totallen, MAX_PACKET_LEN);
1602 * RFC 2865, Section 3., subsection 'length' says:
1604 * "If the packet is shorter than the Length field
1605 * indicates, it MUST be silently discarded."
1607 * i.e. No response to the NAS.
1609 if (packet->data_len < totallen) {
1610 fr_strerror_printf("WARNING: Malformed RADIUS packet from host %s: received %d octets, packet length says %d",
1611 inet_ntop(packet->src_ipaddr.af,
1612 &packet->src_ipaddr.ipaddr,
1613 host_ipaddr, sizeof(host_ipaddr)),
1614 (int) packet->data_len, totallen);
1619 * RFC 2865, Section 3., subsection 'length' says:
1621 * "Octets outside the range of the Length field MUST be
1622 * treated as padding and ignored on reception."
1624 if (packet->data_len > totallen) {
1626 * We're shortening the packet below, but just
1627 * to be paranoid, zero out the extra data.
1629 memset(packet->data + totallen, 0, packet->data_len - totallen);
1630 packet->data_len = totallen;
1634 * Walk through the packet's attributes, ensuring that
1635 * they add up EXACTLY to the size of the packet.
1637 * If they don't, then the attributes either under-fill
1638 * or over-fill the packet. Any parsing of the packet
1639 * is impossible, and will result in unknown side effects.
1641 * This would ONLY happen with buggy RADIUS implementations,
1642 * or with an intentional attack. Either way, we do NOT want
1643 * to be vulnerable to this problem.
1646 count = totallen - AUTH_HDR_LEN;
1651 * Attribute number zero is NOT defined.
1654 fr_strerror_printf("WARNING: Malformed RADIUS packet from host %s: Invalid attribute 0",
1655 inet_ntop(packet->src_ipaddr.af,
1656 &packet->src_ipaddr.ipaddr,
1657 host_ipaddr, sizeof(host_ipaddr)));
1662 * Attributes are at LEAST as long as the ID & length
1663 * fields. Anything shorter is an invalid attribute.
1666 fr_strerror_printf("WARNING: Malformed RADIUS packet from host %s: attribute %d too short",
1667 inet_ntop(packet->src_ipaddr.af,
1668 &packet->src_ipaddr.ipaddr,
1669 host_ipaddr, sizeof(host_ipaddr)),
1675 * Sanity check the attributes for length.
1678 default: /* don't do anything by default */
1682 * If there's an EAP-Message, we require
1683 * a Message-Authenticator.
1685 case PW_EAP_MESSAGE:
1689 case PW_MESSAGE_AUTHENTICATOR:
1690 if (attr[1] != 2 + AUTH_VECTOR_LEN) {
1691 fr_strerror_printf("WARNING: Malformed RADIUS packet from host %s: Message-Authenticator has invalid length %d",
1692 inet_ntop(packet->src_ipaddr.af,
1693 &packet->src_ipaddr.ipaddr,
1694 host_ipaddr, sizeof(host_ipaddr)),
1703 * FIXME: Look up the base 255 attributes in the
1704 * dictionary, and switch over their type. For
1705 * integer/date/ip, the attribute length SHOULD
1708 count -= attr[1]; /* grab the attribute length */
1710 num_attributes++; /* seen one more attribute */
1714 * If the attributes add up to a packet, it's allowed.
1716 * If not, we complain, and throw the packet away.
1719 fr_strerror_printf("WARNING: Malformed RADIUS packet from host %s: packet attributes do NOT exactly fill the packet",
1720 inet_ntop(packet->src_ipaddr.af,
1721 &packet->src_ipaddr.ipaddr,
1722 host_ipaddr, sizeof(host_ipaddr)));
1727 * If we're configured to look for a maximum number of
1728 * attributes, and we've seen more than that maximum,
1729 * then throw the packet away, as a possible DoS.
1731 if ((fr_max_attributes > 0) &&
1732 (num_attributes > fr_max_attributes)) {
1733 fr_strerror_printf("WARNING: Possible DoS attack from host %s: Too many attributes in request (received %d, max %d are allowed).",
1734 inet_ntop(packet->src_ipaddr.af,
1735 &packet->src_ipaddr.ipaddr,
1736 host_ipaddr, sizeof(host_ipaddr)),
1737 num_attributes, fr_max_attributes);
1742 * http://www.freeradius.org/rfc/rfc2869.html#EAP-Message
1744 * A packet with an EAP-Message attribute MUST also have
1745 * a Message-Authenticator attribute.
1747 * A Message-Authenticator all by itself is OK, though.
1749 * Similarly, Status-Server packets MUST contain
1750 * Message-Authenticator attributes.
1752 if (require_ma && ! seen_ma) {
1753 fr_strerror_printf("WARNING: Insecure packet from host %s: Packet does not contain required Message-Authenticator attribute",
1754 inet_ntop(packet->src_ipaddr.af,
1755 &packet->src_ipaddr.ipaddr,
1756 host_ipaddr, sizeof(host_ipaddr)));
1761 * Fill RADIUS header fields
1763 packet->code = hdr->code;
1764 packet->id = hdr->id;
1765 memcpy(packet->vector, hdr->vector, AUTH_VECTOR_LEN);
1772 * Receive UDP client requests, and fill in
1773 * the basics of a RADIUS_PACKET structure.
1775 RADIUS_PACKET *rad_recv(int fd, int flags)
1778 RADIUS_PACKET *packet;
1781 * Allocate the new request data structure
1783 if ((packet = malloc(sizeof(*packet))) == NULL) {
1784 fr_strerror_printf("out of memory");
1787 memset(packet, 0, sizeof(*packet));
1790 sock_flags = MSG_PEEK;
1794 packet->data_len = rad_recvfrom(fd, &packet->data, sock_flags,
1795 &packet->src_ipaddr, &packet->src_port,
1796 &packet->dst_ipaddr, &packet->dst_port);
1799 * Check for socket errors.
1801 if (packet->data_len < 0) {
1802 fr_strerror_printf("Error receiving packet: %s", strerror(errno));
1803 /* packet->data is NULL */
1809 * If the packet is too big, then rad_recvfrom did NOT
1810 * allocate memory. Instead, it just discarded the
1813 if (packet->data_len > MAX_PACKET_LEN) {
1814 fr_strerror_printf("Discarding packet: Larger than RFC limitation of 4096 bytes.");
1815 /* packet->data is NULL */
1821 * Read no data. Continue.
1822 * This check is AFTER the MAX_PACKET_LEN check above, because
1823 * if the packet is larger than MAX_PACKET_LEN, we also have
1824 * packet->data == NULL
1826 if ((packet->data_len == 0) || !packet->data) {
1827 fr_strerror_printf("Empty packet: Socket is not ready.");
1833 * See if it's a well-formed RADIUS packet.
1835 if (!rad_packet_ok(packet, flags)) {
1841 * Remember which socket we read the packet from.
1843 packet->sockfd = fd;
1846 * FIXME: Do even more filtering by only permitting
1847 * certain IP's. The problem is that we don't know
1848 * how to do this properly for all possible clients...
1852 * Explicitely set the VP list to empty.
1856 if (fr_debug_flag) {
1857 char host_ipaddr[128];
1859 if ((packet->code > 0) && (packet->code < FR_MAX_PACKET_CODE)) {
1860 DEBUG("rad_recv: %s packet from host %s port %d",
1861 fr_packet_codes[packet->code],
1862 inet_ntop(packet->src_ipaddr.af,
1863 &packet->src_ipaddr.ipaddr,
1864 host_ipaddr, sizeof(host_ipaddr)),
1867 DEBUG("rad_recv: Packet from host %s port %d code=%d",
1868 inet_ntop(packet->src_ipaddr.af,
1869 &packet->src_ipaddr.ipaddr,
1870 host_ipaddr, sizeof(host_ipaddr)),
1874 DEBUG(", id=%d, length=%d\n",
1875 packet->id, (int) packet->data_len);
1883 * Verify the signature of a packet.
1885 int rad_verify(RADIUS_PACKET *packet, RADIUS_PACKET *original,
1892 if (!packet || !packet->data) return -1;
1895 * Before we allocate memory for the attributes, do more
1898 ptr = packet->data + AUTH_HDR_LEN;
1899 length = packet->data_len - AUTH_HDR_LEN;
1900 while (length > 0) {
1901 uint8_t msg_auth_vector[AUTH_VECTOR_LEN];
1902 uint8_t calc_auth_vector[AUTH_VECTOR_LEN];
1907 default: /* don't do anything. */
1911 * Note that more than one Message-Authenticator
1912 * attribute is invalid.
1914 case PW_MESSAGE_AUTHENTICATOR:
1915 memcpy(msg_auth_vector, &ptr[2], sizeof(msg_auth_vector));
1916 memset(&ptr[2], 0, AUTH_VECTOR_LEN);
1918 switch (packet->code) {
1922 case PW_ACCOUNTING_REQUEST:
1923 case PW_ACCOUNTING_RESPONSE:
1924 case PW_DISCONNECT_REQUEST:
1925 case PW_DISCONNECT_ACK:
1926 case PW_DISCONNECT_NAK:
1927 case PW_COA_REQUEST:
1930 memset(packet->data + 4, 0, AUTH_VECTOR_LEN);
1933 case PW_AUTHENTICATION_ACK:
1934 case PW_AUTHENTICATION_REJECT:
1935 case PW_ACCESS_CHALLENGE:
1937 fr_strerror_printf("ERROR: Cannot validate Message-Authenticator in response packet without a request packet.");
1940 memcpy(packet->data + 4, original->vector, AUTH_VECTOR_LEN);
1944 fr_hmac_md5(packet->data, packet->data_len,
1945 (const uint8_t *) secret, strlen(secret),
1947 if (digest_cmp(calc_auth_vector, msg_auth_vector,
1948 sizeof(calc_auth_vector)) != 0) {
1950 fr_strerror_printf("Received packet from %s with invalid Message-Authenticator! (Shared secret is incorrect.)",
1951 inet_ntop(packet->src_ipaddr.af,
1952 &packet->src_ipaddr.ipaddr,
1953 buffer, sizeof(buffer)));
1954 /* Silently drop packet, according to RFC 3579 */
1956 } /* else the message authenticator was good */
1959 * Reinitialize Authenticators.
1961 memcpy(&ptr[2], msg_auth_vector, AUTH_VECTOR_LEN);
1962 memcpy(packet->data + 4, packet->vector, AUTH_VECTOR_LEN);
1964 } /* switch over the attributes */
1968 } /* loop over the packet, sanity checking the attributes */
1971 * It looks like a RADIUS packet, but we can't validate
1974 if ((packet->code == 0) || (packet->code >= FR_MAX_PACKET_CODE)) {
1976 fr_strerror_printf("Received Unknown packet code %d "
1977 "from client %s port %d: Cannot validate signature.",
1979 inet_ntop(packet->src_ipaddr.af,
1980 &packet->src_ipaddr.ipaddr,
1981 buffer, sizeof(buffer)),
1987 * Calculate and/or verify digest.
1989 switch(packet->code) {
1993 case PW_AUTHENTICATION_REQUEST:
1994 case PW_STATUS_SERVER:
1996 * The authentication vector is random
1997 * nonsense, invented by the client.
2001 case PW_COA_REQUEST:
2002 case PW_DISCONNECT_REQUEST:
2003 case PW_ACCOUNTING_REQUEST:
2004 if (calc_acctdigest(packet, secret) > 1) {
2005 fr_strerror_printf("Received %s packet "
2006 "from %s with invalid signature! (Shared secret is incorrect.)",
2007 fr_packet_codes[packet->code],
2008 inet_ntop(packet->src_ipaddr.af,
2009 &packet->src_ipaddr.ipaddr,
2010 buffer, sizeof(buffer)));
2015 /* Verify the reply digest */
2016 case PW_AUTHENTICATION_ACK:
2017 case PW_AUTHENTICATION_REJECT:
2018 case PW_ACCESS_CHALLENGE:
2019 case PW_ACCOUNTING_RESPONSE:
2020 case PW_DISCONNECT_ACK:
2021 case PW_DISCONNECT_NAK:
2024 rcode = calc_replydigest(packet, original, secret);
2026 fr_strerror_printf("Received %s packet "
2027 "from client %s port %d with invalid signature (err=%d)! (Shared secret is incorrect.)",
2028 fr_packet_codes[packet->code],
2029 inet_ntop(packet->src_ipaddr.af,
2030 &packet->src_ipaddr.ipaddr,
2031 buffer, sizeof(buffer)),
2039 fr_strerror_printf("Received Unknown packet code %d "
2040 "from client %s port %d: Cannot validate signature",
2042 inet_ntop(packet->src_ipaddr.af,
2043 &packet->src_ipaddr.ipaddr,
2044 buffer, sizeof(buffer)),
2053 static VALUE_PAIR *data2vp(const RADIUS_PACKET *packet,
2054 const RADIUS_PACKET *original,
2055 const char *secret, size_t length,
2056 const uint8_t *data, VALUE_PAIR *vp)
2061 * If length is greater than 253, something is SERIOUSLY
2064 if (length > 253) length = 253; /* paranoia (pair-anoia?) */
2066 vp->length = length;
2067 vp->operator = T_OP_EQ;
2073 if (vp->flags.has_tag) {
2074 if (TAG_VALID(data[0]) ||
2075 (vp->flags.encrypt == FLAG_ENCRYPT_TUNNEL_PASSWORD)) {
2077 * Tunnel passwords REQUIRE a tag, even
2078 * if don't have a valid tag.
2080 vp->flags.tag = data[0];
2082 if ((vp->type == PW_TYPE_STRING) ||
2083 (vp->type == PW_TYPE_OCTETS)) offset = 1;
2088 * Copy the data to be decrypted
2090 memcpy(&vp->vp_octets[0], data + offset, length - offset);
2091 vp->length -= offset;
2094 * Decrypt the attribute.
2096 switch (vp->flags.encrypt) {
2100 case FLAG_ENCRYPT_USER_PASSWORD:
2102 rad_pwdecode((char *)vp->vp_strvalue,
2106 rad_pwdecode((char *)vp->vp_strvalue,
2110 if (vp->attribute == PW_USER_PASSWORD) {
2111 vp->length = strlen(vp->vp_strvalue);
2116 * Tunnel-Password's may go ONLY
2117 * in response packets.
2119 case FLAG_ENCRYPT_TUNNEL_PASSWORD:
2120 if (!original) goto raw;
2122 if (rad_tunnel_pwdecode(vp->vp_octets, &vp->length,
2123 secret, original->vector) < 0) {
2129 * Ascend-Send-Secret
2130 * Ascend-Receive-Secret
2132 case FLAG_ENCRYPT_ASCEND_SECRET:
2136 uint8_t my_digest[AUTH_VECTOR_LEN];
2137 make_secret(my_digest,
2140 memcpy(vp->vp_strvalue, my_digest,
2142 vp->vp_strvalue[AUTH_VECTOR_LEN] = '\0';
2143 vp->length = strlen(vp->vp_strvalue);
2149 } /* switch over encryption flags */
2153 case PW_TYPE_STRING:
2154 case PW_TYPE_OCTETS:
2155 case PW_TYPE_ABINARY:
2156 /* nothing more to do */
2160 if (vp->length != 1) goto raw;
2162 vp->vp_integer = vp->vp_octets[0];
2167 if (vp->length != 2) goto raw;
2169 vp->vp_integer = (vp->vp_octets[0] << 8) | vp->vp_octets[1];
2172 case PW_TYPE_INTEGER:
2173 if (vp->length != 4) goto raw;
2175 memcpy(&vp->vp_integer, vp->vp_octets, 4);
2176 vp->vp_integer = ntohl(vp->vp_integer);
2178 if (vp->flags.has_tag) vp->vp_integer &= 0x00ffffff;
2181 * Try to get named VALUEs
2185 dval = dict_valbyattr(vp->attribute, vp->vendor,
2188 strlcpy(vp->vp_strvalue,
2190 sizeof(vp->vp_strvalue));
2196 if (vp->length != 4) goto raw;
2198 memcpy(&vp->vp_date, vp->vp_octets, 4);
2199 vp->vp_date = ntohl(vp->vp_date);
2203 case PW_TYPE_IPADDR:
2204 if (vp->length != 4) goto raw;
2206 memcpy(&vp->vp_ipaddr, vp->vp_octets, 4);
2210 * IPv6 interface ID is 8 octets long.
2213 if (vp->length != 8) goto raw;
2214 /* vp->vp_ifid == vp->vp_octets */
2218 * IPv6 addresses are 16 octets long
2220 case PW_TYPE_IPV6ADDR:
2221 if (vp->length != 16) goto raw;
2222 /* vp->vp_ipv6addr == vp->vp_octets */
2226 * IPv6 prefixes are 2 to 18 octets long.
2228 * RFC 3162: The first octet is unused.
2229 * The second is the length of the prefix
2230 * the rest are the prefix data.
2232 * The prefix length can have value 0 to 128.
2234 case PW_TYPE_IPV6PREFIX:
2235 if (vp->length < 2 || vp->length > 18) goto raw;
2236 if (vp->vp_octets[1] > 128) goto raw;
2239 * FIXME: double-check that
2240 * (vp->vp_octets[1] >> 3) matches vp->length + 2
2242 if (vp->length < 18) {
2243 memset(vp->vp_octets + vp->length, 0,
2248 case PW_TYPE_SIGNED:
2249 if (vp->length != 4) goto raw;
2252 * Overload vp_integer for ntohl, which takes
2253 * uint32_t, not int32_t
2255 memcpy(&vp->vp_integer, vp->vp_octets, 4);
2256 vp->vp_integer = ntohl(vp->vp_integer);
2257 memcpy(&vp->vp_signed, &vp->vp_integer, 4);
2261 vp->length = length;
2262 vp->vp_tlv = malloc(length);
2265 fr_strerror_printf("No memory");
2268 memcpy(vp->vp_tlv, data, length);
2271 case PW_TYPE_COMBO_IP:
2272 if (vp->length == 4) {
2273 vp->type = PW_TYPE_IPADDR;
2274 memcpy(&vp->vp_ipaddr, vp->vp_octets, 4);
2277 } else if (vp->length == 16) {
2278 vp->type = PW_TYPE_IPV6ADDR;
2279 /* vp->vp_ipv6addr == vp->vp_octets */
2287 vp->type = PW_TYPE_OCTETS;
2288 vp->length = length;
2289 memcpy(vp->vp_octets, data, length);
2293 * Ensure there's no encryption or tag stuff,
2294 * we just pass the attribute as-is.
2296 memset(&vp->flags, 0, sizeof(vp->flags));
2302 static void rad_sortvp(VALUE_PAIR **head)
2305 VALUE_PAIR *vp, **tail;
2308 * Walk over the VP's, sorting them in order. Did I
2309 * mention that I hate WiMAX continuations?
2311 * And bubble sort! WTF is up with that?
2318 if (!vp->next) break;
2320 if (vp->attribute > vp->next->attribute) {
2322 vp->next = (*tail)->next;
2333 * Walk the packet, looking for continuations of this attribute.
2335 * This is (worst-case) O(N^2) in the number of RADIUS
2336 * attributes. That happens only when perverse clients create
2337 * continued attributes, AND separate the fragmented portions
2338 * with a lot of other attributes.
2340 * Sane clients should put the fragments next to each other, in
2341 * which case this is O(N), in the number of fragments.
2343 static uint8_t *rad_coalesce(unsigned int attribute, int vendor,
2344 size_t length, uint8_t *data,
2345 size_t packet_length, size_t *ptlv_length)
2349 size_t tlv_length = length;
2350 uint8_t *ptr, *tlv, *tlv_data;
2352 for (ptr = data + length;
2353 ptr != (data + packet_length);
2355 /* FIXME: Check that there are 6 bytes of data here... */
2356 if ((ptr[0] != PW_VENDOR_SPECIFIC) ||
2357 (ptr[1] < (2 + 4 + 3)) || /* WiMAX VSA with continuation */
2358 (ptr[2] != 0) || (ptr[3] != 0) || /* our requirement */
2359 (ptr[4] != ((vendor >> 8) & 0xff)) ||
2360 (ptr[5] != (vendor & 0xff))) {
2364 memcpy(&lvalue, ptr + 2, 4); /* Vendor Id */
2365 lvalue = ntohl(lvalue);
2367 lvalue |= ptr[2 + 4]; /* add in VSA number */
2368 if (lvalue != attribute) continue;
2371 * If the vendor-length is too small, it's badly
2372 * formed, so we stop.
2374 if ((ptr[2 + 4 + 1]) < 3) break;
2376 tlv_length += ptr[2 + 4 + 1] - 3;
2377 if ((ptr[2 + 4 + 1 + 1] & 0x80) == 0) break;
2380 tlv = tlv_data = malloc(tlv_length);
2381 if (!tlv_data) return NULL;
2383 memcpy(tlv, data, length);
2387 * Now we walk the list again, copying the data over to
2388 * our newly created memory.
2390 for (ptr = data + length;
2391 ptr != (data + packet_length);
2395 if ((ptr[0] != PW_VENDOR_SPECIFIC) ||
2396 (ptr[1] < (2 + 4 + 3)) || /* WiMAX VSA with continuation */
2397 (ptr[2] != 0) || (ptr[3] != 0)) { /* our requirement */
2401 memcpy(&lvalue, ptr + 2, 4);
2402 lvalue = ntohl(lvalue);
2404 lvalue |= ptr[2 + 4];
2405 if (lvalue != attribute) continue;
2408 * If the vendor-length is too small, it's badly
2409 * formed, so we stop.
2411 if ((ptr[2 + 4 + 1]) < 3) break;
2413 this_length = ptr[2 + 4 + 1] - 3;
2414 memcpy(tlv, ptr + 2 + 4 + 3, this_length);
2417 ptr[2 + 4] = 0; /* What a hack! */
2418 if ((ptr[2 + 4 + 1 + 1] & 0x80) == 0) break;
2421 *ptlv_length = tlv_length;
2426 * Walk over Evil WIMAX Hell, creating attributes.
2428 * Won't someone think of the children? What if they read this code?
2430 static VALUE_PAIR *recurse_evil(const RADIUS_PACKET *packet,
2431 const RADIUS_PACKET *original,
2433 int attribute, int vendor,
2434 uint8_t *ptr, size_t len)
2436 VALUE_PAIR *head = NULL;
2437 VALUE_PAIR **tail = &head;
2439 uint8_t *y; /* why do I need to do this? */
2442 * Sanity check the attribute.
2444 for (y = ptr; y < (ptr + len); y += y[1]) {
2445 if ((y[0] == 0) || ((y + 2) > (ptr + len)) ||
2446 (y[1] < 2) || ((y + y[1]) > (ptr + len))) {
2451 for (y = ptr; y < (ptr + len); y += y[1]) {
2452 vp = paircreate(attribute | (ptr[0] << 16), vendor,
2460 if (!data2vp(packet, original, secret,
2461 y[1] - 2, y + 2, vp)) {
2473 * Start at the *data* portion of a continued attribute. search
2474 * through the rest of the attributes to find a matching one, and
2475 * add it's contents to our contents.
2477 static VALUE_PAIR *rad_continuation2vp(const RADIUS_PACKET *packet,
2478 const RADIUS_PACKET *original,
2479 const char *secret, int attribute,
2481 int length, /* CANNOT be zero */
2482 uint8_t *data, size_t packet_length,
2483 int flag, DICT_ATTR *da)
2485 size_t tlv_length, left;
2488 VALUE_PAIR *vp, *head, **tail;
2492 * Ensure we have data that hasn't been split across
2493 * multiple attributes.
2496 tlv_data = rad_coalesce(attribute, vendor, length,
2497 data, packet_length, &tlv_length);
2498 if (!tlv_data) return NULL;
2501 tlv_length = length;
2505 * Non-TLV types cannot be continued across multiple
2506 * attributes. This is true even of keys that are
2507 * encrypted with the tunnel-password method. The spec
2508 * says that they can be continued... but also that the
2509 * keys are 160 bits, which means that they CANNOT be
2512 * Note that we don't check "flag" here. The calling
2515 if (!da || (da->type != PW_TYPE_TLV)) {
2517 if (tlv_data == data) { /* true if we had 'goto' */
2518 tlv_data = malloc(tlv_length);
2519 if (!tlv_data) return NULL;
2520 memcpy(tlv_data, data, tlv_length);
2523 vp = paircreate(attribute, vendor, PW_TYPE_OCTETS);
2524 if (!vp) return NULL;
2526 vp->type = PW_TYPE_TLV;
2527 vp->flags.encrypt = FLAG_ENCRYPT_NONE;
2528 vp->flags.has_tag = 0;
2529 vp->flags.is_tlv = 0;
2530 vp->vp_tlv = tlv_data;
2531 vp->length = tlv_length;
2533 } /* else it WAS a TLV, go decode the sub-tlv's */
2536 * Now (sigh) we walk over the TLV, seeing if it is
2540 for (ptr = tlv_data;
2541 ptr != (tlv_data + tlv_length);
2546 goto not_well_formed;
2553 * Now we walk over the TLV *again*, creating sub-tlv's.
2558 for (ptr = tlv_data;
2559 ptr != (tlv_data + tlv_length);
2562 tlv_da = dict_attrbyvalue(attribute | (ptr[0] << 8), vendor);
2563 if (tlv_da && (tlv_da->type == PW_TYPE_TLV)) {
2564 vp = recurse_evil(packet, original, secret,
2565 attribute | (ptr[0] << 8),
2566 vendor, ptr + 2, ptr[1] - 2);
2570 goto not_well_formed;
2573 vp = paircreate(attribute | (ptr[0] << 8), vendor,
2577 goto not_well_formed;
2580 if (!data2vp(packet, original, secret,
2581 ptr[1] - 2, ptr + 2, vp)) {
2583 goto not_well_formed;
2589 while (*tail) tail = &((*tail)->next);
2593 * TLV's MAY be continued, but sometimes they're not.
2595 if (tlv_data != data) free(tlv_data);
2597 if (head->next) rad_sortvp(&head);
2604 * Parse a RADIUS attribute into a data structure.
2606 VALUE_PAIR *rad_attr2vp(const RADIUS_PACKET *packet,
2607 const RADIUS_PACKET *original,
2608 const char *secret, int attribute, int vendor,
2609 int length, const uint8_t *data)
2613 vp = paircreate(attribute, vendor, PW_TYPE_OCTETS);
2614 if (!vp) return NULL;
2616 return data2vp(packet, original, secret, length, data, vp);
2621 * Calculate/check digest, and decode radius attributes.
2623 * -1 on decoding error
2626 int rad_decode(RADIUS_PACKET *packet, RADIUS_PACKET *original,
2630 uint32_t vendorcode;
2633 uint8_t *ptr, *vsa_ptr;
2638 radius_packet_t *hdr;
2639 int vsa_tlen, vsa_llen, vsa_offset;
2640 DICT_VENDOR *dv = NULL;
2641 int num_attributes = 0;
2644 * Extract attribute-value pairs
2646 hdr = (radius_packet_t *)packet->data;
2648 packet_length = packet->data_len - AUTH_HDR_LEN;
2651 * There may be VP's already in the packet. Don't
2654 for (tail = &packet->vps; *tail != NULL; tail = &((*tail)->next)) {
2660 vsa_tlen = vsa_llen = 1;
2664 * We have to read at least two bytes.
2666 * rad_recv() above ensures that this is OK.
2668 while (packet_length > 0) {
2673 * Normal attribute, handle it like normal.
2675 if (vendorcode == 0) {
2677 * No room to read attr/length,
2678 * or bad attribute, or attribute is
2679 * too short, or attribute is too long,
2680 * stop processing the packet.
2682 if ((packet_length < 2) ||
2683 (ptr[0] == 0) || (ptr[1] < 2) ||
2684 (ptr[1] > packet_length)) break;
2692 if (attribute != PW_VENDOR_SPECIFIC) goto create_pair;
2695 * No vendor code, or ONLY vendor code.
2697 if (attrlen <= 4) goto create_pair;
2703 * Handle Vendor-Specific
2705 if (vendorlen == 0) {
2711 * attrlen was checked above.
2713 memcpy(&lvalue, ptr, 4);
2714 myvendor = ntohl(lvalue);
2717 * Zero isn't allowed.
2719 if (myvendor == 0) goto create_pair;
2722 * This is an implementation issue.
2723 * We currently pack vendor into the upper
2724 * 16 bits of a 32-bit attribute number,
2725 * so we can't handle vendor numbers larger
2728 if (myvendor > 65535) goto create_pair;
2730 vsa_tlen = vsa_llen = 1;
2732 dv = dict_vendorbyvalue(myvendor);
2734 vsa_tlen = dv->type;
2735 vsa_llen = dv->length;
2736 if (dv->flags) vsa_offset = 1;
2740 * Sweep through the list of VSA's,
2741 * seeing if they exactly fill the
2742 * outer Vendor-Specific attribute.
2744 * If not, create a raw Vendor-Specific.
2747 sublen = attrlen - 4;
2750 * See if we can parse it.
2756 * Not enough room for one more
2759 if (sublen < (vsa_tlen + vsa_llen + vsa_offset)) goto create_pair;
2762 * Ensure that the attribute number
2771 myattr = (subptr[0] << 8) | subptr[1];
2775 if ((subptr[0] != 0) ||
2776 (subptr[1] != 0)) goto create_pair;
2778 myattr = (subptr[2] << 8) | subptr[3];
2782 * Our dictionary is broken.
2791 ptr += 4 + vsa_tlen;
2792 attrlen -= (4 + vsa_tlen);
2793 packet_length -= 4 + vsa_tlen;
2797 if (subptr[vsa_tlen] < (vsa_tlen + vsa_llen + vsa_offset))
2800 if (subptr[vsa_tlen] > sublen)
2805 * Reserved bits MUST be
2809 ((subptr[vsa_tlen + vsa_llen] & 0x7f) != 0))
2812 sublen -= subptr[vsa_tlen];
2813 subptr += subptr[vsa_tlen];
2817 if (subptr[vsa_tlen] != 0) goto create_pair;
2818 if (subptr[vsa_tlen + 1] < (vsa_tlen + vsa_llen))
2820 if (subptr[vsa_tlen + 1] > sublen)
2822 sublen -= subptr[vsa_tlen + 1];
2823 subptr += subptr[vsa_tlen + 1];
2827 * Our dictionaries are
2833 } while (sublen > 0);
2835 vendorcode = myvendor;
2836 vendorlen = attrlen - 4;
2843 * attrlen is the length of this attribute.
2844 * total_len is the length of the encompassing
2853 attribute = (ptr[0] << 8) | ptr[1];
2856 default: /* can't hit this. */
2864 attrlen = ptr[0] - (vsa_tlen + vsa_llen + vsa_offset);
2868 attrlen = ptr[1] - (vsa_tlen + vsa_llen);
2871 default: /* can't hit this. */
2875 ptr += vsa_llen + vsa_offset;
2876 vendorlen -= vsa_tlen + vsa_llen + vsa_offset + attrlen;
2877 packet_length -= (vsa_tlen + vsa_llen + vsa_offset);
2880 * Ignore VSAs that have no data.
2882 if (attrlen == 0) goto next;
2885 * WiMAX attributes of type 0 are ignored. They
2886 * are a secret flag to us that the attribute has
2887 * already been dealt with.
2889 if ((vendorcode == VENDORPEC_WIMAX) && (attribute == 0)) {
2896 da = dict_attrbyvalue(attribute, vendorcode);
2899 * If it's NOT continued, AND we know
2900 * about it, AND it's not a TLV, we can
2901 * create a normal pair.
2903 if (((vsa_ptr[2] & 0x80) == 0) &&
2904 da && (da->type != PW_TYPE_TLV)) goto create_pair;
2907 * Else it IS continued, or it's a TLV.
2908 * Go do a lot of work to find the stuff.
2910 pair = rad_continuation2vp(packet, original, secret,
2911 attribute, vendorcode,
2914 ((vsa_ptr[2] & 0x80) != 0),
2920 * Create the attribute, setting the default type
2921 * to 'octets'. If the type in the dictionary
2922 * is different, then the dictionary type will
2923 * over-ride this one.
2925 * If the attribute has no data, then discard it.
2927 * Unless it's CUI. Damn you, CUI!
2931 (attribute != PW_CHARGEABLE_USER_IDENTITY)) goto next;
2933 pair = rad_attr2vp(packet, original, secret,
2934 attribute, vendorcode, attrlen, ptr);
2936 pairfree(&packet->vps);
2937 fr_strerror_printf("out of memory");
2951 * VSA's may not have been counted properly in
2952 * rad_packet_ok() above, as it is hard to count
2953 * then without using the dictionary. We
2954 * therefore enforce the limits here, too.
2956 if ((fr_max_attributes > 0) &&
2957 (num_attributes > fr_max_attributes)) {
2958 char host_ipaddr[128];
2960 pairfree(&packet->vps);
2961 fr_strerror_printf("WARNING: Possible DoS attack from host %s: Too many attributes in request (received %d, max %d are allowed).",
2962 inet_ntop(packet->src_ipaddr.af,
2963 &packet->src_ipaddr.ipaddr,
2964 host_ipaddr, sizeof(host_ipaddr)),
2965 num_attributes, fr_max_attributes);
2970 if (vendorlen == 0) vendorcode = 0;
2972 packet_length -= attrlen;
2976 * Merge information from the outside world into our
2979 fr_rand_seed(packet->data, AUTH_HDR_LEN);
2988 * We assume that the passwd buffer passed is big enough.
2989 * RFC2138 says the password is max 128 chars, so the size
2990 * of the passwd buffer must be at least 129 characters.
2991 * Preferably it's just MAX_STRING_LEN.
2993 * int *pwlen is updated to the new length of the encrypted
2994 * password - a multiple of 16 bytes.
2996 int rad_pwencode(char *passwd, size_t *pwlen, const char *secret,
2997 const uint8_t *vector)
2999 FR_MD5_CTX context, old;
3000 uint8_t digest[AUTH_VECTOR_LEN];
3001 int i, n, secretlen;
3005 * RFC maximum is 128 bytes.
3007 * If length is zero, pad it out with zeros.
3009 * If the length isn't aligned to 16 bytes,
3010 * zero out the extra data.
3014 if (len > 128) len = 128;
3017 memset(passwd, 0, AUTH_PASS_LEN);
3018 len = AUTH_PASS_LEN;
3019 } else if ((len % AUTH_PASS_LEN) != 0) {
3020 memset(&passwd[len], 0, AUTH_PASS_LEN - (len % AUTH_PASS_LEN));
3021 len += AUTH_PASS_LEN - (len % AUTH_PASS_LEN);
3026 * Use the secret to setup the decryption digest
3028 secretlen = strlen(secret);
3030 fr_MD5Init(&context);
3031 fr_MD5Update(&context, (const uint8_t *) secret, secretlen);
3032 old = context; /* save intermediate work */
3035 * Encrypt it in place. Don't bother checking
3036 * len, as we've ensured above that it's OK.
3038 for (n = 0; n < len; n += AUTH_PASS_LEN) {
3040 fr_MD5Update(&context, vector, AUTH_PASS_LEN);
3041 fr_MD5Final(digest, &context);
3044 fr_MD5Update(&context,
3045 (uint8_t *) passwd + n - AUTH_PASS_LEN,
3047 fr_MD5Final(digest, &context);
3050 for (i = 0; i < AUTH_PASS_LEN; i++) {
3051 passwd[i + n] ^= digest[i];
3061 int rad_pwdecode(char *passwd, size_t pwlen, const char *secret,
3062 const uint8_t *vector)
3064 FR_MD5_CTX context, old;
3065 uint8_t digest[AUTH_VECTOR_LEN];
3067 size_t n, secretlen;
3070 * The RFC's say that the maximum is 128.
3071 * The buffer we're putting it into above is 254, so
3072 * we don't need to do any length checking.
3074 if (pwlen > 128) pwlen = 128;
3079 if (pwlen == 0) goto done;
3082 * Use the secret to setup the decryption digest
3084 secretlen = strlen(secret);
3086 fr_MD5Init(&context);
3087 fr_MD5Update(&context, (const uint8_t *) secret, secretlen);
3088 old = context; /* save intermediate work */
3091 * The inverse of the code above.
3093 for (n = 0; n < pwlen; n += AUTH_PASS_LEN) {
3095 fr_MD5Update(&context, vector, AUTH_VECTOR_LEN);
3096 fr_MD5Final(digest, &context);
3099 if (pwlen > AUTH_PASS_LEN) {
3100 fr_MD5Update(&context, (uint8_t *) passwd,
3104 fr_MD5Final(digest, &context);
3107 if (pwlen > (n + AUTH_PASS_LEN)) {
3108 fr_MD5Update(&context, (uint8_t *) passwd + n,
3113 for (i = 0; i < AUTH_PASS_LEN; i++) {
3114 passwd[i + n] ^= digest[i];
3119 passwd[pwlen] = '\0';
3120 return strlen(passwd);
3125 * Encode Tunnel-Password attributes when sending them out on the wire.
3127 * int *pwlen is updated to the new length of the encrypted
3128 * password - a multiple of 16 bytes.
3130 * This is per RFC-2868 which adds a two char SALT to the initial intermediate
3133 int rad_tunnel_pwencode(char *passwd, size_t *pwlen, const char *secret,
3134 const uint8_t *vector)
3136 uint8_t buffer[AUTH_VECTOR_LEN + MAX_STRING_LEN + 3];
3137 unsigned char digest[AUTH_VECTOR_LEN];
3139 int i, n, secretlen;
3144 if (len > 127) len = 127;
3147 * Shift the password 3 positions right to place a salt and original
3148 * length, tag will be added automatically on packet send
3150 for (n=len ; n>=0 ; n--) passwd[n+3] = passwd[n];
3154 * save original password length as first password character;
3161 * Generate salt. The RFC's say:
3163 * The high bit of salt[0] must be set, each salt in a
3164 * packet should be unique, and they should be random
3166 * So, we set the high bit, add in a counter, and then
3167 * add in some CSPRNG data. should be OK..
3169 salt[0] = (0x80 | ( ((salt_offset++) & 0x0f) << 3) |
3170 (fr_rand() & 0x07));
3171 salt[1] = fr_rand();
3174 * Padd password to multiple of AUTH_PASS_LEN bytes.
3176 n = len % AUTH_PASS_LEN;
3178 n = AUTH_PASS_LEN - n;
3179 for (; n > 0; n--, len++)
3182 /* set new password length */
3186 * Use the secret to setup the decryption digest
3188 secretlen = strlen(secret);
3189 memcpy(buffer, secret, secretlen);
3191 for (n2 = 0; n2 < len; n2+=AUTH_PASS_LEN) {
3193 memcpy(buffer + secretlen, vector, AUTH_VECTOR_LEN);
3194 memcpy(buffer + secretlen + AUTH_VECTOR_LEN, salt, 2);
3195 fr_md5_calc(digest, buffer, secretlen + AUTH_VECTOR_LEN + 2);
3197 memcpy(buffer + secretlen, passwd + n2 - AUTH_PASS_LEN, AUTH_PASS_LEN);
3198 fr_md5_calc(digest, buffer, secretlen + AUTH_PASS_LEN);
3201 for (i = 0; i < AUTH_PASS_LEN; i++) {
3202 passwd[i + n2] ^= digest[i];
3210 * Decode Tunnel-Password encrypted attributes.
3212 * Defined in RFC-2868, this uses a two char SALT along with the
3213 * initial intermediate value, to differentiate it from the
3216 int rad_tunnel_pwdecode(uint8_t *passwd, size_t *pwlen, const char *secret,
3217 const uint8_t *vector)
3219 FR_MD5_CTX context, old;
3220 uint8_t digest[AUTH_VECTOR_LEN];
3222 unsigned i, n, len, reallen;
3227 * We need at least a salt.
3230 fr_strerror_printf("tunnel password is too short");
3235 * There's a salt, but no password. Or, there's a salt
3236 * and a 'data_len' octet. It's wrong, but at least we
3237 * can figure out what it means: the password is empty.
3239 * Note that this means we ignore the 'data_len' field,
3240 * if the attribute length tells us that there's no
3241 * more data. So the 'data_len' field may be wrong,
3250 len -= 2; /* discount the salt */
3253 * Use the secret to setup the decryption digest
3255 secretlen = strlen(secret);
3257 fr_MD5Init(&context);
3258 fr_MD5Update(&context, (const uint8_t *) secret, secretlen);
3259 old = context; /* save intermediate work */
3262 * Set up the initial key:
3264 * b(1) = MD5(secret + vector + salt)
3266 fr_MD5Update(&context, vector, AUTH_VECTOR_LEN);
3267 fr_MD5Update(&context, passwd, 2);
3270 for (n = 0; n < len; n += AUTH_PASS_LEN) {
3274 fr_MD5Final(digest, &context);
3279 * A quick check: decrypt the first octet
3280 * of the password, which is the
3281 * 'data_len' field. Ensure it's sane.
3283 reallen = passwd[2] ^ digest[0];
3284 if (reallen >= len) {
3285 fr_strerror_printf("tunnel password is too long for the attribute");
3289 fr_MD5Update(&context, passwd + 2, AUTH_PASS_LEN);
3293 fr_MD5Final(digest, &context);
3296 fr_MD5Update(&context, passwd + n + 2, AUTH_PASS_LEN);
3299 for (i = base; i < AUTH_PASS_LEN; i++) {
3300 passwd[n + i - 1] = passwd[n + i + 2] ^ digest[i];
3305 * See make_tunnel_password, above.
3307 if (reallen > 239) reallen = 239;
3310 passwd[reallen] = 0;
3316 * Encode a CHAP password
3318 * FIXME: might not work with Ascend because
3319 * we use vp->length, and Ascend gear likes
3320 * to send an extra '\0' in the string!
3322 int rad_chap_encode(RADIUS_PACKET *packet, uint8_t *output, int id,
3323 VALUE_PAIR *password)
3327 uint8_t string[MAX_STRING_LEN * 2 + 1];
3328 VALUE_PAIR *challenge;
3331 * Sanity check the input parameters
3333 if ((packet == NULL) || (password == NULL)) {
3338 * Note that the password VP can be EITHER
3339 * a User-Password attribute (from a check-item list),
3340 * or a CHAP-Password attribute (the client asking
3341 * the library to encode it).
3349 memcpy(ptr, password->vp_strvalue, password->length);
3350 ptr += password->length;
3351 i += password->length;
3354 * Use Chap-Challenge pair if present,
3355 * Request-Authenticator otherwise.
3357 challenge = pairfind(packet->vps, PW_CHAP_CHALLENGE, 0);
3359 memcpy(ptr, challenge->vp_strvalue, challenge->length);
3360 i += challenge->length;
3362 memcpy(ptr, packet->vector, AUTH_VECTOR_LEN);
3363 i += AUTH_VECTOR_LEN;
3367 fr_md5_calc((uint8_t *)output + 1, (uint8_t *)string, i);
3374 * Seed the random number generator.
3376 * May be called any number of times.
3378 void fr_rand_seed(const void *data, size_t size)
3383 * Ensure that the pool is initialized.
3385 if (!fr_rand_initialized) {
3388 memset(&fr_rand_pool, 0, sizeof(fr_rand_pool));
3390 fd = open("/dev/urandom", O_RDONLY);
3396 while (total < sizeof(fr_rand_pool.randrsl)) {
3397 this = read(fd, fr_rand_pool.randrsl,
3398 sizeof(fr_rand_pool.randrsl) - total);
3399 if ((this < 0) && (errno != EINTR)) break;
3400 if (this > 0) total += this;
3404 fr_rand_pool.randrsl[0] = fd;
3405 fr_rand_pool.randrsl[1] = time(NULL);
3406 fr_rand_pool.randrsl[2] = errno;
3409 fr_randinit(&fr_rand_pool, 1);
3410 fr_rand_pool.randcnt = 0;
3411 fr_rand_initialized = 1;
3417 * Hash the user data
3420 if (!hash) hash = fr_rand();
3421 hash = fr_hash_update(data, size, hash);
3423 fr_rand_pool.randmem[fr_rand_pool.randcnt] ^= hash;
3428 * Return a 32-bit random number.
3430 uint32_t fr_rand(void)
3435 * Ensure that the pool is initialized.
3437 if (!fr_rand_initialized) {
3438 fr_rand_seed(NULL, 0);
3441 num = fr_rand_pool.randrsl[fr_rand_pool.randcnt++];
3442 if (fr_rand_pool.randcnt >= 256) {
3443 fr_rand_pool.randcnt = 0;
3444 fr_isaac(&fr_rand_pool);
3452 * Allocate a new RADIUS_PACKET
3454 RADIUS_PACKET *rad_alloc(int newvector)
3458 if ((rp = malloc(sizeof(RADIUS_PACKET))) == NULL) {
3459 fr_strerror_printf("out of memory");
3462 memset(rp, 0, sizeof(*rp));
3468 uint32_t hash, base;
3471 * Don't expose the actual contents of the random
3475 for (i = 0; i < AUTH_VECTOR_LEN; i += sizeof(uint32_t)) {
3476 hash = fr_rand() ^ base;
3477 memcpy(rp->vector + i, &hash, sizeof(hash));
3480 fr_rand(); /* stir the pool again */
3485 RADIUS_PACKET *rad_alloc_reply(RADIUS_PACKET *packet)
3487 RADIUS_PACKET *reply;
3489 if (!packet) return NULL;
3491 reply = rad_alloc(0);
3492 if (!reply) return NULL;
3495 * Initialize the fields from the request.
3497 reply->sockfd = packet->sockfd;
3498 reply->dst_ipaddr = packet->src_ipaddr;
3499 reply->src_ipaddr = packet->dst_ipaddr;
3500 reply->dst_port = packet->src_port;
3501 reply->src_port = packet->dst_port;
3502 reply->id = packet->id;
3503 reply->code = 0; /* UNKNOWN code */
3504 memcpy(reply->vector, packet->vector,
3505 sizeof(reply->vector));
3508 reply->data_len = 0;
3515 * Free a RADIUS_PACKET
3517 void rad_free(RADIUS_PACKET **radius_packet_ptr)
3519 RADIUS_PACKET *radius_packet;
3521 if (!radius_packet_ptr || !*radius_packet_ptr) return;
3522 radius_packet = *radius_packet_ptr;
3524 free(radius_packet->data);
3526 pairfree(&radius_packet->vps);
3528 free(radius_packet);
3530 *radius_packet_ptr = NULL;