W3C home > Mailing lists > Public > ietf-http-wg@w3.org > October to December 2013

Re: Some entropy calculations with secret/huffman interaction

From: Roberto Peon <grmocg@gmail.com>
Date: Wed, 27 Nov 2013 11:20:39 -0800
Message-ID: <CAP+FsNfV+k9gJCiajCwYSrzjxQNRx4q37WAQMcRBkUUVex7u+A@mail.gmail.com>
To: Ilari Liusvaara <ilari.liusvaara@elisanet.fi>
Cc: Martin Thomson <martin.thomson@gmail.com>, HTTP Working Group <ietf-http-wg@w3.org>
The paper I linked to some time ago has one analysis of this.
-=R


On Wed, Nov 27, 2013 at 11:00 AM, Ilari Liusvaara <
ilari.liusvaara@elisanet.fi> wrote:

> On Wed, Nov 27, 2013 at 09:08:04AM -0800, Martin Thomson wrote:
> > On 27 November 2013 02:40, Ilari Liusvaara <ilari.liusvaara@elisanet.fi>
> wrote:
> > > The secret
> >
> > Have we worked out yet how to determine if something is secret or not
> > algorithmically?
>
> No, I just wanted to calculate how bad the entropy loss is.
>
> Also, doing Huffman on anything that looks like base64 probably isn't a
> good
> idea.
>
> Hexadecimal stuff (escpecially with lowercase a-f) does compress
> (average ~30%; Hmm... I wonder how badly those leak...).
>
> -Ilari
>
>
Received on Wednesday, 27 November 2013 19:21:06 UTC

This archive was generated by hypermail 2.3.1 : Tuesday, 1 March 2016 11:11:20 UTC