Description:
Different methods of data en/decryption.
|
|
|
question about DigestInfo as defined in PKCS#1 v2.1
|
| |
From RFC3447#page-52: The EMSA-PKCS1-v1_5 encoding method includes an ASN.1 value of type DigestInfo, where the type DigestInfo has the syntax DigestInfo ::= SEQUENCE { digestAlgorithm DigestAlgorithm, digest OCTET STRING } digestAlgorithm identifies the hash function and shall be an... more »
|
|
|
ECCOMAS CFD 2010 Mini-Symposium on Image Processing and Visualization
|
| |
------------------------------ ------------------------------ ------------------------------ ------------------------------ ----------------- (Apologies for cross-posting) Mini-Symposium on Image Processing and Visualization ECCOMAS CFD 2010 - Fifth European Conference on Computational Fluid Dynamics June 14th -17th, 2010, Lisbon, Portugal... more »
|
|
|
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. ([link]). Had there eventually been any comments by other experts on that paper in the past that I could look up? Thanks.... more »
|
|
|
SuperKISS for 32- and 64-bit RNGs in both C and Fortran.
|
| |
On Nov 3 I posted RNGs: A Super KISS sci.math, comp.lang.c, sci.crypt a KISS (Keep-It-Simple-Stupid) RNG combining, by addition mod 2^32, three simple RNGs: CMWC(Complementary-Multiply-Wi th-Carry)+CNG(Congruential) +XS(Xorshift) with resulting period greater than 10^402575. The extreme period comes from finding a prime p=a*b^r+1 for... more »
|
|
|
CFP DATA MINING 2010: submissions until 19 February 2010
|
| |
Apologies for cross-postings. Please send to interested colleagues and students -- CALL FOR PAPERS - Deadline for submissions: 19 February 2010 -- IADIS EUROPEAN CONFERENCE ON DATA MINING 2010 Freiburg, Germany, 28 – 30 July 2010 ([link]) part of the IADIS Multi Conference on Computer Science and Information... more »
|
|
|
"Random flood" crypto
|
| |
Hi. I read this, it looks pretty old given the date though, but I was curious about the idea as it seemed kind of weird: [link] which suggests a type of "cryptography" that involves transmitting a huge "flood" of random data, such that only a tiny part is relevant to... more »
|
|
|
JSH: Generalizing quadratic residues solution idea
|
| |
Earlier today I was pondering this weirdly simple idea for solving for quadratic residues I have and realized I should look at the generalization, so I wrote down: f_1 = ak mod p, and f_2 = bk mod p, and quickly realized I had: k = (a+b)^{-1}(f_1 + f_2) mod p with T = f_1*f_2 = abk^2 = abq mod p to solve for k, when k^2 = q mod p.... more »
|
|
|
Unique factor key and quadratic residues
|
| |
Quadratic residues and factoring are intimately related using some basic congruences. And there is a uniqueness property with residues which appears to have been missed by practitioners in various math disciplines that consider factoring. This unique key is critical in determining quadratic residues by using... more »
|
|
|
|
