]]>
]]>
Create an RSS feed from a twitter hash tag, limited to a set of users' tweets.
Tokyo Cabinet is a library of routines for managing a database. The database is a simple data file containing records, each is a pair of a key and a value. Every key and value is serial bytes with variable length. Both binary data and character string can be used as a key and a value. There is neither concept of data tables nor data types. Records are organized in hash table, B tree, or fixed-length array.
]]>
]]>
]]>
]]>
MD5 / SHA1 / SHA-256 / SHA-384 / SHA-512
I recently discovered memcached which is a distributed, object caching system originally developed by Brad Fitzpatrick of LiveJournal fame. You can think of memcached as a giant hash table that can run on multiple servers which automatically handles maintaining the balance of objects hashed to each server and transparently fetches/removes objects from over the network if they aren't on the same machine that is accessing an object in the hash table. Although this sounds fairly simple, there is a lot of grunt work in building a distributed object cache which handles data partitioning across multiple servers and hides the distributed nature of the application from the developer. memcached is a well integrated into the typical LAMP stack and is used by a surprising number of high traffic websites including Slashdot, Facebook, Digg, Flickr and Wikipedia. Below is what C# code that utilizes memcached would look like sans exception handling code
PeaZip is a free, open source file and archive manager. PeaZip is cross platform, available as portable and installable software for 32 and 64 bit Windows (9x, 2000, XP, Vista) and Linux (PeaZip is a desktop neutral application). * create: 7Z, ARC, BZ2, GZ, PAQ/LPAQ, PEA, QUAD/BALZ, TAR, UPX, ZIP; * open: ACE, ARJ, CAB, DMG, ISO, LHA, RAR, UDF and many more archive types (79 file extensions supported, see full list). PeaZip allows to save archive's layouts; apply powerful multiple search filters to archive's content; handle multiple archives at once; export job definition as command line; bookmark archives and folders etc... Other features: AES256 encryption, robust file copy, split/join files (file span), secure file deletion, compare, checksum and hash files, system benchmark, generate random passwords and keyfiles.
The Java super class java.lang.Object has two very important methods defined in it. They are - * public boolean equals(Object obj) * public int hashCode()
an interesting review of hash functions and their performance over different sets of keys. Note that he measure the actual time for hashing + scanning through a collision list rather than just counting the numbers of collisions.
]]>
SlavaSoft HashCalc : Support of 12 well-known and documented hash and checksum algorithms: MD2, MD4, MD5, SHA-1, SHA-2( 256, 384, 512), RIPEMD-160, PANAMA, TIGER, ADLER32, CRC32. HashTab is a Windows shell extension which adds a tab called “File Hashes” to the Windows Explorer file properties. The tab contains the MD5, SHA1 and CRC-32 file hashes.
Pour cela, il utilise un outil opensource (dont le source est inclus a RockXP) qui permet de recuperer les mots de passe HASH de Windows. Ppwdump2.exe est détecté par certains antivirus comme un virus. Mais il n’y a rien à craindre
Les Rainbow Tables sont des fichiers contenant des mots de passe cryptés avec l’algo hash du LanManager de Windows.En gros, plus besoin de décrypter un mot de passe avec un bruteforce (qui essaye toutes les combinaisons) pour rentrer sur un PC Windows
The main trick that history managers use is to have the browser believe the user navigated to a new url without the current page and all its JavaScript and DOM state being thrown away. The only part of the url that enables such a thing is the hash part. The hash part is what comes at the end of the url after a pound (#) sign. The original intent of this part of the url was to allow for navigation inside of the document. You would put a special named, href-less anchor tag in your document, and then navigating to #nameOfTheAnchor would just scroll the anchor into view. The page doesn't get reloaded, but it does enter the browser history.
YUI Browser History Manager does that for you, but lack of documenting how it works under the hood.
]]>
The Resource Description Framework RDF allows the users to describe Web documents and resources from the real world—people, organisations, things—in a computer-processable way. Publishing such descriptions on the Web creates the Semantic Web. URIs (Uniform Resource Identifiers) are very important, forming the link between RDF and the Web. This document presents guidelines for their effective use. It discusses two strategies, called 303 URIs and hash URIs. It gives pointers to several Web sites that use these solutions, and briefly discusses why several other proposals have problems.
The multi-platform password cracker Ophcrack is incredibly fast. How fast? It can crack the password "Fgpyyih804423" in 160 seconds. Most people would consider that password fairly secure.
Google is acting as a hash pre-image finder, and more importantly finding hashes of things that people have hashed before. Google is doing what it does best — storing large databases and searching them.
A great description of the concept/math behind the Birthday problem. Basically, if you have 23 people in a room, odds are better than 50-50 that 2 folks will share the same birthday. [With a group of 7, odds are better than 50-50 that two folks have a birthday within a week of each other.] Also the basis for the "Birthday attack" hacking vector. Given a hashing (1-way encryption) algorithm of fixed length output, multiple inputs can result in the same hash. It is very difficult to guess an alternate input that will hash into a match of a single given result. But given a large known set of results (e.g., a user account database table) it become more likely that an alternate input might result in a match of at least one existing hash. Thinking on such things keeps the mind sharp :)
Voici la liste des méthodes, propriétés et fonctions classées selon leur ordre d'apparition dans le fichier prototype.js : Toutes les méhodes n'ont pas été testées par mes soins par soucis de temps. Si vous avez donc éclairci l'utilité de certaines méthodes ou que vous avez des exemples d'utilisation, vous pouvez m'envoyer vos messages à cette adresse : contact BASE : Outils de bases variées STRING : Outils permettant de manipuler des chaines caractères ENUMERABLE : "Outils permettant de générer un code mieux adapté en créant une structure sous forme de liste ???" ARRAY : Outils permettant de manipuler des tableaux HASH : Outils permettant de manipuler une collection d'objets de type hash (couple clé/valeur ) RANGE : "Outils permettant de manipuler une gamme de valeurs, avec la plus petite et la plus grande ???" AJAX : Outils permettant d'utiliser la technologie Ajax DOM : Outils permettant de manipuler la DOM FORM : Outils permettant de manipuler les formulaires HTML EVENT : Outils permettant de manipuler les évènements et gestionnaire d'évènements POSITION : Outils permettant de travailler la position d'élément HTML
Ophcrack, or applications like LC5 use this hash to crack the password, since it's case insensitive. Seeing how this is disabled, if you run Vista and your password has 1 capital letter in it, this method won't work. You will have to buy the 8 GB DVD with