Liked the idea, implementation might be rather difficult and might have many errors. I would recommend "calibrating" the new comparative precomputation algorithm and then extract 10 bytes -or some other number- using both algorithms (old and precomp). If they are the same, continue using precomp else fallback to the old/stable algorithm
On Tue, Feb 19, 2013 at 10:10 PM, Julius Kivimäki <julius.kivim...@gmail.com> wrote: > Should probably look into adding this, > http://www.blackhatlibrary.net/SQL_injection/Blind/Comparative_precomputation > ------------------------------------------------------------------------------ > Everyone hates slow websites. So do we. > Make your web apps faster with AppDynamics > Download AppDynamics Lite for free today: > http://p.sf.net/sfu/appdyn_d2d_feb > _______________________________________________ > sqlmap-users mailing list > sqlmap-users@lists.sourceforge.net > https://lists.sourceforge.net/lists/listinfo/sqlmap-users > -- Andrés Riancho Project Leader at w3af - http://w3af.org/ Web Application Attack and Audit Framework Twitter: @w3af GPG: 0x93C344F3 ------------------------------------------------------------------------------ Everyone hates slow websites. So do we. Make your web apps faster with AppDynamics Download AppDynamics Lite for free today: http://p.sf.net/sfu/appdyn_d2d_feb _______________________________________________ sqlmap-users mailing list sqlmap-users@lists.sourceforge.net https://lists.sourceforge.net/lists/listinfo/sqlmap-users
