3 ms·
Interesting, would help with [1] ReDOS attacks? It would seem that fuzzy matching could put a upper limit on execution time right? [1] https://en.m.wikipedia.o
by gitgud 8y ago
Interesting, would help with [1] ReDOS attacks? It would seem that fuzzy matching could put a upper limit on execution time right?
[1] https://en.m.wikipedia.org/wiki/ReDoS https://en.m.wikipedia.org/wiki/ReDoS
- onlydnaq 8y agoI believe the correct way to protect against ReDOS is to use one of the many regular expression implementations that do not have exponential worst cases. Nowadays there are good DFA or Tree based matching algorithms that are O(mn) where m is the length of the regular expression and n is the length of the input.
- jey 8y agoNo, seems like it would result in a much bigger state machine that includes states and transitions for all those non-exact matches. https://en.wikipedia.org/wiki/Finite-state_machine#Acceptors_(recognizers) https://en.wikipedia.org/wiki/Finite-state_machine#Acceptors...