Cryptography

Call for Papers: The 2010 International Conference on Wireless Networks (ICWN'10), USA, July 2010
It would be most appreciated if this announcement could be shared with individuals whose research interests include wireless networking, communication systems (including telecommunications) and pervasive systems. Thank you. ------- CALL FOR PAPERS ICWN'10 ... 19 Feb 2010 01:07

How good are Davis-Meyer type hash functions made from block ciphers like AES?
The the following pseudo-code for example, which is a Davis-Meyer constructed hash function from AES-128 with Merkle-Damgård length padding: byte digest[16] = { 0,0,... } byte block[16] = { 0,0,... } byte previous_digest[16] integer block_counter = 0 ; digest message for each byte b of message ... 19 Feb 2010 14:23

Call for Papers: The 2010 International Conference of Mechanical Engineering (ICME 2010)
CFP: The 2010 International Conference of Mechanical Engineering (ICME 2010) From: IAENG - International Association of Engineers http://www.iaeng.org/WCE2010/ICME2010.html Draft Paper Submission Deadline: 6 March, 2010 Camera-Ready papers & Registration Deadline: 31 March, 2010 WCE 2010: London, U.K., 30 June ... 18 Feb 2010 05:03

Subj: A 3D pattern found in Prime Number sums - using the golden ratio log!
Subj: A 3D pattern found in Prime Number sums - using the golden ratio log! I have found a pattern in prime sums by assuming Prime Numbers are volumetric and examining them using Lp, the log of the golden ratio (sqrt(5) + 1) / 2 . In golden ratio terms, length increases by P^1=1.618... , area by P^2=2.618.... 19 Feb 2010 09:51

is sha1( secret + m') possible from sha1(secret + m) where m is public
I know that sha1(secret + m) is insecure construction and it may be possible to construct sha1(secret + m + m') without knowing secret. However, is it possible to compute sha1(secret + m') without knowing secret where m' may contain some bits from m, if m is known by inverting the operations of SHA1. If this is pos... 18 Feb 2010 13:58

The National Socialist Agency Goes Green
Gone are the tiresome, ritualistic book burnings of the past. When it is determined that Smug Doug Gwyn (sci.crypt expert) has amassed a collection of stupid and revealing posts, a deletion is all that is required. Smug Doug controls the record. Smug Doug controls history. Smug Doug controls the truth. To wra... 17 Feb 2010 15:38

Request to review OWASP ESAPI crypto
The Open Web Application Security Project (OWASP) is a 501(c)(3) not-for-profit worldwide charitable organization focused on improving the security of application software and all of OWASP's materials are available under a free and open source software license. The next release candidate of OWASP's Enterprise Sec... 23 Feb 2010 00:16

Steganography with drawings
I am attempting to find some perhaps non-conventional ways of embedding numbers as stego information in drawings. I should be grateful of getting critiques/comments on the following very preliminary thought of mine and, even more desirable, of eventually learning from the group some better schemes. My humble i... 21 Mar 2010 13:51

Draft paper submission deadline is extended: ISP-10, Orlando, USA
It would be highly appreciated if you could share this announcement with your colleagues, students and individuals whose research is in information security, cryptography, privacy, and related areas. Draft paper submission deadline is extended: ISP-10, Orlando, USA The 2010 International Conference on Informati... 14 Feb 2010 16:17

Protecting 3x16 bits with 16 bits ? (crc8 + 8 bit hamming code seems perfect)
Hello, I just had a better idea, since I forgot about the address check... Since a hamming code has a certain range I might as well use the full range to "ham" more bits ! ;) :) So there are 48 "gpu data bits" and the maximum addressing range is probably "16 bits" So that creates a total of: 48 true dat... 13 Feb 2010 23:48