Implement Aho-Corasick algorithm #227
Open
+499
−142
Conversation
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
Add this suggestion to a batch that can be applied as a single commit.
This suggestion is invalid because no changes were made to the code.
Suggestions cannot be applied while the pull request is closed.
Suggestions cannot be applied while viewing a subset of changes.
Only one suggestion per line can be applied in a batch.
Add this suggestion to a batch that can be applied as a single commit.
Applying suggestions on deleted lines is not supported.
You must change the existing code in this line in order to create a valid suggestion.
Outdated suggestions cannot be applied.
This suggestion has been applied or marked resolved.
Suggestions cannot be applied from pending reviews.
Suggestions cannot be applied on multi-line comments.
Suggestions cannot be applied while the pull request is queued to merge.
Suggestion cannot be applied right now. Please check back later.
This algorithm will be a successor of z-function in
--sni-detection=brute.Also it may speedup domain name matching in
--sni-detection=parseAn idea behind this algorithm is usability of bruteforce mode for TLSv1.3 kyber. Before this PR it was implemented as z-function iterating over string n times, where n is amount of matching domains. This was leading to degraded performance, especially without connbytes. Aho-Corasick allows this to go in linear time. Time complexity improvements were requested in #220 and #213.