CSE 127: Lecture 6
The topics covered in this lecture are
slammer and
Differential Timing Analysis,
Port 1434 buffer overflow vulnerability.
We started on analyzing the modular exponentiation algorithm:
Integer modexp(Integer x, Bit e[], int k, Integer n)
{
Integer y = 1, z = x;
int i;
// k-1 i
// exponent e = sum e[i] 2
// i=0
for (i = 0; i < k; i++) {
if (1 == e[i]) {
y = y * z mod n;
}
z = z * z mod n;
}
return y;
}
Links
These are links additional security-related information. Exploring
them is optional unless otherwise stated.
[
search CSE |
CSE |
bsy's home page |
links |
webster |
MRQE |
google |
yahoo |
citeseer |
pgp certserver |
openpgp certserver
]
bsy+cse127.w03@cs.ucsd.edu, last updated Wed Jan 29 21:15:34 PST 2003. Copyright 2003 Bennet Yee.
email bsy.