A RetroSearch Logo

Home - News ( United States | United Kingdom | Italy | Germany ) - Football scores

Search Query:

Showing content from https://mail.python.org/pipermail/python-dev/2003-May/035914.html below:

[Python-Dev] Algoritmic Complexity Attack on Python

[Python-Dev] Algoritmic Complexity Attack on PythonRaymond Hettinger python@rcn.com
Sat, 31 May 2003 14:34:13 -0400
> > On Fri, May 30, 2003 at 08:41:54PM -0400, Guido van Rossum wrote:
> > > Of course, such programs are already vulnerable to changes in the hash
> > > implementation between Python versions (which has happened before).
> > 
> > Is there at least a guarantee that the hashing algorithm won't change in a
> > bugfix release?  For instance, can I depend that
> > python222 -c 'print hash(1), hash("a")'
> > python223 -c 'print hash(1), hash("a")'
> > will both output the same thing, even if
> > python23 -c 'print hash(1), hash("a")'
> > and
> > python3000 -c 'print hash(1), hash("a")'
> > may print something different?
> 
> That's a reasonable assumption, yes.  We realize that changing the
> hash algorithm is a feature change, even if it is a very subtle one.

For Scott's proposal to work, it would have to change the hash
value on every invocation of Python.  If not, colliding keys can
be found with a Monte Carlo method.

Raymond Hettinger




RetroSearch is an open source project built by @garambo | Open a GitHub Issue

Search and Browse the WWW like it's 1997 | Search results from DuckDuckGo

HTML: 3.2 | Encoding: UTF-8 | Version: 0.7.4