Cryptography

ISP-10 Call for papers
ISP-10 Call for papers The 2010 International Conference on Information Security and Privacy (ISP-10) (website: http://www.PromoteResearch.org) will be held during 12-14 of July 2010 in Orlando, FL, USA. ISP is an important event in the areas of information security, privacy, cryptography and related topics. ... 20 Jan 2010 05:06

ECC curve
Hello, are elliptic curves of the form y^2 = x^3+ x*a over GF(p) , p > 3, prime usable for cryptography or is it unsafe to use such a curve? Thanks, Rainer ... 21 Jan 2010 16:54

Mixet.se® - International Business Advertising
Google Translate: http://mixet.se http://translate.google.com/#sv|en|http%3A%2F%2Fmixet.se Mixet Japan http://translate.google.com/translate?hl=sv&sl=sv&tl=ja&u=http%3A%2F%2Fmixet.se%2F Mixet USA/United Kingdom http://translate.google.com/translate?hl=sv&sl=sv&tl=en&u=http%3A%2F%2Fmixet.se%2F Mixe... 18 Jan 2010 19:55

Is it a KNOWN algorithm?
Hello everybody. I'm reversing some code and found (and already reversed) a simple encryption routine. The more I reversed it the more it looked like RC4 but it's definetely NOT RC4. So here is how it works: From a 16 Bytes (128 bits) KEY, a table of 256 bytes is generated. Then the message (32 bytes) ... 18 Jan 2010 15:25

CryptoAnalysis Game 1: Crack this code;) (+hint)
Hello, I am kinda bored, so under the disguise of fun, let's see how good you people really are at CryptoAnalysis and cracking codes ;) If you don't feel like playing then you may leave so now =D If you do feel like playing then this is the game: The "codes" will become harder and harder each time. To not ... 21 Jan 2010 14:37

Basics of encrypting
Hello, I'm planning to use the Botan encryption library to make a secure chat client, but I would like some advice on what's needed to make it secure. For example, I'm planning to use RSA-1024 for key exchange and AES-256 for the actual session data encryption, but do I need to pad, sign or format the publi... 14 Jan 2010 05:46

A discrepancy in literatures on permutation polynomials
In [1] there is the following theorem: Let P(x) = a_0 + a_1 x + ... + a_d x^d be a polynomial with integer coefficients. Then P(x) is a permutation polynomial modulo n=2^w, w>=2, if and only if a_1 is odd, (a_2 +a_4 +a_6 + ...) is even, and (a_3 + a_5 + a_7 + ...) is even. In [2] there is the fol... 22 Jan 2010 05:06

Is encrypting twice much more secure?
I need to encrypt some data and give the password to an escrow attorney so that only under certain conditions (e.g. dirt nap) a list of beneficiaries will have the ability to recover this data. But I am going to make the encrypted package publicly available along with the source code of the decryption program. So I... 26 Jan 2010 10:56

A published list of rare tetragraphs?
I'm trying to devise a programmatic method to identify plaintext. One approach I'd like to try is to check candidate plaintext against tetragraphs that are extremely rare. For example, if XBMQ appears in the plaintext, then I will consider it non-English and move on to the next possible key. This method may no... 13 Jan 2010 18:54

RC4 x 2 rounds
RC4 is such a simple and fast algorithm ... ok there are a few attacks against it, but what if I encrypted the stream twice, using two unrelated keys. (Two "rounds" if you will, but with different keys obviously, as using same key in RC4 simply decrypts the original) How much additional security would this secound ... 15 Jan 2010 09:21