-BEGIN PGP SIGNED MESSAGE-
Hash: SHA1
On Fri, 4 Mar 2005, Jason Thorpe wrote:
> On Mar 2, 2005, at 4:33 PM, ALeine wrote:
>
>> You need 2^128 steps to break the encryption of a single sector.
>> But you have no idea which of the 2^128 sectors is the right one,
Your disk has 2^128 sectors
On Mar 2, 2005, at 4:33 PM, ALeine wrote:
You need 2^128 steps to break the encryption of a single sector.
But you have no idea which of the 2^128 sectors is the right one,
You may not know "for sure", but you can make a pretty well educated
guess. You are basically ignoring Roland's argument tha
"Poul-Henning Kamp" <[EMAIL PROTECTED]> writes:
> In message <[EMAIL PROTECTED]>, "Perry E. Metzger" writes:
>>The best I can say, however, is that the US
>>government has approved the use of AES with 256 bit keys for very
>>highly secure communications, and they have a very demanding user
>>commu
On Friday 04 March 2005 02:29, ALeine wrote:
> > To wit:
> >
> > On Thursday 03 March 2005 02:43, ALeine wrote:
> > > At any time half of all the people are wrong about something,
> > > it's only a matter of time when your time will come to be in the
> > > wrong half or rather the right half to be
On Friday 04 March 2005 03:17, ALeine wrote:
> Your assumption is wrong. First of all, the first sector of the
> encrypted image does not necessarily start at the beginning of
> the disk, nor does the last sector have to be the last sector
> of the disk. At initialization first_sector, last_sector
CALL FOR CONTRIBUTIONS
Libre Software Meeting 2005
---
Operating system design and implementation
The Libre Software Meeting (LSM) has been one of the most important
Free Software events in France since the year 2000 [0]. This year,
the meeting will take place f
Greg 'groggy' Lehey <[EMAIL PROTECTED]> writes:
> Some values can be specified like this:
>
> hw.physmem="1G"# Limit physical memory. See loader(8)
>
> That doesn't seem to work for MAXDSIZ.
I have a patch for this which will go in as soon as I'm done testing
it.
DES
--
Dag-Erl
[EMAIL PROTECTED] wrote:
> There are at least two ways to determine this information fairly easily:
As easily as one can get accepted into the crypto community? :->
> 1) If you're doing analysis of a cold disk, it is ~trivial to tell
> the difference between a sector that has been written only o
On Fri, Mar 04, 2005 at 09:45:56PM +0530, Andriy Tkachuk wrote:
> Hi folks.
>
> I wander how O(1) sheduling works in ULE.
> In ule.pdf Jeff wrote:
>
> Threads are picked from the current queue in
> priority order until the current queue is empty.
>
> As far as I understand the algorithm is O(n)
Someone from the NetBSD community who wishes to remain unnamed sent
me the following email, so I thought I would comment on it here because
there seem to be many others who are confused about the same issue.
> My thinking is that for each of 2^30 sectors, you're looking for
> one of 2^128 keys.
[EMAIL PROTECTED] wrote:
> >For example, one can regularly scrub the unused areas around the
> >encrypted image (padding) with dd(1) using if=/dev/{u,}random and
> >similar. This can be fully automated with a cron job.
> >
> >One can also regularly scatter files with misleading names and
> > conte
11 matches
Mail list logo
