On Donnerstag, 26. Juni 2008, Alan McKinnon wrote:
> On Thursday 26 June 2008, Sebastian Wiesner wrote:
> > Alan McKinnon <[EMAIL PROTECTED]> at Thursday 26 June 2008,
> > 10:54:43
> >
> > > The calculation is quite simple - measure how quickly a specific
> > > computer can match keys. Divide this
* Volker Armin Hemmann ([EMAIL PROTECTED]) [27.06.08 00:12]:
> and this is why nobody uses brute force.
>
> There a better ways to crack keys. NSA has tons of experts in mathematics and
> cryptoanalysis. Plus very sophisticated hardware. I am sure for most ciphers
> they use something much more
On Fri, 27 Jun 2008 00:47:34 +0200, Sebastian Günther wrote:
> If the NSA had a sufficient algorithm, that is capable of
> reducing the time that much, they should also be able to prove P=NP.
> This is worth 1.000.000$ iirc and somehow you should get a Nobel Prize
> for it.
I'm sure the NSA wo
On Freitag, 27. Juni 2008, Sebastian Günther wrote:
> * Volker Armin Hemmann ([EMAIL PROTECTED]) [27.06.08
00:12]:
> > and this is why nobody uses brute force.
> >
> > There a better ways to crack keys. NSA has tons of experts in mathematics
> > and cryptoanalysis. Plus very sophisticated hardware
Sebastian Günther wrote:
* Volker Armin Hemmann ([EMAIL PROTECTED]) [27.06.08 00:12]:
and this is why nobody uses brute force.
There a better ways to crack keys. NSA has tons of experts in mathematics and
cryptanalysis. Plus very sophisticated hardware. I am sure for most ciphers
they use som
On Friday 27 June 2008, Volker Armin Hemmann wrote:
> > Numbers don't lie.
>
> and this is why nobody uses brute force.
>
> There a better ways to crack keys. NSA has tons of experts in
> mathematics and cryptoanalysis. Plus very sophisticated hardware. I
> am sure for most ciphers they use somethi
On Friday 27 June 2008, kashani wrote:
> > The thing about this keys is, that there is no better way than to
> > brute force such keys. The algorithm uses a function which inverse
> > is a known hard problem which resides in NP, which is a class of
> > functions equal to just guessing.
>
> I don't
On Fri, 27 Jun 2008 10:51:57 +0200, Alan McKinnon wrote:
> Neil
> mentioned GCHQ developing public key several years before RSA, but do
> note that RSA still had the same bright idea that GCHQ had, only a few
> short years later.
The important point was that they kept quiet about it. Even afte
On 27 Jun 2008, at 00:37, Neil Bothwick wrote:
On Fri, 27 Jun 2008 00:47:34 +0200, Sebastian Günther wrote:
If the NSA had a sufficient algorithm, that is capable of
reducing the time that much, they should also be able to prove P=NP.
This is worth 1.000.000$ iirc and somehow you should get a
On Fri, 27 Jun 2008 10:44:00 +0100, Stroller wrote:
> > I'm sure the NSA would be happy to forego the prize and keep quiet
> > about
> > being able to break a secure cipher.
>
> I can't help wondering if - since P=NP is such a big problem - the
> advantages of having this knowledge in the p
kashani <[EMAIL PROTECTED]> at Friday 27 June 2008, 02:28:21
> Here's a reference to the interesting meet-in-the-middle attack which
> reduced 3DES key space down to 112 bits from 192.
3DES always had an effective key size of 112 bits, because it uses the
original DES algorithm applied in the fol
On Friday 27 June 2008, Neil Bothwick wrote:
> On Fri, 27 Jun 2008 10:44:00 +0100, Stroller wrote:
> > > I'm sure the NSA would be happy to forego the prize and keep
> > > quiet about
> > > being able to break a secure cipher.
> >
> > I can't help wondering if - since P=NP is such a big problem - t
On Fri, 27 Jun 2008 11:08:04 +0100
Neil Bothwick <[EMAIL PROTECTED]> wrote:
> On Fri, 27 Jun 2008 10:44:00 +0100, Stroller wrote:
>
> > > I'm sure the NSA would be happy to forego the prize and keep
> > > quiet about
> > > being able to break a secure cipher.
> >
> > I can't help wondering if
-BEGIN PGP SIGNED MESSAGE-
Hash: SHA512
Alan McKinnon wrote:
| On Friday 27 June 2008, Neil Bothwick wrote:
|> On Fri, 27 Jun 2008 10:44:00 +0100, Stroller wrote:
|>>> I'm sure the NSA would be happy to forego the prize and keep
|>>> quiet about
|>>> being able to break a secure cipher.
|
Hi All,
I would like to ask some help. I would like to emerge Unity to my
system and nautilus is part of it, but the emerge fails with this
error message:
libtool: compile: x86_64-pc-linux-gnu-gcc -DHAVE_CONFIG_H -I. -I..
-DG_LOG_DOMAIN=\"Eel\" -I.. -I.. -pthread -I/usr/include/gtk-3.0
-I/usr/in
15 matches
Mail list logo
