to customize your list.
more stack exchange communities
Start here for a quick overview of the site
Detailed answers to any questions you might have
Discuss the workings and policies of this site
Counter mode secure hash algorithm
Ever since the SHA-3 competition, I've been wondering if it is possible to create a hash algorithm that is easier to parallelize. The current algorithms all seem to require building a tree of hashes. ...
Jan 2 '12 at 16:10
newest algorithm-design collision-resistance questions feed
Hot Network Questions
Program to fully tag any song automatically
Update vs. FixedUpdate in Unity
How can I reduce voltage from 40VDC to 5VDC?
Is my PageRank improved when someone else uses my images?
Counting characters in a text file
SED : Case Match Pattern Replacement
Why aren't logarithms introduced earlier?
install application/http services to "/srv"?
Dynamic Apex Question
Does `sl` ever show the current directory?
Choosing a diffraction grating
Make a directory for each row within the given text file?
Can Python 2 be safely removed from Ubuntu 14.04?
What makes it illegal to use the information learned by exploiting a bug?
Let q be an odd integer such that p = 4q+1 is prime.
Why don't I have to install programs?
Is testing easier/harder than learning?
Insert some simple path in LaTeX document
QED - as three letters - to the right of a display equation
A fascinating number chain.
Why did Microsoft choose the word "Recycle Bin"?
Just found out my 13 year old girl is Bi and dating a 17 year old girl in an "open" relationship. Huh? Now what?
Thrust vectoring on commercial jets
What is the largest ship in the Star Trek Universe?
more hot questions
Life / Arts
Culture / Recreation
TeX - LaTeX
Unix & Linux
Ask Different (Apple)
Geographic Information Systems
Science Fiction & Fantasy
Seasoned Advice (cooking)
Personal Finance & Money
English Language & Usage
Mi Yodeya (Judaism)
Cross Validated (stats)
Theoretical Computer Science
Meta Stack Exchange
Stack Overflow Careers
site design / logo © 2014 stack exchange inc; user contributions licensed under
cc by-sa 3.0