Tjerk Meesters wrote:
This problem isn't about performance, not necessarily anyway; the primary
problem that this rfc is attempting to solve is a string comparison
function with the tightest possible Theta(given-length) runtime.
But it does perhaps show the performance improvement that could be made with the correctly engineered compare?
The security problem compare is only required on a relatively small number of compares, while simple string compare is used a lot more extensively. A four or five fold improvement in speed may well result in improved performance in general, and by making that compare switch-able to always scan all a string it fulfils the security requirement as well?
--
Lester Caine - G8HFL
-----------------------------
Contact - http://lsces.co.uk/wiki/?page=contact
L.S.Caine Electronic Services - http://lsces.co.uk
EnquirySolve - http://enquirysolve.com/
Model Engineers Digital Workshop - http://medw.co.uk
Rainbow Digital Media - http://rainbowdigitalmedia.co.uk