First  |  Prev |  Next  |  Last
Pages: 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34
TrueCrypt broken
http://www.storagenewsletter.com/news/security/passware-kit-forensic Any idea how this works? ... 14 Apr 2010 21:10
The key to cracking any cipher: Elephant.
The key to cracking any cipher is elephant. Simply look for consistent variable repetition following the form of the word elephant. There are very few words in language that repeat letters in the pattern of the word elephant. ELEPHANT 12134567 ANARCHY ERELATER ... 20 Apr 2010 16:16
What do you think of this Blowfish implementation?
It's called MySecret and it's easier for me to use than GnuPG. I typically use only symmetric encryption anyway so GPG is overkill. But before I do any major encryption with it I would like to get the opinion of some experts. Thanks. http://www.di-mgt.com.au/mysecret.html ... 8 Apr 2010 11:02
Gollin Lied, Babies Died
All Dr. Jerroll Dolphin wanted was to bring doctors and medical care to the poor, sick and dying of Liberia, an African country in the throes of violent chaos and civil war. Against all odds he nearly succeeded, opening St. Luke School of Medicine, obtaining government accreditation, and even graduating medical do... 7 Apr 2010 03:30
Difficulty of Matching an SHA-512 Hash By Brute Force SecureRandom sr = SecureRandom.getInstance("SHA1PRNG");
gh=ht= http://meami.org/ [instruct]: SecureRandom sr = SecureRandom.getInstance("SHA1PRNG"); MessageDigest md = MessageDigest.getInstance("SHA-512"); byte[] bytesToHash = newbyte[128]; byte[] salt = newbyte[16]; sr.nextBytes(bytesToHash); sr.nextBytes(salt); md.update(salt); byte[] finalBytes = md.digest(b... 7 Apr 2010 01:21
Difficulty of Matching an SHA-512 Hash By Brute Force
Assume that I have an SHA-512 hash of a file (512 bits). Assume that I want to find a second file with the same hash and can't attack the hash function (i.e. I can only repeatedly try new files). This is harder than a birthday attack, right? The mathematics of a birthday attack http://en.wikipedia.org/wik... 18 Apr 2010 11:57
Computer Bunker
Open Source Crypto Processor Project Could be Developed by Volunteers Rev. 0 Proposal for a Computerbunker A gate array vendor will be chosen to provide one logic chip. It will be used to implement the microprocessor with variable instruction sets which can be defined according to a key. The 256 bit instructi... 12 Apr 2010 13:40
Collecting true randomness/entropy from decimal part of the values calculated in stock exchange market
Follow MKS, I sugest another source of true randomness/entropy. Decimal part of the values calculated in stock exchange markets ... 6 Apr 2010 09:40
Call for participants
Check out NFS(a)Home; help them push towards larger numbers. http://escatter11.fullerton.edu/nfs/ ... 7 Apr 2010 03:30
Permutation Extrapolation Function (PXF) (you might find theend of the post useful)
On 5/04/2010 6:50 PM, WTShaw wrote: On Apr 4, 11:17 am, David Eather<eat...(a)tpg.com.au> wrote: .. It very clever and all. Now if only you could get around the fact that in properly implemented cryptography it is useless and pointless and you can't see that. Problem: Make a pad of 2600 Chara... 14 Apr 2010 13:19
First  |  Prev |  Next  |  Last
Pages: 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34