lkml.org 
[lkml]   [1997]   [Mar]   [2]   [last100]   RSS Feed
Views: [wrap][no wrap]   [headers]  [forward] 
 
Messages in this thread
/
From
SubjectRe: x86 MSRs - example program
Date
In linux.dev.kernel, article <m0w0aqh-000A8LC@cerebro>,
mlehmann@hildesheim.sgh-net.de (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: urlichs@noris.de
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="http://info.noris.de/~smurf/finger">here</A>. 42

\
 
 \ /
  Last update: 2005-03-22 13:39    [W:0.033 / U:0.588 seconds]
©2003-2020 Jasper Spaans|hosted at Digital Ocean and TransIP|Read the blog|Advertise on this site