::::::::::::::::::::::::::
Home
Home Page
Method of generation of a code
Displays
Result of binding of the data
Systems of patterns of pages
Data acquisition without use XML
Data acquisition without use XML
Use JSON on the party of the client
Improved online shop
Review Ajax
Departure XMLHttpRequest
Processing of search servleta
The search processing with help JavaScript
Problems of use Ajax
As it was more than once spoken, organization W3C is engaged mainly in development and creation of b
OASIS
Hands off PHP!
Automatic redirect (Auto Redirect) on PHP
Breaking of passwords becomes more accessible
Web2.0 Layout
Links
:::::::::::::::::::::::::

topic
 

Breaking of passwords becomes more accessible

The basic component of the majority of systems of authorization is so-called khehsh-function (hash functions).

Though mathematics also have proved theoretical impossibility to guess the password, on value of khehsh-function, but attack by a method consecutive perebora the password all the same remains in force.


At the moment of creation of these functions as mathematical objects, on their calculations rather big time, from pair milliseconds about one second was spent, that considerably interfered with technics{technical equipment} consecutive perebora.


But in connection with occurrence of new computer technics{technical equipment} and the specialized software, began possible{probable} to touch about 25 million passwords a second (for MD5 for example), that allows to restore any seven-symbolical password for a pair of minutes.


And it does not demand the supermodern equipment, all components can be got in usual computer shop. As authors of program UDC inform, all for 1000 dollars it is possible to collect ” a domestic cluster “ from the standard workstations, allowing to touch billion passwords for 40 seconds.


Developers of systems of protection declare, that in the near future they will raise reliability of methods of authorization, however, by the current moment safety remains under threat of.