Aias00 commented on issue #6404: URL: https://github.com/apache/shenyu/issues/6404#issuecomment-4825050963
> java.util.regex use Backtracking NFA, so it will cause time complexity O(2^n) but re2j use Thompson NFA can't cause backtracking and guarantee O(n). > if we add timeout protection to prevent redos. first the truth is attack has happend, and event loop will be block until timeout, but re2j can't happen the redos attack. sounds good to me -- This is an automated message from the Apache Git Service. To respond to the message, please log on to GitHub and use the URL above to go to the specific comment. To unsubscribe, e-mail: [email protected] For queries about this service, please contact Infrastructure at: [email protected]
