Electrical computers and digital processing systems: support – Multiple computer communication using cryptography – Particular communication authentication technique
Reexamination Certificate
2006-07-18
2006-07-18
Moise, Emmanuel L. (Department: 2137)
Electrical computers and digital processing systems: support
Multiple computer communication using cryptography
Particular communication authentication technique
C380S030000
Reexamination Certificate
active
07080254
ABSTRACT:
The invention concerns a method whereby the proof is established by: m(≧1) pairs of private Qiand public Gi=gi2values; a public module n formed by the product of f(≧2) prime factors; an exponent v=2k(k>1), linked by the relationships of the type: Gi−Qiv≡1. mod n or Gi≡Qivmod n. Among the m numbers obtained by increasing Qior its inverse modulo n to modulo n square, k−1 times rank, at least one of them is different from ±gi. Among the 2mequations: x2≡gimod n, x2≡−gimod n, at least one of them has solutions in x in the ring of modulo n integers.
REFERENCES:
patent: 0 311 470 (1989-04-01), None
patent: 0 792 044 (1997-08-01), None
patent: WO 89/11706 (1989-11-01), None
patent: WO 96/33567 (1996-10-01), None
“Fast Decipherment Algorithm for RSA Public-Key Cryptosystem” by J. Quisquater et al.,Electronics Lettervol. 18, No. 21, XP 00057731, pp. 905-907, Oct. 14, 1982.
Guillou Louis
Quisquater Jean-Jacques
France Telecom
Koehler Steven M.
Moise Emmanuel L.
Teslovich Tamara
LandOfFree
Method, system, device for proving authenticity of an entity... does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Method, system, device for proving authenticity of an entity..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Method, system, device for proving authenticity of an entity... will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-3600714