hi, i am abhishek...i'm searching for someone out there who can partner with me to write paper(its better if he/she has some ideas too)...or if some faculty...
Hello, This email message is a notification to let you know that a file has been uploaded to the Files area of the indocrypt group. File : /nwc06.zip ...
indocrypt@yahoogroups...
Sep 11, 2006 6:22 pm
102
Hello, The papers presented for NWC06 held at DIAT, Pune,Sep 08-10 maybe downloaded from http://tech.groups.yahoo.com/group/indocrypt/files/ Filename:...
Dear Members of Indocrypt@yahoogroups.com, I would like to know students in this group who are doing their Ph. D./M. S. in Cryptology from Tamil Nadu. I would...
Dear Madam, Good Evening. I am E.Karthikeyan doing Ph.D. at Gandhigram University, Dindigul under the guidance of Dr. P. Balasubramanian, Head, Dept. of...
Dear Mam, I am intersted to participate in INDOCRYPT-06 regards "R. Padma" <padma@...> wrote: Dear Members of Indocrypt@yahoogroups.com, I would like to...
Hi Aryan, These are some known records for calculating the discerete log problem. For GF(p) ... April 17 2001,discrete logarithms modulo a 120 digits prime was...
Well thanks Sharad and amitab, But I am looking for possibility of some subexponential Algorithm or some randomised polynomial (great expectation) Algorithm...
Is there any (asymmetric) deterministic encryption scheme that is CCA2 secure. For instance RSA is not. -- Computer Science & Computer Engineering La Trobe...
sorry there was a mistake in my earlier email A deterministic scheme cannot be CCA secure. What I need is a determinisitic scheme that resists this attack ...
... No The attacker sends E(M1), E(M2) separately (and an operation of what he wants) ... However RSA breaks down when we also give the attacker the sum of ...
Hi, ... Yes,that is true. The point was that the attacker can compute E(M1)*E(M2), since he knows C1=E(M1), C2=E(M2) and that the homomorphism follows. ... ...
... Yes,that is true. The point was that the attacker can compute E(M1)*E(M2), since he knows C1=E(M1), C2=E(M2) and that the homomorphism follows. but he can...
Hello, ... Thank you! ... That is true, the homomorphsim only holds when m1*m2<p. If, m1*m2>p , then there is clearly a modular reduction, when you compute...
No we cannot afford to lose any bits of the result mod p, since we want to preserve the ring structure of Z_p in the ciphertexts. This the message space must...
Hi, ... If we are looking at homomorphic encryption schemes, it seems to be an open problem (preserving the ring structure of the message), from the abstract...
 Hi friends, I am Sathyanarayana, Asst.Prof. in Telecommunication Engg. dept at JNN College of Engg., Shimoga Karnataka. I am working on Elliptic Curve based...
sathya narayana sv
sathya_sv@...
Nov 30, 2006 6:34 am
124
Hello What do you exactly mean by "..working on elliptic curve based stream ciphers"? Am I right if I say you are trying to construct a pseudorandom bit stream...
WISH YOU A HAPPY PONGAL With regards E.Karthikeyan, M.Sc., M.Phil.,(Ph.D) Asst. Professor in Computer Applications, Karpagam Arts and Science College, ...
http://actualites.epfl.ch/presseinfo-com?id=441 ____________________________________________________________________________________Take the Internet to Go:...
Having problems with message search?
Fill out this form to ensure your group is one of the first to be migrated to the new message search system.
