P vs. NP Problem; 1WayFx Model a possible solution.

From: Marius Ionescu (marius_ionescu_at_1wayfx.com)
Date: 05/30/04 

Date: 30 May 2004 10:36:59 -0700

Hello,

1WayFx Model demonstrates the existence of a class of problems in
NP–P, and therefore P is strictly included in NP.

Consequently, the associated cryptosystem is an unbreakable security
solution, which solves today's major implementation issues, including
difficulty of deployment, data/message integrity, security exposure,
and performance.

Please visit my Web site for the model fundamentals, presentation and
demo at 1wayfx.com.

I would welcome an opportunity to discuss this solution with you.

Thank you for your consideration.

Best Regards,
Marius Ionescu

Relevant Pages

  • P vs. NP Problem; 1WayFx Model a possible solution.
    ... He said "strictly", genius. ... the associated cryptosystem is an unbreakable security ... The associated cryptosystem is breakable in polynomial ... of seeing on usenet critiques of papers without reading them. ...
    (comp.theory)
  • Re: P vs. NP Problem; 1WayFx Model a possible solution.
    ... > 1WayFx Model demonstrates the existence of a class of problems in NP–P, ... > difficulty of deployment, data/message integrity, security exposure, and ... The associated cryptosystem is breakable in polynomial ...
    (comp.theory)
  • Re: P vs. NP Problem; 1WayFx Model a possible solution.
    ... the associated cryptosystem is an unbreakable security ... >solution, which solves today's major implementation issues, including ... This year we have seen at least two incorrect proofs of the same theorem ...
    (comp.theory)