in [Science]

File Handling in Ada -95.- Demonstartion. WITH Ada.Text_IO; PROCEDURE Batch_Encryption_Program_Mark_1 IS _____________________________________________________________________ --| A demonstration of file handling i.e. reading in from a batch file of plaintext --| _____________________________________________________________________ MaxName : Constant ... 16 Jun 2010 23:13
Need some simple bijective mappings I like to learn some simple to code bijective mappings of an n-bit word x akin to the following: a*x + b (a odd) x >>> c x ^ c x ^ (x >> 1) Thanks in advance. M. K. Shen ... 24 Jun 2010 17:29
Double encryption method I am just curious about double file encryption method. For example, we have encrypted a PE executable with some algorithm, say AES-256, then have this encrypted file repeatedly, using the same algorithm, for more protection. At runtime, encrypted executable are rapidly decompressed in memory. How safe is repeated... 17 Jun 2010 19:00
Hashing of short fixed length messages I wonder if there's a more efficient way to compute a hash when I know, that all messages are of given length, say 16 bytes. I need only (first) preimage resistance, nothing more. I'd like somebody to comment on the following possibilities: 0. Compute md5(x). AFAIK, MD5 is still secure w.r.t. the preimage, isn't... 22 Jun 2010 05:01
JSH: Why being right isn't enough People wonder how you can argue on Usenet, or in other places, endlessly over subjects like math, and you can look over my recent Usenet postings to see how, as if other people refuse to accept something because they find it distasteful or repugnant, then they can just refuse to accept it. There is no other know... 15 Jun 2010 22:02
Current state of affairs in cryptanalysis: an observation On Jun 13, 10:49 am, jmorton123 <jmorton... (a)rock.com> wrote: It seems to me that cryptography has reached such a very high level of sohphistication that it has become pretty much impossible to objectively crack a well thought out modern encryption algorithm.
Simply not true. Quite a few ciphers proposed in...
14 Jun 2010 06:15
Current state of affairs in cryptanalysis: an observation It seems to me that cryptography has reached such a very high level of sohphistication that it has become pretty much impossible to objectively crack a well thought out modern encryption algorithm. So the future of results oriented cryptanalysis is to entirely focus on any implementation or security weaknesses or... 13 Jun 2010 16:03
General factoring result for k^m = q mod N Oddly enough a fairly simple general result relates finding k, when k^m = q mod N, where m is a natural number to factoring. Given an mth residue where m is a natural number, q mod N, to be solved one can find k, where k^m = q mod N, from k = (a_1+a_2+...+a_m)^{-1} (f_1 +...+ f_m) mod N where f_1*...*f_m ... 16 Jun 2010 14:22
The Winds of Change - The Three Snake Oils of Cryptography. >Seriously minded people would surely be expected to want nothing less than totally unbreakable cryptography as the only standard worth taking on board but that is clearly not the case in this news group. Totally unbreakable cryptography comes with too much baggage and administrative problems to be usable. The... 21 Jun 2010 11:19
The Winds of Change - The Three Faces of Cryptography. Seriously minded people would surely be expected to want nothing less than totally unbreakable cryptography as the only standard worth taking on board but that is clearly not the case in this news group. This is not a criticism but the reality is that not everybody seems to want that to happen for reasons that ar... 12 Jun 2010 18:12 |