Return Home Franciscan University of Steubenville Pryvit

 

 Patent > Allowed Claims > Claims 47 to 51

Claim 47. The apparatus of claim 46, wherein said means for writing data from one of said plurality of original data files to its corresponding original data storage structure is performed in sequential order from end to beginning of said original data file.

Claim 48. The apparatus of claim 46, wherein said means for writing said disguised one of said fragments to said fragment storage structure so as to intersperse said disguised one of said fragments with other fragments stored therein comprises:

  • means for reading and writing each of said fragments from one of said original file data structures to one of a plurality of fragment data storage structures, resulting in interspersed fragments, said original file data structure being randomly selected;
  • means for reading and writing said interspersed fragments to said composite files.

Claim 49. The apparatus of claim 48, wherein each of said original data storage structures comprises an end and each of said fragment data storage structures comprises an end, wherein each of said fragments is drawn from said end of said randomly selected original data storage structure, and each of said fragments is read successively into said end of one of said fragment data storage structures in round robin order.

Claim 50. The apparatus of claim 39, wherein said means for disguising said one of said fragments is performed through an exclusive OR operation, said one of said fragments having a fragment length and a starting point in a random table, said fragment length and said starting point designated by said fragment handling guide.

Claim 51. An apparatus, comprising:

  • means for opening a plurality of original data files, each of said original data files being a binary stream;
  • means for fragmenting said plurality of original data files into fragments;
  • means for creating at least two composite files by interspersing said fragments;
  • means for creating a reconstitution file having a reconstitution plan; and
  • means for dispersing said at least two composite files to at least two different locations,
  • wherein creating a reconstitution file, further comprises:
  • means for creating a header with counts and offsets;
  • means for appending all location strings;
  • means for appending all random table names;
  • means for appending original data file names;
  • means for appending composite files names;
  • means for compressing trailers; and
  • means for writing actions each with its compressed trailer in reverse order.

©2004 Marpex, Inc.
Search What is Pryvit? Cryptography Experts Software Providers Patent Products Other