Home
hash-identifier - Hash Identifier - Google Project Hosting
saved on 2012-01-31 18:14:19
Software to identify the different types of hashes used to encrypt data and especially passwords.
cityhash - The CityHash family of hash functions - Google Project Hosting
saved on 2012-01-31 17:50:07
CityHash provides hash functions for strings. The latest stable version is cityhash-1.0.3.tar.gz. Differences between versions are explained in the NEWS file. The functions mix the input bits thoroughly but are not suitable for cryptography. We provide reference implementations in C++, with a friendly MIT license. The code's portable; let us know if you encounter problems. To download the code use the .tar.gz file or use svn with these instructions. The README contains a good explanation of the various CityHash functions. However, here is a short summary: CityHash64() and similar return a 64-bit hash. Inside Google, where CityHash was developed starting in 2010, we use variants of CityHash64() mainly in hash tables such as hash_map<string, int>. CityHash128() and similar return a 128-bit hash and are tuned for strings of at least a few hundred bytes. Depending on your compiler and hardware, it may be faster than CityHash64() on sufficiently long strings. It is known to be slower than necessary on shorter strings, but we expect that case to be relatively unimportant. Inside Google we use variants of CityHash128() mainly for code that wants to minimize collisions. CityHashCrc128() and CityHashCrc256() and similar are additional variants, specially tuned for CPUs with SSE4.2.
SpookyHash: a 128-bit noncryptographic hash
saved on 2012-01-31 17:49:34
SpookyHash is a public domain noncryptographic hash function producing well-distributed 128-bit hash values for byte arrays of any length. It can produce 64-bit and 32-bit hash values too, at the same speed, just use the bottom n bits. The C++ reference implementation is specific to 64-bit x86 platforms, in particular it assumes the processor is little endian. Long keys hash in 3 bytes per cycle, short keys take about 1 byte per cycle, and there is a 30 cycle startup cost. Keys can be supplied in fragments. The function allows a 128-bit seed. It's named SpookyHash because it was released on Halloween.
magnusvw/hollywoodr - GitHub
saved on 2012-01-31 17:45:27
The script will check if the user viewing the page is using an IP address that is suspected to be owned or used by RIAA, MPAA or such. This calls a service on another server because Javascript has no way of determining a users IP. This service stores no information about the caller. You can test the script by adding #iamabastard to the URL of the page where it is included.
Backbone.js
saved on 2012-01-31 17:43:12
Backbone.js gives structure to your serious JavaScript web applications by supplying models with key-value binding and custom events, collections with a rich API of enumerable functions, views with declarative event handling, and connects it all to your existing API over a RESTful JSON interface.
Measurement Science for Complex Information Systems
saved on 2012-01-18 17:02:52
This project aims to develop and evaluate a coherent set of methods to understand behavior in complex information systems, such as the Internet, computational grids and computing clouds. Such large distributed systems exhibit global behavior arising from independent decisions made by many simultaneous actors, which adapt their behavior based on local measurements of system state. Actor adaptations shift the global system state, influencing subsequent measurements, leading to further adaptations. This continuous cycle of measurement and adaptation drives a time-varying global behavior. For this reason, proposed changes in actor decision algorithms must be examined at large spatiotemporal scale in order to predict system behavior. This presents a challenging problem.
NIST Randomness Beacon
saved on 2012-01-18 17:01:19
NIST is implementing a proof-of-concept prototype of a trusted public source of randomness, conformant to Sp 800-90. The source is designed to provide unpredictability, autonomy, and consistency. Unpredictability means that users cannot algorithmically predict bits before they are made available by the source. Autonomy means that the source is resistant to attempts by outside parties to alter the distribution of the random bits. Consistency means that a set of users can access the source in such a way that they are confident that they all receive the same random string. The theoretical community has developed many clever cryptographic security protocols over the years for access, authentication, privacy, and authorization in networking and e-commerce applications. However, except for the simplest and most basic protocols, few have been widely deployed. A major reason concerns efficiency. Many of the more sophisticated security protocols, such as Zero Knowledge proof systems, are highly interactive and require too many communication rounds to be feasible in most situations. Other privacy-preserving protocols eliminate the need for many rounds of communication but assume the availability of a trusted source of randomness, an assumption that is not generally valid at present.
High Performance Enabled SSH/SCP [PSC]
saved on 2012-01-11 18:22:53
SCP and the underlying SSH2 protocol implementation in OpenSSH is network performance limited by statically defined internal flow control buffers. These buffers often end up acting as a bottleneck for network throughput of SCP, especially on long and high bandwith network links. Modifying the ssh code to allow the buffers to be defined at run time eliminates this bottleneck. We have created a patch that will remove the bottlenecks in OpenSSH and is fully interoperable with other servers and clients. In addition HPN clients will be able to download faster from non HPN servers, and HPN servers will be able to receive uploads faster from non HPN clients. However, the host receiving the data must have a properly tuned TCP/IP stack. Please refer to this tuning page for more information.
Roger and Mike's Hypernet Blog • Technology Waves and Valuations: Are We in a Social Networking Bubble? • Technology Waves and Valuations: Are We in a Social Networking Bubble?
saved on 2012-01-10 15:40:50
In what felt like a less exciting turn of events, an aspiring lawyer friend of mine talked me into taking an Intro class on Logic. I didn’t expect to like it very much, but since I was suspicious of lawyers for the most part, I thought it would be good to learn a few things about how they practiced their craft. I was really surprised at how cool it was. One of the topics that fascinated me was how people use logical and rhetorical fallacies to win an argument. My favorite example was the “false dilemma” which is also called the “either-or fallacy.” After that class, I learned to always be on the lookout for the various rhetorical weapons used by people to advance their agendas.
Introducing “Python for Android” « Txzone
saved on 2012-01-10 15:21:45
Pro: A blacklist.txt file that can be used to exclude files in the final APK Reusable distribution for other applications Modular recipes architecture Be able to build independents python distributions Cons: You need a main.py file that will be used for starting your application Only one java bootstrap available, using OpenGL ES 2.0. Only Kivy toolkit is working. I'm sure that other people can enhance it to add other toolkit recipes. But for example, pygame is not gonna to work because the android project is OpenGL ES 2.0: pygame drawing will not work.
Popular Tags
- programming
- security
- python
- development
- javascript
- openid
- design
- PHP
- database
- WebDesign
- software
- performance
- framework
- Erlang
- reference
- Haskell
- identity
- password
- privacy
- Usability
- business
- philosophy
- Web
- network
- language
- architecture
- algorithm
- c
- library
- mathematics
- management
- authentication
- functional
- opensource
- tools
- cryptography
- encryption
- AJAX
- algorithms
- Internet
- testing
- css
- math
- blog
- code
- History
- server
- api
- java