diff options
| -rw-r--r-- | .vscode/tasks.json | 3 | ||||
| -rw-r--r-- | csci5271/hw1/hw1p3.c | 25 | ||||
| -rw-r--r-- | csci5271/hw1/hw1p4.c | 17 | ||||
| -rw-r--r-- | csci5271/hw1/hw1writeup.md | 47 |
4 files changed, 73 insertions, 19 deletions
diff --git a/.vscode/tasks.json b/.vscode/tasks.json index 6b01641..a78588b 100644 --- a/.vscode/tasks.json +++ b/.vscode/tasks.json @@ -19,6 +19,9 @@ "kind": "build", "isDefault": true }, + "options":{ + "cwd": "${fileDirname}" + }, "presentation": { "echo": false, "reveal": "always", diff --git a/csci5271/hw1/hw1p3.c b/csci5271/hw1/hw1p3.c new file mode 100644 index 0000000..53ecc96 --- /dev/null +++ b/csci5271/hw1/hw1p3.c @@ -0,0 +1,25 @@ +#include <stdio.h> +#include <string.h> + +void payment(char *name, double amount_cny, char *purpose, int purpose_len) +{ + double amount_usd = amount_cny / 6.466; + char memo[40]; + strcpy(memo, "Payment for: "); + memcpy(memo + strlen(memo), purpose, purpose_len); + //write_check(name, amount_usd, memo); + printf("address of amount_usd: %p\naddress of memo: %p\n", &amount_usd, memo); + printf("purpose_len: %d\n", purpose_len); + printf("amount_usd: %f\npurpose: %s\n", amount_usd, purpose); + return; +} + +int main() +{ + char name[] = "username"; + double amount_cny = 646.60; + char purpose[] = "\x41\x41\x41\x41\x41\x41\x41\x41\x41\x41\x41\x41\x41\x41\x41\x41\x41\x41\x41\x41\x41\x41\x41\x41\x41\x41\x41\x41\x41\x41\x41\x41\x41\x41"; + int purpose_len = strlen(purpose); + payment(name, amount_cny, purpose, purpose_len); + return 0; +}
\ No newline at end of file diff --git a/csci5271/hw1/hw1p4.c b/csci5271/hw1/hw1p4.c index e449de5..4526e43 100644 --- a/csci5271/hw1/hw1p4.c +++ b/csci5271/hw1/hw1p4.c @@ -1,11 +1,13 @@ #include <stdio.h> /* Reverse the elements from FROM to TO, inclusive */ -void reverse_range(int *a, int from, int to) { +void reverse_range(int *a, int from, int to) +{ unsigned int *p = &a[from]; unsigned int *q = &a[to]; /* Until the pointers move past each other: */ - while (!(p == q + 1 || p == q + 2)) { + while (!(p == q + 1 || p == q + 2)) + { /* Swap *p with *q, without using a temporary variable */ *p += *q; /* *p == P + Q */ *q = *p - *q; /* *q == P + Q - Q = P */ @@ -15,11 +17,14 @@ void reverse_range(int *a, int from, int to) { q--; } } -int main() { + +int main() +{ int a[10] = {255, 0, -65536, 2147483647, -2147483648, - -1, 0, 1, 2, 3}; - reverse_range(a, 0, 9); - for (int i = 0; i < 10; i++) { + -1, 0, 1, 2, 3}; + reverse_range(a, 9, 0); + for (int i = 0; i < 10; i++) + { printf("%d ", a[i]); } printf("\n"); diff --git a/csci5271/hw1/hw1writeup.md b/csci5271/hw1/hw1writeup.md index 091f4aa..aab6154 100644 --- a/csci5271/hw1/hw1writeup.md +++ b/csci5271/hw1/hw1writeup.md @@ -2,24 +2,44 @@ ## Q1 +### Database Threat Model +The main threat of the model is accessing the database. Any access to the server of the database is considered a threat because it can potentially be used as a vector for privilege escalation and database access. The server can be accessed either over a network that may or may not exist or directly connecting to the machine itself. + +The potential attackers would be any students or other users who potentially have access to the machine with the database. + +The most reasonable attacks would be guessing the credentials to access the database, most likely by brute forcing a password if one exists. + +Impossible threats would be from people and devices that cannot access the machine containing the database. + +### Without Network + +Without networking hardware, one major threat vector (the network) is gone. + +One way to mitigate threats is to encrypt the database and the computer containing the database with a password resistant to brute forcing if someone were to obtain the computer. If the algorithm is slow, an old computer could be even more slowed down by the decryption. + +Another way to mitigate threats is to lock the computer up when it is not being used. ## Q2 ### A: Perl -After adding a name to the request, add a semicolon followed by the command. The semicolon is the shell command separator which allows it to parse commands. +After adding a name to the request, add a semicolon followed by the command. The semicolon is the shell command separator which allows it to parse new commands. -#### Example Request +#### Example Request Body -``` -"?field-name=;perl+-e+'`command`'" +```perl +'field-name=; ls' ``` ### B: C ## Q3 +Overfilling the buffer normally causes the program to crash from stack smashing. This can be undone by finding the canary value and using it to overwrite the canary value after the buffer overflow. The CFI can be beaten by jumping to a known legal target. + +On big and little endian machines, the byte order is reversed. + ## Q4 ### A @@ -28,15 +48,13 @@ After adding a name to the request, add a semicolon followed by the command. The If the function is called with `to` larger than outer bound of the array, there is a buffer overflow that happens. For example, running it by default with an array of size 10 with a `to` of 11 on gcc 11.1 causes it to crash because of stack smashing. -##### Mistake 1b: Underloading the array - -If the function is called with `from` smaller than 0 will cause some values of the array to be replaced with other values from memory addresses nearby. It did not crash, but it is not the intended behavior. +#### Mistake 1b: Negative numbers the array -#### Mistake 2 +If the function is called with `from` smaller than 0 will cause the array to look at addresses before the array, potentially causing the program to segfault. -a +#### Mistake 2: Swapping the to and from -#### Mistake 3 +If the function is called with `from` larger than `to`, the program will segfault from accessing invalid memory addresses. ### B: Same Signature @@ -61,19 +79,22 @@ void reverse_range(int *a, int from, int to) { ### C: Different Signature ```c - int* reverse_range(int arr[], int arrSize, int from, int to) { + void reverse_range(int *arr, int arrSize, int from, int to) { + //Program should exit if it works backwards or goes out of bounds if (from < 0 || to >= arrSize || to < from) - return NULL; + return; for (int i = from; i < to; i++) { int temp = arr[i]; arr[i] = arr[to]; arr[to] = temp; to--; } - return arr; + return; } ``` +The main difference is that the function needs the size of the array since it can't be found from the function itself. + ## Q5 ### A |