Encryption of programs represented as polynomial mappings...

Details Encryption of programs represented as polynomial mappings... Encryption of programs represented as polynomial mappings...

2007-01-09

2007-01-09

Barrón, Jr., Gilberto (Department: 2132)

Cryptography

Particular algorithmic function encoding

Public key

C380S028000, C380S044000

Reexamination Certificate

active

09737742

ABSTRACT:
Three variations of a method of representing (abstract) state machines as polynomial mappings, and three variations of a corresponding encryption program stored on a computer readable medium. The encryption program is based directly on symbolic functional composition of polynomial mappings with permutations expressed as polynomial mappings.

REFERENCES:
A.M. Turing, Proceedings of the London Mathematical Society, Series 2, vol. 42, pp. 230-237, “On Computable Numbers, With an Application to the Entscheidungsproblem”, 1936-1937.
T. Sander, et al., Mobile Agents and Security, pp. 44-60, “Protecting Mobile Agents Against Malicious Hosts”, 1996.
L. Blum, et al., 29th Annual Symposium on Foundations of Computer Science, pp. 387-397, “On a Theory of Computation Over the Real Numbers; NP Completeness, Recursive Functions and Universal Machines”, Oct. 24-26, 1988.
Created by J. Van der Spiegel, University of Pennsylvania, 3 pages, “Finite State Machine Implemented as a Synchronous Mealy Machine: a Non-Resetting Sequence Recognizer”, Dec. 30, 1997.

Affiliated with

Also associated with

Rating

Encryption of programs represented as polynomial mappings... does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Encryption of programs represented as polynomial mappings..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Encryption of programs represented as polynomial mappings... will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-3779740