tech-userlevel archive

[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index][Old Index]

Re: algorithmic complexity attacks and libc qsort()

To: tech-userlevel%NetBSD.org@localhost
Subject: Re: algorithmic complexity attacks and libc qsort()
From: Martin Husemann <martin%duskware.de@localhost>
Date: Thu, 12 Jun 2014 13:23:21 +0200

On Thu, Jun 12, 2014 at 01:14:59PM +0200, Thomas Klausner wrote:
> Except if we want to improve it based on FreeBSD's version, that
> switched to insertion sort in some cases and improves the best case
> this way.

A "qsort" function that does some other sort? I'd call that a bug (or
benchmark cheating).

Martin

Follow-Ups:
- Re: algorithmic complexity attacks and libc qsort()
  - From: Abhinav Upadhyay

References:
- algorithmic complexity attacks and libc qsort()
  - From: Thomas Klausner

Prev by Date: algorithmic complexity attacks and libc qsort()
Next by Date: Re: algorithmic complexity attacks and libc qsort()
Previous by Thread: algorithmic complexity attacks and libc qsort()
Next by Thread: Re: algorithmic complexity attacks and libc qsort()
Indexes:

Home | Main Index | Thread Index | Old Index