Marpex Inc. on behalf of the Franciscan University of Steubenville seeks connection to a partner, presumably an established U.S.-based commercial firm in the cybersecurity ecosystem, to champion our technology, and to license its implementation in commerce and in government. The partner should be experienced in implementing cryptography in the U.S. Federal Government per NIST SP 800-21.


Marpex Inc. is a small problem-solving research firm based in Steubenville Ohio since 1992. We believe that our patented strong encryption could play a role in the solution of three problems:

  1. balance between citizens' needs for privacy and the nation's needs for terrorist surveillance;
  2. defense against cyber attack by foreign state-sponsored intruders; and
  3. secure transmission of computer data.

In addition to arranging rights under the patent, our firm will contribute at three levels: consultation re technical documentation, mentoring of technical staff, and marketing strategies.



U.S. Patent 6,757,699 presents a method of fragmenting batches of electronic files into tiny shreds, applying multiple randomly selected algorithms to encrypt each shred, and dispersing these shreds into randomized heaps. The encryption process is guided by random intermittent moves through a collection of (public or private) random tables. During encryption, a formula is built, a file which amounts to a recipe for reconstituting the original batch of files.

The shreds are generally too tiny for meaningful patterns to emerge under intense scrutiny. The challenge to hackers is intensified further if:

The resulting formula is a file roughly two percent of the size of the encrypted batch. It warrants special treatment for transmission -- either encryption by alternative existing methods or cloaking via what we call the "Pryvit protocol". In the latter, someone eavesdropping on the transmission would need to detect which of 64 factorial patternless test results is intended, reverse out the the effects of unknown algorithms, then apply a different 64 factorial array of tests for the reconstitution file to emerge. 64 factorial (64 times 63 times 62 times ... etc. ... times 3 times 2 times 1) is in the order of ten to the power 89 -- a number which even the National Security Agency would consider large. And, of course, solving any one challenge is of precisely zero value in deciphering the next instance of the "Pryvit protocol".

When the intended receiver applies the Pryvit software to the formula, the heaps of shreds are recalled from the multiple places on the Internet to which they have been dispersed, the appropriate selection of reversing algorithms is applied to each shred, and the entire batch of original files is restored quickly with byte by byte accuracy on the recipient's computer or mobile device.


We would like to hear from you if:

Our contact person is

Colonel John Scott, Esq.
740 275-4505

We appreciate your taking the time to read this presentation.

Strong encryption

Problem 1: Balance between citizens' needs for privacy and the nation's needs for terrorist surveillance;

Problem 2: Defense against cyber attack by foreign state-sponsored intruders

Problem 3: Secure transmission of computer data