Cryptography

affine cipher problem
Hi, In affine cipher if the output is negative then how to get the keys like if the keys are (a,b) and if letter C is represented as 2, maps to the letter T, represented as 19, and the letter R, represented as 17 maps to Q , represented as 16 so we get 19 = a.2 + b mod 26 16 = a.17 + b mod 26 Subtracting these ... 12 Dec 2009 20:02

Self-schrinking vs von Neumann unbiasing
Hi, As far as I know, the two schemes run as follows (D=discard): 00 01 10 11 von Neumann: D 0 1 D self-shrinking: D D 0 1 Both discard one half of groups of 2 consecutive bits in a given bit stream. Are there any "inherent" scientific reasons favouri... 17 Dec 2009 20:25

How many will Kruh bamboozle today?
How many will accept his compilation of errors in his Beale cipher papers? How many will assume that he himself endorses the errant logic? These deluded fools do not matter, as the bamboozler Kruh is focused on the main objective: separating me from the value of my work. How's that noble endeavor going for you... 10 Dec 2009 11:12

Tora Tora Tora To Ya
And what better place to recognize a day of deceit and treachery than here at sci.corrupt? Lest we have forgotten the question, Smug Doug Gwyn (sci.crypt expert) has either broken the Beale Ciphers as a direct result of my findings or he has not. And why can't I get an answer? Smug Doug Gwyn has stated does not... 12 Dec 2009 05:55

monoalphabetic substitution cipher
Hi all, I am new to this cryptography world and getting interest in it. Recently I came through a software where it can decipher a monoalphabetic substitution cipher. In theory it says that: The SCBSolvr essentially does this very thing. It begins with a random KEY, which is the 26 letters of the alphabet arran... 8 Dec 2009 06:26

Request for Comment on Web Page
Could you review this web page and let me know about any mistakes I've made? http://www.sha512utilities.com/ Thanks, Datesfat ... 4 Dec 2009 16:16

Steganography via most frequently used words
Mok-Kong Shen wrote: [snip] The above is merely a sketch of a layman's idea. ....... A much more sophisticated scheme employing a specially constructed grammar to do stego is to be found in: P. Wayner, Disappearing Cryptography. Academic Press, 1996. p.91-123. M. K. Shen ... 2 Dec 2009 17:50

AES product
Mok-Kong Shen wrote: xolo wrote: Mok-Kong Shen wrote: If a special (and hence likely cheaper) handheld for AES is not available, implementing AES on palmtops shouldn't pose any problems, I suppose. Doesn't Blackberry (the latest one) support AES and Tripple DES already? I don't own one... 31 Dec 2009 09:53

SuperKISS for 32- and 64-bit RNGs in PL/I.
This 32-bit version uses the unsigned arithmetic facilities of PL/I: /*-------------------------------------------------------------*/ testKISS32: procedure options (main); /* George Marsaglia's Pseudo-Random Number Generator having a period of */ /* 5*2^1320481*(2^32-1). ... 1 Dec 2009 02:52

Q: Off-the-record communication
Hi, I found on the internet an interesting but probably not new paper "Off-the-Record Communication, or Why Not To Use PGP" by N. Borisov et al. (http://www.cypherpunks.ca/otr/otr-wpes.pdf). Had there eventually been any comments by other experts on that paper in the past that I could look up? Thanks. M. K... 28 Nov 2009 05:47