Timeline for How to effectively bypass GCC stack smashing detection
Current License: CC BY-SA 3.0
10 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jun 1, 2020 at 20:33 | comment | added | Solomon Ucko | The reason the prefix is 52 bytes instead of 32 is there are also 8 bytes of canary, plus 8 bytes between the canary and the edge of the stack (the canary is at Stack[-0x10]) and 4 bytes between the edge of the stack and the parameter (the parameter is at Stack[0x4]), for a total of 20 bytes extra. | |
| Aug 22, 2018 at 9:01 | history | tweeted | twitter.com/StackReverseEng/status/1032191038956290048 | ||
| Aug 19, 2018 at 22:11 | vote | accept | u185619 | ||
| Aug 19, 2018 at 13:56 | answer | added | BitParser | timeline score: 8 | |
| Feb 23, 2016 at 13:13 | review | Close votes | |||
| Feb 28, 2016 at 3:04 | |||||
| Feb 23, 2016 at 7:36 | answer | added | Febriyanto Nugroho | timeline score: 6 | |
| Jan 18, 2016 at 12:06 | review | Close votes | |||
| Feb 15, 2016 at 3:05 | |||||
| Jan 18, 2016 at 11:51 | comment | added | jvoisin | I'm voting to close this question as off-topic because I don't think that stackexchange is the right place to spoil wargames : they are meant to be played, and posting a complete solution will kill the fun for every player. | |
| Jan 16, 2016 at 23:10 | answer | added | Jason Geffner | timeline score: 8 | |
| Jan 16, 2016 at 22:16 | history | asked | u185619 | CC BY-SA 3.0 |