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
finding collision for truncated SHA1 hash output
Suppose we truncate only 40 bits of sha1 hash output.hence it is insecure.how can we find two message as input which gives first 40 bits of hash as same value i.e we have to find collision for first ...
Nov 4 '12 at 17:26
newest sha1 cryptanalysis questions feed
Hot Network Questions
How secure is Java's hashCode()?
Alphanumeric Hello World
Good slide design for teaching?
How can I superimpose a summation operator with its following character?
Does a Wizard need a spellbook to cast spells, or just to prepare them?
Categorize continuous data effectively (taking into account a response variable)
Is it better to add roasted vegetables into beef stew?
How could Rabbi Shimon bar Yochai eat from the carob tree?
Meaning of the term - in the blind
Can humans eat grass?
Prove: Number of Derangement is odd if and only if number of items is even .
What is exponentiation?
Is 'my wife and I' correct English?
Windows startup manager
Sort characters by darkness
Declining offer and taking reimbursement for interview expenses?
Should I learn to use LaTex to write up a History Masters Thesis?
Why should I use a pointer rather than the object itself?
Mandelbrot image in every language
Change Color, Pitch, Line Style of Showframe (Geometry Package)
Why does apt removes unwanted packages when giving * as suffix?
What do rodents do?
Logic to test for 3 of 4
What does "You feel stupid. You feel clumsy." mean?
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