typos
authorChristian Urban <christian dot urban at kcl dot ac dot uk>
Wed, 05 Aug 2015 09:52:50 +0200
changeset 377 fed7ce62b6d6
parent 376 8098bde31185
child 378 94988aa97974
typos
handouts/ho03.pdf
handouts/ho03.tex
Binary file handouts/ho03.pdf has changed
--- a/handouts/ho03.tex	Wed Aug 05 09:48:01 2015 +0200
+++ b/handouts/ho03.tex	Wed Aug 05 09:52:50 2015 +0200
@@ -689,12 +689,12 @@
 stack executable, thus the example in Figure~\ref{C3}
 works as intended. While this might be considered
 cheating....since I explicitly switched off all defences, I
-hope I was able convey that this is actually not too far from
+hope I was able convey the point that this is actually not too far from
 realistic scenarios. I have shown you the classic version of
 the buffer overflow attacks. Updated variants do exist. Also
 one might argue buffer-overflow attacks have been solved on
-computers (desktops or servers) but the computing landscape of
-nowadays is wider than ever. The main problem nowadays are
+computers (desktops or servers) but the computing landscape of today 
+is much wider than that. The main problem today are
 embedded systems against which attacker can equally cause a
 lot of harm and which are much less defended. Anthony Bonkoski
 makes a similar argument in his security blog: