Cryptography

Situation just became serious
"JSH" <jstevh(a)gmail.com> wrote in message news:57f00266-ebf4-49c6-a844-e16151aa6eb0(a)z15g2000prn.googlegroups.com... My concern has been that fundamental equations in modular arithmetic could be exploited rather quickly and it appears with my latest efforts that that concern may be correct. With the a... 2 Jul 2010 10:11

JSH: Situation just became serious
My concern has been that fundamental equations in modular arithmetic could be exploited rather quickly and it appears with my latest efforts that that concern may be correct. With the approach to discrete logarithms I've found it appears you CAN optimize the approach, and even though that involves looking for fa... 7 Jul 2010 16:46

Applied Computing 2010 (2nd call): submissions until 26 July 2010
Apologies for cross-postings. Please send to interested colleagues and students -- CALL FOR PAPERS - Deadline for submissions (2nd call): 26 July 2010 -- IADIS INTERNATIONAL CONFERENCE APPLIED COMPUTING 2010 October 14 - 16, 2010 – TIMISOARA, ROMANIA (http://www.computing-conf.org/) * Conference backgro... 1 Jul 2010 12:13

Ioncube php5 decoder
does it possible to decode Ioncube php5 encoded php files? If you folks are cryptography experts and mathematics, there will be no problems for you, just a little limbering up for you guys.. Or even someone already wrote Ioncube php5 decoder tool. Regards, ... 3 Jul 2010 06:55

Discrete logs result, sum of the factors upper bound?
I've noted a way to solve discrete logarithms through factoring: q^2 mod N where with f_1*...*f_m = q^2 mod N you can find m simply enough from: (k-1)*m = (f_1+...+f_c - c) mod N where c is the count of factors in your factorization of q^2 mod N, where prior posts explain from where the equations der... 30 Jun 2010 20:55

Discrete logs result and degrees of freedom
I've noted a way to solve for m, when k^m = q mod N, through integer factorization, which is then an approach to solving discrete logarithms in a prior post. In this post I'll explain when the equations MUST work, where a simple analysis can be done trivially using methods familiar to those who've solved simultane... 3 Jul 2010 16:47

JSH: Solving discrete logarithms
On 06/30/10 14:52, JSH wrote: However, I'm also MORE likely to get replies on sci.math than on sci.crypt, and I'd like feedback, so the simple solution was to post the same thing on both newsgroups. The sci.math regulars who like to stalk my postings can post happily there and not feel a need to post he... 30 Jun 2010 10:53

JSH: World of insecurity?
When back in 2004 I realized that my research showing a conflict between algebraic integers and the field of complex numbers would not be accepted by mathematicians who would rather be in error, I decided I needed to find something that could not just be ignored, and I thought the factoring problem was that thing. ... 30 Jun 2010 19:49

JSH: So why do they lie?
Looks like I might have solved the discrete log problem, as well as just generally handled k^m = q mod N, using some simple congruence relations--not a big deal if you know my other mathematical results. But I've talked about those other results for YEARS and been ignored by mainstream mathematicians while getting ... 30 Jun 2010 00:00

Solving discrete logarithms
I've noted a fundamental result in modular arithmetic around studying the simple system of equations: f_1 = a_1*k mod N thru f_m = a_m*k mod N Specifically by noting that multiplying them together gives: f_1*...*f_m = a_1*...*a_m*k^m mod N, but ADDING them together gives: f_1+...+f_m = (a_1 + ...+ a_m)k mo... 30 Jun 2010 10:53