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
Hash collision resistance requirements for Lamport signatures
According to the original paper, Lamport one-time signature scheme uses two one-way functions: $F$ and $G$. The former one, $F$, is used to create a public key by hashing elements of the private key ...
Oct 7 '12 at 13:39
newest collision-resistance hash-signature questions feed
Hot Network Questions
Could one obtain an object to destroy a Horcrux in the Room of Requirements?
Is there software which can serve as a virtual DM?
Jacobson radical and group rings/subalgebras
Should I learn to use LaTex to write up a History Masters Thesis?
What does this command mean?
Why should I take showers?
How can we move an object with zero velocity?
How to teach a toddler to identify colors correctly?
Avoiding the Hermann grid illusion
matrix with Eigenvalue 1,2,3
The Floating Horde
What? No error?
What is the "sticky bit" (t permission) and why does /tmp have it?
How to respond to "Why shouldn't we hire you?"
To get the particular user's ID
What really happened to sound design?
What type of solver does Mathematica use in LinearSolve
Why do graphic designers / illustrators start with a large painted area?
New players missing the big picture?
Are the following IF statements acceptable?
How combine different geometry types into the same feature class
'100' is a magic number
How did Boba Fett know to hide in the Star Destroyer "Avenger"'s garbage?
CSS z-index paradox flower
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 Overflow
Stack Overflow Careers
site design / logo © 2014 stack exchange inc; user contributions licensed under
cc by-sa 3.0