File:Regular expression complexity exploit.svg

From mediawiki.org

Original file(SVG file, nominally 1,074 × 680 pixels, file size: 125 KB)

Summary

Description The graph above demonstrates the execution time of re = /(A+)+B/; re.test("AAAAAAA...AAAAAAAAAAAAAC"). This is intended as an illustration of why any user-specified untrusted regex should be time-limited.
Source Own work
Author VasilievVV

Licensing

I, the copyright holder of this work, hereby publish it under the following license:
w:en:Creative Commons
attribution
This file is licensed under the Creative Commons Attribution 3.0 Unported license.
You are free:
  • to share – to copy, distribute and transmit the work
  • to remix – to adapt the work
Under the following conditions:
  • attribution – You must give appropriate credit, provide a link to the license, and indicate if changes were made. You may do so in any reasonable manner, but not in any way that suggests the licensor endorses you or your use.

Captions

Add a one-line explanation of what this file represents

Items portrayed in this file

depicts

File history

Click on a date/time to view the file as it appeared at that time.

Date/TimeThumbnailDimensionsUserComment
current09:32, 5 February 2012Thumbnail for version as of 09:32, 5 February 20121,074 × 680 (125 KB)VasilievVVThe graph above demonstrates the execution time of <code>re = /(A+)+B/; re.test("AAAAAAA...AAAAAAAAAAAAAC")</code>. This is intended as an illustration of why any user-specified untrusted regex should be time-limited. {{self|CC-BY}}

There are no pages that use this file.

Metadata