Re: x86 MSRs - example program

Matthias Urlichs (
2 Mar 1997 01:33:59 +0100

In, article <m0w0aqh-000A8LC@cerebro>, (Marc Lehmann) writes:
> ON the other hand... security hole????? how????????
Cryptography. If you know exactly how long a given algorithm takes for
different inputs, you can sometimes infer clues about the secret key.

It's highly unlikely that anybody ever tries to do that kind of thing to
exploit security weaknesses on a Linux box, but you never know...

IMHO, we should have a bit in the securelevel variable which controls
userspace read access to the cycle counter. Assuming that the securelevel
variable ever becomes a bitmap. ;-)

Weirdness is the best defense
Matthias Urlichs         \  noris network GmbH  /  Xlink-POP Nürnberg 
Schleiermacherstraße 12   \   Linux+Internet   /   EMail:
90491 Nürnberg (Germany)   \    Consulting+Programming+Networking+etc'ing
   PGP: 1024/4F578875   1B 89 E2 1C 43 EA 80 44  15 D2 29 CF C6 C7 E0 DE
       Click <A HREF="">here</A>.    42