Method for strongly encrypting .ZIP files

Information

  • Patent Grant
  • 11461487
  • Patent Number
    11,461,487
  • Date Filed
    Tuesday, February 25, 2020
    4 years ago
  • Date Issued
    Tuesday, October 4, 2022
    2 years ago
Abstract
The present invention provides a method of integrating existing strong encryption methods into the processing of a .ZIP file to provide a highly secure data container which provides flexibility in the use of symmetric and asymmetric encryption technology. The present invention adapts the well-established .ZIP file format to support higher levels of security and multiple methods of data encryption and key management, thereby producing a highly secure and flexible digital container for electronically storing and transferring confidential data.
Description
BACKGROUND

The present invention relates generally to a method of using standard .ZIP files and strong encryption technology to securely store files, and more particularly to a method of integrating existing strong encryption methods into the processing of .ZIP files to provide a highly secure data container which provides flexibility in the use of symmetric and asymmetric encryption technology. The present invention adapts the well-established and widely used .ZIP file format to support higher levels of security and multiple methods of data encryption and key management, thereby producing an efficient, highly secure and flexible digital container for electronically storing and transferring confidential data.


Compression of computer files has been available for many years. Compressing files can save large amounts of disk space, and can reduce transfer time when downloading files from the Internet or transferring files through email. Almost any file one downloads from the Internet is compressed in some way. A standard compressed file or folder as it is sometimes called contains one or more files that were compressed into a single file or folder. Many different compression formats have been developed over the years. The .ZIP format, created by the assignee of the present invention, is perhaps the most common compressed file format for the personal computer. Any file with a “.zip” extension most likely contains one or more files of data archived, that is, each either compressed or stored, in the .ZIP format. “Zipping” a file has become a commonly used term meaning to compress the file into the .ZIP format archive so that it occupies less disk space, and similarly, “unzipping” a file means decompressing a compressed file in the .ZIP format.


A .ZIP file is generally recognized as a data compression and archiving format invented by PKWARE, Inc. The .ZIP format is a file format designed for combining data compression technology with file archiving techniques. Many commercially available software products are available for compressing or “zipping” files or other data into the .ZIP format. These .ZIP files can then be used to reconstruct the original data through the “unzipping” process. Data compression converts the contents of a file into an encoded format requiring less computer storage space or in the case of transmission less network bandwidth than the original uncompressed file.


Archiving, in the context of a .ZIP file, is a method of storing information about the characteristics of a file in a catalogue of files, known as the Central Directory, inside the .ZIP file, allowing each file to be retrieved individually by its characteristics. This capability is widely used. These characteristics include, but are not limited to, file name, file size, and file creation date and time.


Software programs such as PKZIP.RTM. written by PKWARE, Inc. are used to process files in the .ZIP format; Such programs allow one or more files of any type to be compressed and archived into a file of the .ZIP format type for efficient file storage and transmission over computer and communication networks. This format and the software programs that process .ZIP files have become ubiquitous.


Data encryption is used by many software programs to provide data privacy. Data encryption is a method of encoding data so that it cannot be reproduced in its original form unless an associated key is provided. Decryption uses this key to convert the encrypted data back into its original state. The key is known only to the person encrypting the data or by those other people with whom the person encrypting the data chooses to share the key. The key is used to “unlock” the data so that it can again be used in its original form.


Keys are uniquely generated using data known to the person encrypting a file or other data associated with recipients and users of the file. This data can be a user-defined password or other random data. Several methods are commonly used for processing the keys used for data encryption. Encryption using a key generated from a password is an example of symmetric encryption. Encryption using a public/private key pair is an example of asymmetric encryption. An example of one method for processing encryption keys supported by this invention uses a public/private key pair commonly associated with digital certificates as defined by the document Internet X.509 Public Key Infrastructure Certificate and CRL Profile (RFC 2459). A digital certificate is a unique digital identifier associating a public and private key pair to an assigned individual, a group, or an organization. When used for encrypting data, the public key of an individual is used to process an encryption key which only the individual in possession of the corresponding private key can use for decryption. A digital certificate is issued to an individual, a group, or an organization for a fixed period of time and can only be used during this time period. After the time period has elapsed, the digital certificate will be considered to have expired and must be reissued for a new time period.


The strength of a data encryption method is determined at least in part by its key size in bits. The larger the key size a data encryption method uses, the more resistant it is to cryptanalysis. Cryptanalysis, or popularly “cracking”, is the unauthorized access to encrypted data. Strong encryption is a type of data encryption that uses key sizes of 128 bits or more. A number of encryption encoding methods are known today. Examples supported by the present invention include but are not limited to Advanced Encryption Standard (AES), Data Encryption Standard (DES), 2DES, 3DES, and others. A number of key sizes are commonly used today. Examples supported by the present invention include but are not limited to 128 bits, 192 bits, and 256 bits.


Many software programs available today that process .ZIP files use data encryption to encrypt files after compression as they are written to the .ZIP file. The data encryption method used by these software programs uses a key size of 96 bits or less and is considered weak or moderate encryption by today's standards. These software programs use keys generated using user-defined password data. Weak data encryption may not provide sufficient security to computer users that store and transfer their confidential data files using the .ZIP format.


Password-based key generation has been a commonly used method of applying data encryption, however, known vulnerabilities to cracking methods such as “brute force password cracking” make this method of encryption insufficient to meet today's more advanced security needs. Another known limitation of password-based security is the lack of non-repudiation. Non-repudiation is the ability to be certain that the person or program that created an encrypted .ZIP file cannot deny that fact and that their identity is bound to the .ZIP file they created. This cannot be achieved with symmetric encryption methods. Today, non-repudiation is an important aspect of security related to the implementation of digital certificates and digital signatures. It is critically important to be able to prove that a creator or sender of an encrypted file did in fact create the file, i.e. not repudiate his/her action.


Therefore, a need exists to extend the options for levels of security available to programs that process .ZIP files. This extended of security capability makes use of the encryption technologies available today or others that may gain acceptance in the future.


SUMMARY OF THE INVENTION

The present invention provides a method of integrating multiple strong encryption methods into the processing of .ZIP files to provide a highly secure data container which provides flexibility in the use of symmetric and asymmetric encryption technology. The present invention adapts the well-established .ZIP file format to support higher levels of security and multiple methods of data encryption and key management, thereby producing a highly secure and flexible digital container for storing and transferring confidential electronic data.


The present invention provides a method of integrating multiple strong encryption methods into the processing of .ZIP files to provide a highly secure data container which provides flexibility in the use of encryption technology. The present invention supports existing weak encryption methods available in .ZIP software programs used today to ensure backward compatibility with existing software programs that use the .ZIP file format. Strong encryption methods are made available to computer users as configurable options to select when compressing and encrypting their files or other data into a .ZIP file.


The method of the present invention provides the capability of using strong encryption when creating .ZIP files. It is flexible in that it provides that different encryption methods can be applied to a single .ZIP file to meet the security needs of a given computer user or application. Strong encryption algorithms are preferably used in conjunction with either password (symmetric) or any form of public/private key (asymmetric) encryption methods. The symmetric method preferably includes a password defined by the user, while the asymmetric method preferably includes a public/private key associated with digital certificates to process encryption keys. The invention allows one or more passwords and one or more public keys to be used individually, or in combination at the same time when archiving any file of any type of data into a secure .ZIP file. This capability is useful since secure .ZIP files are frequently distributed, or otherwise made accessible, to multiple recipients for decryption. Some of those recipients may require password access while others may require certificate access.


The method of the present invention also supports the four basic security functions to be associated with encrypted files: confidentiality, message authentication, sender or creator authentication, and non-repudiation.


Specifically, the present invention supports non-repudiation to uniquely bind a .ZIP file with the identity of its creator, and prevent that creator from denying the creation of that .ZIP file. One method of non-repudiation used by this invention is the identity support available with digital signatures that can be generated using public/private key technology. The non-repudiation function provided by the present invention also preferably supports time-stamping methods for fixing the creation of a digital signature in time, as well as time-stamped audit trails providing transaction history.


As indicated, the method of the present invention also supports message authentication. Message authentication ensures the data has not been altered since being encrypted. The present invention supports message authentication techniques that employ public/private key forms of message authentication, as well as other methods of message authentication that do not require the use of public/private keys. One example of an alternative method that does not use a public/private key is a cryptographic checksum.


The method of the present invention further supports the encryption of file characteristics for each file inside a .ZIP file. Current ZIP software programs encrypt only the contents of the files in a .ZIP file. The additional characteristics for each file, such as its name, size, etc., remain unencrypted. To remove the possibility that this unencrypted data for a file could be made available to an unauthorized user, this information may preferably also be encrypted as an option. This additional encryption further increases the level of security available to .ZIP file users.


Public keys such as those associated with digital certificates used for encrypting .ZIP file data preferably resides on a user's local computer in a file or a database, on an external device such as a Smart Card or other removable device, or in a shared data repository such as a directory service served by an LDAP server.


The present invention also provides multiple methods of checking whether a digital certificate is valid for use. These methods preferably include, but are not limited to standard methods of certificate validation, such as searching certificate revocation lists (CRL), certificate trust lists (CTL), and online checking via the internet using Online Certificate Status Protocol (OCSP) or Simple Certificate Validation Protocol (SCVP).


The method of the present invention also preferably defines data storage locations within the established .ZIP file format specification for storing information on the encryption parameters used when a file was encrypted and on the keys needed when a file is to be decrypted. One such example of these data storage locations includes a field to identify that a new strong encryption method has been applied to a file in the .ZIP file. The strong encryption record will be defined within a Central Directory storage area for each encrypted file. The Central Directory is a storage location defined in the .ZIP file format which serves as a table of contents for the entire .ZIP file. An entry is made into the Central Directory for each file added to a .ZIP file. A decryption record will be defined for storing the information needed to initialize and start the decryption process. This decryption record will be placed immediately ahead of the encrypted data for each file in a .ZIP file. This example is not the only method of storing this data as other storage methods can be defined.


The present invention provides many advantages or benefits over the prior art. One benefit is the ability to use multiple encryption methods instead of supporting only a single encryption method. A second benefit is the ability to use a mixture of symmetric and asymmetric encryption in a single, secure .ZIP file. A third benefit is that the encryption of individual files using advanced public/private keys provides a significantly higher level of security to computer users. A fourth benefit is that encryption of .ZIP file data can be implemented using a range of commonly available cryptographic toolkits. A fifth benefit is that the present invention supports using packaged or readily available encryption algorithms to provide state-of-the-art security. A sixth benefit is the availability of non-repudiation using digital signatures through the use of public/private key technology. A seventh benefit is that the invention ensures a high degree of interoperability and backward compatibility by extending the current .ZIP file format.


Various other features, objects, and advantages of the invention will be made apparent to those skilled in the art from the following detailed description, claims, and accompanying drawings.





BRIEF DESCRIPTION OF THE DRAWINGS


FIG. 1 is a record layout of a prior art .ZIP file prior to the present invention.



FIG. 2 is a record layout of a .ZIP file in accordance with the present invention.





DETAILED DESCRIPTION OF THE INVENTION

Referring now to the drawings, FIG. 1 shows the file format for the standard .ZIP file, in existence prior to the present invention. FIG. 2 illustrates the preferred general record layout of a .ZIP file in accordance with the present invention.


The newly modified ZIP file format specification according to the present invention, as published by PKWARE, Inc., is described in a document entitled APPNOTE.TXT, which is incorporated herein by reference. The new version of the .ZIP file format provides an implementation of the use of strong encryption based on a key generated using a password. This implementation constitutes one example of a structure and layout of the records and fields suitable for processing secure .ZIP files as defined by the present invention. The complete description of the conventional or standard .ZIP file format will not be included here since this information is generally well known. Only the portions pertaining to the new records and fields defined by the new format, capable of storing data using strong encryption, will be discussed in detail.


The present invention extends the original .ZIP file format with the addition of new storage records to support the use of strong encryption methods including, as described above, both public/private key, or asymmetric, methods, and password-based, or symmetric, methods, and the capability to use a mixture of symmetric and asymmetric methods.


An example of implementing a new strong encryption method is discussed below. This example identifies several new records and fields that must be defined within the .ZIP file format.


A new General Purpose Bit Flag having a hexadecimal value of 0x0040 to be set in both the Local and Central Record Headers when strongly encrypting a file.


A new Decryption Header to be located immediately ahead of and adjacent to the compressed data stored for each file.


A new Extra Field record definition with an ID having a hexadecimal value of 0x0017 to be inserted into the Central Record Header for each file.


When using these new fields for strongly encrypting files, the following actions are indicated.


1. If the General Purpose Bit Flag value of 0x0040 is set to indicate strong encryption was applied to a file, the General Purpose Bit Flag value of 0x0001 will also generally be set.


2. Files having a size of zero bytes (an empty file) should not generally be encrypted. As indicated, however, the file characteristics of the archived files may be encrypted, even if the file is of zero length and is not itself encrypted.


3. The contents of the field labeled Version Needed to Extract in both the Local and Central Record Headers should preferably be set to the decimal value of 50 or greater. If the AES encryption method is used, the contents of the field labeled Version Needed to Extract in both the Local and Central Record Headers should preferably be set to the decimal value 51 or greater.


4. Data encryption should preferably be applied after a file is compressed, but encryption can be applied to a file if compression is not used. If compression is not applied to a file, it is considered to be stored in the .ZIP file.


5. If encryption is applied using digital certificates, a list of intended recipients will be constructed. Each entry in the recipient list identifies a person whose public key has been used in the encryption process for a file and who is allowed to decrypt the file contents using their private key.


Record Definitions:


New Decryption Header (NDH)














Size



Value
(bytes)
Description







IV size
2
Size of custom initialization vector/salt,




if 0 then CRC32 + 64-bit File Size should




be used to decrypt data.


IV
variable
Initialization vector/salt (file specific)




which should be used in place of CRC32 +




64-BIT File Size


Original
4
Original (uncompressed) size of the


Size

following data


Decryption
variable
Decryption Information


Info.









Decryption Information (Details)


Decryption Information (Details)














Size



Value
(bytes)
Description







Version (3)
2
Version/Format of decryption information.


AlgID
2
Encryption Algorithm ID


BitLen
2
Bit length of the key


Flags
2
Processing flags


ERD size
2
Size of Encrypted Random Data (ERD)


ERD
variable
Encrypted Random Data


Recipient Count
4
Number of Recipients


Hash Algorithm
2
Hash algorithm to be used to calculate




Public Key hash (absent for password




based encryption)


Hash Size
2
Size of Public Key hash (absent for




password based encryption)


Recipient List
Variable
Recipient List Element (absent for


Element

password based encryption)


Password
2
Size of random password validation data


Validation

(Includes CRC32 of PVD; >4) MUST be


Data size

multiple of encryption block sizes


Password,
Variable
Password Validation Data (PVD)


Validation Data


CRC32 of PVD
4
CRC32 of PVD, used for password




verification when decrypting data









Encryption Algorithm ID (AlgID) identifies which of several possible strong encryption algorithms was used for encrypting a file in the .ZIP file. The strong encryption algorithms that can be used include but are not limited to AES, 3DES, 2DES, DES, RC2 and RC4. The use of other unspecified strong algorithms for encryption is supported by the present invention.


Hash Algorithm identifies which of several possible hash algorithms was used for the encryption process for a file in the .ZIP file. The algorithms that can be used include but are not limited to MD5, SHA1-SHA512. The use of other unspecified algorithms for hashing is supported by the present invention.


Flags


The following values are defined for the processing Flags.














Name
Value
Description







PASSWORD_KEY
0x0001
Password is used


CERTIFICATE_KEY
0x0002
Recipient List is used


COMBO_KEY
0x0003
Either a password or a Recipient




List can be used to decrypt a file.


DOOUBLE_SEED_KEY
0x0007
Both password and Recipient List




are required to decrypt a file.




ERD is encrypted twice by 2




separate keys.


DOUBLE_DATA_KEY
0x000f
Both a password and a Recipient




List are required to decrypt a




file. File data is encrypted




twice using 2 separate keys.


MASTER_KEY_3DES
0x4000
Specified 3DES algorithm is used




for MSK









Recipient List Element















Size



Value
(bytes)
Description







Recipient Element
2
Combined size of Hash of Public


size

Key and Simple Key Blob


Hash
Hash Size
Hash of Public Key


Simple key Blob
variable
Simple Key Blob









New Decryption Central Record Extra Field (NDCEF)














Size



Value
(bytes)
Description







0x0017
2
Signature of NDCEF


Data Size
2
Size of the following data (at least




12 bytes)


Version (2)
2
Version/Format of this extra field.


AlgID
2
Encryption Algorithm ID.


BitLen
2
Bit length of the key


Flags
2
Processing flags


Recipient Count
4
Number of Recipients


Hash Algorithm
2
Hash algorithm to be used to calculate




Public Key hash (absent for password




based encryption)


Hash Size
2
Size of Public Key hash (absent for




password based encryption)


Simplified
variable
Simplified Recipient List Element


Recipient List

(absent for password based encryption)


Element









Simplified Recipient List Element


















Size




Value
(bytes)
Description









Hash
Hash Size
Hash of Public Key











A simplified recipient list element is defined as a subset of a recipient list element and is stored to provide redundancy of the recipient list data for the purposes of data recovery.


Process Flow:


The following is a description of the most preferred encryption/decryption process for a single file using the storage format defined by this example. Any programs, software or other processes available to suitably perform the encryption/decryption process may be used.


Encryption:

    • 1. Validate public/private key
    • 2. Calculate file digital signature and time-stamp
    • 3. Compress or Store uncompressed file data
    • 4. Generate a File Session Key (FSK) (see below)
    • 5. Calculate Decryption Information size
    • 6. Adjust Compressed Size to accommodate Decryption Information and padding
    • 7. Save Decryption Information to .ZIP file
    • 8. Encrypt Compressed or Stored File Data
    • 9. Encrypt file characteristics


Decryption:

    • 1. Decrypt file characteristics
    • 2. Read Decryption Information from .ZIP file
    • 3. Generate FSK (see below)
    • 4. Verify Decryption Information (see below)
    • 5. If Decryption Information is valid, then decrypt Compressed or Stored File Data
    • 6. Decompress compressed data
    • 7. Validate file time-stamp and digital signature


Generating Master Session Key (MSK)

    • 1. If MASTER_KEY_3DES is set, use 3DES 3-key as MSK algorithm, otherwise use specified algorithm.
    • 2. If encrypting or decrypting with a password.
    • 2.1.1. Prompt user for password
    • 2.1.2. Calculate hash of the password
    • 2.1.3. Pass calculated hash as argument into a cryptographic key derivation function or its equivalent.
    • 3. When encrypting using a public key(s).
    • 3.1.1. Call a cryptographic key generation function or its equivalent to generate random key
    • 4. When decrypting using a private key(s).
    • 4.1. Using Recipient List information, locate private key, which corresponds to one of the public keys used to encrypt MSK.
    • 4.2. Decrypt MSK


Salt and/or Initialization Vector (IV)

    • 1. For algorithms that use both Salt and IV, Salt=IV


2. IV can be completely random data and placed in front of Decryption Information

    • 3. Otherwise IV=CRC32+64-bit File Size


Adjusting Keys

    • 1. Determine Salt and/or Initialization Vector size of the key for the encryption algorithm specified. Usually salt is compliment to 128 bits, so for 40-bit key Salt size will be 11 bytes. Initialization Vector is usually used by block algorithms and its size corresponds to the block size.
    • 2. If Salt size>0 or Initialization Vector size is >0 then set IV.sup.1 to be used by the specified encryption algorithm. .sup.1When adjusting MSK, if IV is smaller then required Initialization Vector (or Salt) size it is complimented with 0, if it is larger it is truncated. For all other operations IV is used as is without any modifications.


Generating File Session Key (FSK)

    • 1. FSK<-SHA1(MSK(IV)). Adjust MSK with IV, and decrypt ERD (Encrypted Random Data). Calculate hash of IV+Random Data. Pass calculated hash as argument into a cryptographic key derivation function or its equivalent to obtain FSK.


Verifying Decryption Information

    • 1. Decryption Information contains variable length Password Validation Data (PVD).
    • 2. First Password Validation Data Size—4 bytes are random data, and last 4 bytes are CRC32 of that random data. This allows verification that the correct key is used and deters plain text attacks.


The following modifications are used for encrypting and decrypting multiple files.


Multi-File Encryption:

    • 1. Generate MSK.
    • 2. For each file follow Encryption steps.


Multi-File Decryption:

    • 1. Generate MSK from the file Decryption Information
    • 2. For each file follow Decryption steps
    • 3. If Decryption Information verification fails go to step 1


Alternate storage formats can be defined for implementing the flexible security support within ZIP files. One such alternative is to use other fields, either existing or newly defined to denote that a strong encryption method was applied to a .ZIP archive. Another alternative could be to use additional storage fields in addition to those defined in the above example, or to use the fields as defined, but ordered differently within each record. Still other implementations may use fewer, or more, records or fields than are defined by the above example or the records and fields may be placed in other physical locations within the .ZIP file.


Alternate processing methods can also be defined for implementing the flexible security support within .ZIP files. One such alternative is to implement the encryption process for each file using another public/private key technology such as that defined by the OpenPGP Message Format as documented in RFC 2440. Another alternative could be to use a more direct form of encryption key generation where the file session key is directly used for encrypting each file. This method would not use the indirect form described in the above example where the file session key is derived from a master key.


While the invention has been described with reference to preferred embodiments, it is to be understood that the invention is not intended to be limited to the specific embodiments set forth above. Thus, it is recognized that those skilled in the art will appreciate that certain substitutions, alterations, modifications, and omissions may be made without departing from the spirit or intent of the invention. Accordingly, the foregoing description is meant to be exemplary only, the invention is to be taken as including all reasonable equivalents to the subject matter of the invention, and should not limit the scope of the invention set forth in the following claims.

Claims
  • 1. A method of retrieving a desired data file from a .zip file format data container, said method including: receiving a data container constructed in accordance with a .Zip file format, wherein said data container includes: an encrypted data file;encrypted random data;a first asymmetric key data; anda second asymmetric key data;receiving one of a first asymmetric key and a second asymmetric key,wherein, when said first asymmetric key is received, said first asymmetric key is used to decrypt said first asymmetric key data to determine a second symmetric key,wherein, when said second asymmetric key is received, said second asymmetric key is used to decrypt said second asymmetric key data to determine said second symmetric key;decrypting said encrypted random data using said second symmetric key to determine a first symmetric key; anddecrypting said encrypted data file using said first symmetric key to determine a desired data file.
Parent Case Info

The present application is a continuation of U.S. patent application Ser. No. 16/178,873, filed Nov. 2, 2018, entitled “METHOD FOR STRONGLY ENCRYPTING .ZIP FILES,” which is a continuation of U.S. patent application Ser. No. 14/753,888, filed Jun. 29, 2015, now U.S. Pat. No. 10,127,397, entitled “METHOD FOR STRONGLY ENCRYPTING .ZIP FILES,” which is a continuation of U.S. patent application Ser. No. 13/489,011, filed on Jun. 5, 2012, now U.S. Pat. No. 9,098,721, entitled “METHOD FOR STRONGLY ENCRYPTING .ZIP FILES,” which is a continuation of application Ser. No. 10/945,292, filed on Sep. 20, 2004, now U.S. Pat. No. 8,225,108, entitled “METHOD AND SYSTEM FOR MIXED SYMMETRIC AND ASYMMETRIC ENCRYPTION OF .ZIP FILES,” which is a continuation of application Ser. No. 10/620,960, filed on Jul. 16, 2003, entitled “METHOD AND SYSTEM FOR STRONGLY ENCRYPTING .ZIP FILES,” now abandoned, all of which are hereby incorporated by reference in their entirety.

US Referenced Citations (298)
Number Name Date Kind
4041284 Bond Aug 1977 A
4156922 Majerski et al. May 1979 A
4179746 Tubbs Dec 1979 A
4377846 Yoshida Mar 1983 A
4521866 Petit et al. Jun 1985 A
4542453 Patrick et al. Sep 1985 A
4792954 Arps et al. Dec 1988 A
4862167 Copeland Aug 1989 A
4891643 Mitchell et al. Jan 1990 A
4905297 Langdon, Jr. et al. Feb 1990 A
4933883 Pennebaker et al. Jun 1990 A
4935882 Pennebaker et al. Jun 1990 A
4939639 Lee et al. Jul 1990 A
4947318 Mineo Aug 1990 A
4989000 Chevion et al. Jan 1991 A
5003307 Whiting et al. Mar 1991 A
5016009 Whiting et al. May 1991 A
5025258 Duttweiler Jun 1991 A
5051745 Katz Sep 1991 A
5091955 Iseda et al. Feb 1992 A
5099440 Pennebaker et al. Mar 1992 A
5126739 Whiting et al. Jun 1992 A
5142283 Chevion et al. Aug 1992 A
5146221 Whiting et al. Sep 1992 A
5150209 Baker et al. Sep 1992 A
5155847 Kirouac et al. Oct 1992 A
5159336 Rabin et al. Oct 1992 A
5179555 Videlock et al. Jan 1993 A
5218700 Beechick Jun 1993 A
5270712 Iyer et al. Dec 1993 A
5272478 Allen Dec 1993 A
5274805 Ferguson et al. Dec 1993 A
5298896 Lei et al. Mar 1994 A
5315655 Chaplin May 1994 A
5363099 Allen Nov 1994 A
5404315 Nakano et al. Apr 1995 A
5414425 Whiting et al. May 1995 A
5440504 Ishikawa et al. Aug 1995 A
5446895 White et al. Aug 1995 A
5455946 Mohan Oct 1995 A
5463390 Whiting et al. Oct 1995 A
5463772 Thompson et al. Oct 1995 A
5465224 Guttag et al. Nov 1995 A
5469564 Junya Nov 1995 A
5475388 Gormish et al. Dec 1995 A
5481713 Wetmore et al. Jan 1996 A
5485411 Guttag et al. Jan 1996 A
5493524 Guttag et al. Feb 1996 A
5506580 Whiting et al. Apr 1996 A
5517439 Suzuki et al. May 1996 A
5532694 Mayers et al. Jul 1996 A
5535300 Hall, II et al. Jul 1996 A
5546080 Langdon, Jr. et al. Aug 1996 A
5563595 Strohacker Oct 1996 A
5581697 Gramlich et al. Dec 1996 A
5587710 Choo et al. Dec 1996 A
5590350 Guttag et al. Dec 1996 A
5592162 Printz et al. Jan 1997 A
5594674 Printz et al. Jan 1997 A
5596763 Guttag et al. Jan 1997 A
5600847 Guttag et al. Feb 1997 A
5623546 Hardy et al. Apr 1997 A
5627995 Miller et al. May 1997 A
5634065 Guttag et al. May 1997 A
5640578 Balmer et al. Jun 1997 A
5654702 Ran Aug 1997 A
5659616 Sudia Aug 1997 A
5671389 Saliba Sep 1997 A
5675645 Schwartz et al. Oct 1997 A
5682152 Wang et al. Oct 1997 A
5689452 Cameron Nov 1997 A
5694128 Kim Dec 1997 A
5696954 Guttag et al. Dec 1997 A
5699275 Beasley et al. Dec 1997 A
5715470 Asano et al. Feb 1998 A
5732214 Subrahmanyam Mar 1998 A
5734119 France et al. Mar 1998 A
5734880 Guttag et al. Mar 1998 A
5737345 Pelz et al. Apr 1998 A
5745756 Henley Apr 1998 A
5771355 Kuzma Jun 1998 A
5774081 Cheng et al. Jun 1998 A
5778374 Dang et al. Jul 1998 A
5781901 Kuzma Jul 1998 A
5802520 Jerkunica et al. Sep 1998 A
5802549 Goyal et al. Sep 1998 A
5805913 Guttag et al. Sep 1998 A
5808572 Yang et al. Sep 1998 A
5813011 Yoshida et al. Sep 1998 A
5818369 Withers Oct 1998 A
5828848 Maccormack et al. Oct 1998 A
5832273 Mizuse Nov 1998 A
5832520 Miller Nov 1998 A
5838996 deCarmo Nov 1998 A
5841865 Sudia Nov 1998 A
5844575 Reid Dec 1998 A
5847980 Okamoto et al. Dec 1998 A
5854597 Murashita et al. Dec 1998 A
5857035 Rust Jan 1999 A
5867600 Hongu Feb 1999 A
5881225 Worth Mar 1999 A
5903723 Beck et al. May 1999 A
5907703 Kronenberg et al. May 1999 A
5909638 Allen Jun 1999 A
5911776 Guck Jun 1999 A
5912636 Gormish et al. Jun 1999 A
5918002 Klemets et al. Jun 1999 A
5933503 Schell et al. Aug 1999 A
5937188 Freeman Aug 1999 A
5940507 Cane et al. Aug 1999 A
5956733 Nakano et al. Sep 1999 A
5960117 Hiratani Sep 1999 A
5926208 Hasebe Oct 1999 A
5961635 Guttag et al. Oct 1999 A
5970097 Ishiwaka et al. Oct 1999 A
5974539 Guttag et al. Oct 1999 A
5986594 Nakayama et al. Nov 1999 A
5995747 Guttag et al. Nov 1999 A
5995748 Guttag et al. Nov 1999 A
6018747 Burns et al. Jan 2000 A
6021198 Anigbogu et al. Feb 2000 A
6023506 Ote et al. Feb 2000 A
6028541 Levine Feb 2000 A
6032200 Lin Feb 2000 A
6041147 Mead Mar 2000 A
6043763 Levine Mar 2000 A
6047318 Becker et al. Apr 2000 A
6049630 Wang et al. Apr 2000 A
6049671 Slivka et al. Apr 2000 A
6052531 Waldin et al. Apr 2000 A
6061732 Korst et al. May 2000 A
6078921 Kelley Jun 2000 A
6083279 Cuomo et al. Jul 2000 A
6088717 Reed et al. Jul 2000 A
6091777 Guetz et al. Jul 2000 A
6094453 Gosselin et al. Jul 2000 A
6098163 Guttag et al. Aug 2000 A
6112211 Bradshaw et al. Aug 2000 A
6116768 Guttag et al. Sep 2000 A
6118392 Levine Sep 2000 A
6121904 Levine Sep 2000 A
6122378 Yoshuiura et al. Sep 2000 A
6125348 Levine Sep 2000 A
6144320 Van Der Vleuten Nov 2000 A
6145069 Dye Nov 2000 A
6148340 Bittinger Nov 2000 A
6151609 Truong Nov 2000 A
6154771 Rangan et al. Nov 2000 A
6157706 Rachelson Dec 2000 A
6161218 Taylor Dec 2000 A
6161219 Ramkumar et al. Dec 2000 A
6163772 Kramer et al. Dec 2000 A
6166664 Acharya Dec 2000 A
6167453 Becker et al. Dec 2000 A
6173317 Chaddha et al. Jan 2001 B1
6173394 Guttag et al. Jan 2001 B1
6182045 Kredo et al. Jan 2001 B1
6185681 Zizzi Feb 2001 B1
6188334 Bengio et al. Feb 2001 B1
6195026 Acharya Feb 2001 B1
6198412 Goyal Mar 2001 B1
6217234 Dewar et al. Apr 2001 B1
6225925 Bengio et al. May 2001 B1
6229463 Van Der Vleuten et al. May 2001 B1
6233017 Chaddha May 2001 B1
6233565 Lewis et al. May 2001 B1
6236341 Dorward et al. May 2001 B1
6275848 Arnold Aug 2001 B1
6289509 Kryloff Sep 2001 B1
6304915 Nguyen et al. Oct 2001 B1
6324525 Kramer et al. Nov 2001 B1
6345288 Reed et al. Feb 2002 B1
6356937 Montville et al. Mar 2002 B1
6363363 Haller et al. Mar 2002 B1
6363486 Knapton, III Mar 2002 B1
6366930 Parker et al. Apr 2002 B1
6373950 Rowney Apr 2002 B1
6378054 Karasudani et al. Apr 2002 B1
6381742 Forbes et al. Apr 2002 B2
6401241 Taylor Jun 2002 B1
6405265 Kronenberg et al. Jun 2002 B1
6415435 Mcintyre Jul 2002 B1
6427149 Rodriguez et al. Jul 2002 B1
6434561 Durst et al. Aug 2002 B1
6456985 Ohtsuka Sep 2002 B1
6460044 Wang Oct 2002 B1
6466999 Sliger et al. Oct 2002 B1
6477703 Smith et al. Nov 2002 B1
6484259 Barlow Nov 2002 B1
6487278 Skladman et al. Nov 2002 B1
6498835 Skladman et al. Dec 2002 B1
6522268 Belu Feb 2003 B2
6526574 Jones Feb 2003 B1
6529908 Piett et al. Mar 2003 B1
6539396 Bowman-Amuah Mar 2003 B1
6546417 Baker Apr 2003 B1
6567793 Hicks et al. May 2003 B1
6577311 Crosby et al. Jun 2003 B1
6577735 Bharat Jun 2003 B1
6594822 Schweitz et al. Jul 2003 B1
6604106 Bodin et al. Aug 2003 B1
6615350 Schell et al. Sep 2003 B1
6629150 Huded Sep 2003 B1
6635088 Hind et al. Oct 2003 B1
6657702 Chui et al. Dec 2003 B1
6684331 Srivastava Jan 2004 B1
6742176 Million et al. May 2004 B1
6760845 Cafarelli et al. Jul 2004 B1
6785677 Fritchman Aug 2004 B1
6785810 Lirov et al. Aug 2004 B1
6807632 Carpentier et al. Oct 2004 B1
6850248 Crosby et al. Feb 2005 B1
6870547 Crosby et al. Mar 2005 B1
6879988 Basin et al. Apr 2005 B2
6883032 Dempski Apr 2005 B1
6892382 Hapner et al. May 2005 B1
6904110 Trans et al. Jun 2005 B2
6914985 Shrader et al. Jul 2005 B1
6934836 Strand et al. Aug 2005 B2
6952823 Kryloff et al. Oct 2005 B2
6959300 Caldwell et al. Oct 2005 B1
6976165 Carpentier et al. Dec 2005 B1
6981141 Mahne et al. Dec 2005 B1
6983371 Hurtado et al. Jan 2006 B1
6996251 Malone et al. Feb 2006 B2
7069271 Fadel et al. Jun 2006 B1
7069451 Ginter et al. Jun 2006 B1
7085850 Calvignac et al. Aug 2006 B2
7127712 Noble et al. Oct 2006 B1
7133846 Ginter et al. Nov 2006 B1
7136882 Collins et al. Nov 2006 B2
7139811 Lev Ran et al. Nov 2006 B2
7139918 Chang et al. Nov 2006 B2
7149896 Bahl et al. Dec 2006 B1
7184573 Malone et al. Feb 2007 B2
7298851 Hendricks et al. Nov 2007 B1
7386726 Gehrmann et al. Jun 2008 B2
7434052 Rump Oct 2008 B1
7793099 Peterson Sep 2010 B2
7844579 Peterson et al. Nov 2010 B2
7895434 Peterson Feb 2011 B2
8090942 Peterson Jan 2012 B2
8225108 Peterson Jul 2012 B2
8230482 Peterson et al. Jul 2012 B2
8572757 Stamos et al. Oct 2013 B1
8959582 Peterson et al. Feb 2015 B2
9098721 Peterson Aug 2015 B2
10127397 Peterson Nov 2018 B2
10607024 Peterson Mar 2020 B2
20010002485 Bisbee et al. May 2001 A1
20010014884 Dillard et al. Aug 2001 A1
20010023360 Nelson et al. Sep 2001 A1
20010029530 Naito et al. Oct 2001 A1
20010030667 Kelts Oct 2001 A1
20010037309 Vrain Nov 2001 A1
20010042121 Defosse et al. Nov 2001 A1
20010055407 Rhoads Dec 2001 A1
20020007287 Straube et al. Jan 2002 A1
20020029227 Multer et al. Mar 2002 A1
20020029228 Rodriguez et al. Mar 2002 A1
20020040369 Multer et al. Apr 2002 A1
20020042833 Hendler et al. Apr 2002 A1
20020049717 Routtenberg et al. Apr 2002 A1
20020059144 Meffert et al. May 2002 A1
20020076052 Yung et al. Jun 2002 A1
20020078466 Beyda Jun 2002 A1
20020120639 Basin et al. Aug 2002 A1
20020178439 Rich et al. Nov 2002 A1
20020184509 Scheldt et al. Dec 2002 A1
20020188605 Adya et al. Dec 2002 A1
20030016770 Trans et al. Jan 2003 A1
20030034905 Anton et al. Feb 2003 A1
20030046572 Newman et al. Mar 2003 A1
20030065873 Collins et al. Apr 2003 A1
20030115169 Ye Jun 2003 A1
20030144858 Jain et al. Jul 2003 A1
20030233494 Ghosh et al. Dec 2003 A1
20040030898 Tsuria et al. Feb 2004 A1
20040098715 Aghera May 2004 A1
20040107125 Guheen et al. Jun 2004 A1
20040117845 Karaoguz Jun 2004 A1
20050055357 Campbell Mar 2005 A1
20050060356 Saika Mar 2005 A1
20050097077 Bolosky et al. May 2005 A1
20050147946 Ramamurthy et al. Jul 2005 A1
20050188058 Inoue Aug 2005 A1
20050251686 Torrubia-Saez Nov 2005 A1
20060143199 Peterson et al. Jun 2006 A1
20060143691 Peterson et al. Jun 2006 A1
20060155731 Peterson et al. Jul 2006 A1
20060173985 Moore Aug 2006 A1
20060200253 Hoffberg et al. Sep 2006 A1
20060200761 Judd et al. Sep 2006 A1
20060253451 Van de Sluis et al. Nov 2006 A1
20060265330 Fukasawa Nov 2006 A1
20060265760 Daemke et al. Nov 2006 A1
20140157435 Stamos et al. Jun 2014 A1
20140304835 Odnovorov et al. Oct 2014 A1
Foreign Referenced Citations (2)
Number Date Country
9-223052 Aug 1997 JP
WO 9949391 Sep 1999 WO
Non-Patent Literature Citations (120)
Entry
AES Encryption Information, WinZip Computing, May 15, 2013.
Kaliski, PKCS #7: Cryptographic Message Syntax Version 1.5, The Internet Society, 1998.
“PKWARE Releases New ZIP File Format Specification,” Business Wire, Dec. 2001, Retrieved from the Internet on Aug. 11, 2007 http://proquest.umi.com/pqdweb?did=93502134&sid= 1 &Fmt=3&clie ntId=19649&RQT=309&VName=PQD.
PKWARE, “Appnote.txt,” Version 1.0 (1990).
PKWARE, “Appnote.txt,” Version 2.0.
PKWARE, “Appnote.txt,” Version 4.5 (Nov. 1, 2001).
PKWARE, “Appnote.txt,” Version 6.2.1 (Apr. 1, 2005).
PKWARE, “Appnote.txt,” Version 6.2.2 (Jan. 6, 2006).
PKWARE, “Appnote.txt,” Version 6.3.2 (Sep. 28, 2007).
U.S. Appl. No. 10/945,352, abandoned.
U.S. Appl. No. 10/945,485, abandoned.
U.S. Appl. No. 10/945,473, abandoned.
U.S. Appl. No. 10/945,475, abandoned.
U.S. Appl. No. 10/946,250, abandoned.
U.S. Appl. No. 10/946,271, abandoned.
U.S. Appl. No. 10/946,127, abandoned.
U.S. Appl. No. 10/946,273, abandoned.
U.S. Appl. No. 10/946,454, abandoned.
U.S. Appl. No. 11/774,317, abandoned.
U.S. Appl. No. 12/366,435, abandoned.
U.S. Appl. No. 12/690,499, abandoned.
U.S. Appl. No. 11/358,865, abandoned.
U.S. Appl. No. 11/358,534, abandoned.
U.S. Appl. No. 11/358,497, abandoned.
U.S. Appl. No. 11/358,505, abandoned.
U.S. Appl. No. 11/358,745, abandoned.
U.S. Appl. No. 11/358,002, abandoned.
U.S. Appl. No. 11/358,844, abandoned.
U.S. Appl. No. 11/358,859, abandoned.
U.S. Appl. No. 11/358,318, abandoned.
U.S. Appl. No. 11/358,498, abandoned.
U.S. Appl. No. 11/358,518, abandoned.
U.S. Appl. No. 11/358,839, abandoned.
Bray N: “How Digital Certificates Work”, Computers & Security, Elsevier Science Publishers, Amsterdam, NL, vol. 16, No. 1, 1997, p. 62, XP004063818, ISSN: 0167-4048.
Campbell D: “Extending the Windows Explorer with Name Space Extensions”, Microsoft Systems Journal, Microsoft Corp., Redmond, WA, US, vol. 5, No. 6, Jul. 1996, pp. 89-96, XP000874429, ISSN: 0889-9932.
Cevenini G et al: “A Multiprovider, Universal, E-Mail Service for the Secure Exchange of Legally-Binding Multimedia Documents,” Conference Proceedings Article, 2000, pp. 47-50, XP 010515038.
“Chilkat Encryption .NET Component—RSA/AES,” Jul. 12, 2003, Retrieved from the Internet on Jan. 17, 2007: URL: <http:l/web.archive.org/web/20030712162512/http://www.visual-mp3.com/review/4017. html>.
CuteZIP InfoGuide, p. 1, retrieved from Internet Sep. 9, 2003.
Denning, “Cryptography and Data Security,” 1982, Addison-Wesley, pp. 92-98.
Desmond, “PKWare Offers Encryption for .ZIP Files,” Jul. 16, 2002, Retrieved from the Internet on Sep. 30, 2006: URL: <http://www.esecurityplanet.com/prodser/article.php/10753 1408191>.
“GlobalSCAPE Releases CuteZIP 1.0, the Next-Generation ZIP Utility, Combining Music and File Compress,” GlobalSCAPE, Mar. 2000, Retrieved from the Internet on Mar. 31, 2007, URL: <http://www.cuteftp.com/company/press.aspx?id=20>.
Green M., Top Ten File Compression Tools, Mar. 12, 1999, http://pcworld.com.
John Leyden: “Zip File Encryption Compromise Thrashed Out”, Internet Article, Online!, Jan. 21, 2004, XP002296118, http://www.theregister.co.uk/2004/01/21/zip file encryption compromise thrashed/.
Mark Nelson, Dr. Dobbs Journal: “LZW Data Compression,” Internet Article, Online!, Oct. 1989, XP002296120, http://www.dogma.neUmarkn/articles/lzw/lzw.htm.
Menezes et al., “Handbook of Applied Cryptography,” 1997, CRC Press, pp. 506-515.
Menezes et al., “Handbook of Applied Cryptography,” 1997, CRC Press, pp. 555-566.
Nelson, “Data Compression with the Burrows Wheeler Transform,” Jul. 2001, Retrieved from the Internet on Jan. 23, 2007: URL: <http://www.ddj.com/184409957>.
PalmHandZipper by HandWatch, Inc., Handango—Admin Product Detail, retrieved from the Internet on Jul. 1, 2008, URL: <http://www.handango.com/AdminProductDetailView.jsp?siteId= 1&productId=23214&platform Id=1&productType=2>.
PKCS #7: Cryptographic Message Syntax Standard, RSA Laboratories, 1993, Retrieved from the Internet on Jul. 6, 2008: <URL: ftp://ftp.rsasecurity.com/pub/pkcs/ps/pkcs-7.ps>.
PKWARE, “Appnote.txt” 1998 Version, Jul. 1998, Retrieved from the Internet on Jan. 5, 2009:<URL:http://http://mediasrv.ns.ac.yu/extra/fileformat/archive/zip/zip.txt>.
PKWARE, “X.509 Digital Certificates and the .ZIP File Archive,” Retrieved from the Internet on Jan. 5, 2009: <URL: http://mycroft.com .au/clients/mycroft. nsf/downloadlookup/pkzx509. pdf/$File/pkzx509. pdf?Open Element>.
PKWARE: “Appnote.txt—.zip file format specification”, Internet Article, Online!, Jan. 11, 2001, XP002296121, http://www.the7soft.com/file-formats/file-formats-Archivers/zi p45.zip.
“PlexCrypt 4.2 User Manual,” Jun. 2003, Retrieved from the Internet on Jan. 17, 2007: URL: <http://www.plexobject.com/software/plexcrypUdocs/plexcrypt. pdf>.
“PlexCrypt Compression-Encryption 3.1 details,” Aug. 2001, Retrieved from the Internet on Jan. 17, 2007: URL: <http://www.downloadsofts.com/download/Security-Privacy/Encryption-Tools/PlexCrypt-Com pression-Encryptio n-download-detai ls.html>.
“PlexCrypt Compression-Encryption 3.1,” Aug. 2001, Retrieved from the Internet on Jan. 17, 2007: URL: <http://www.fivesign.com/downloads/program/PlexCrypt-CompressionEncryption 6715 66.html>.
“PlexCrypt Compression-Encryption,” Aug. 2001, Retrieved from the Internet on Jan. 17, 2007: URL: <http://www.exefind.com/plexcrypt-compression-encryption-P13552.html>.
Press Release PKWARE, Inc.: “PKWARE Releases New ZIP Format Specification”, Internet Article, Online!, Dec. 2001, XP002296119, URL:http://www.pkware.com/news/releases/2001/120501. php.
Randal C Burns: “Differential Compression: A Generalized Solution for Binary Files”, Thesis, Dec. 1996, XP002211282.
Reichenberger C: “Delta Storage for Arbitrary Non-Text Files”, 1991, New York, NY, US, pp. 144-152, XP008030925, ISBN: 0-89791-429-5.
Roth et al., “Access Control and Key Management for Mobile Agents,” Elsevier Science Ltd., 1998.
Schneier et al., “Twofish : A 128-Bit Block Cipher,” Abstract, Jun. 1998, Retrieved from the Internet on Mar. 31, 2007, URL: <http://www.schneier.com/paper-twofish-paper.html>.
Schneier, “Applied Cryptography,” 1996, John Wiley & Sons, 2nd Edition, pp. 270-278.
Schneier, “Applied Cryptography,” 1996, John Wiley & Sons, 2nd Edition, pp. 336-339.
Schneier, “Applied Cryptography,” 1996, John Wiley & Sons, 2″d Edition, pp. 523-525.
SecuriSys, “SafenSigned makes Software Distributed over the Net Safe and Sound,” Shareware Press Release, Retrieved from the Internet on Mar. 3, 2004: URL: <http://www. dpdirectory.com/prsecuri. htm.
Sems, “The Short Version—Compression Software Saves You Time & Money,” Feb. 2002, Smart Computing, Retrieved from the Internet on Sep. 30, 2006: URL: <http://www.smartcomputing. com/editorial/ article.asp?article=articles/2002/s 1302/04s02/04s02.asp&articleid=11585&guid.
Smartphone & Pocket PC Magazine, URL: <http://www.pocketpcmag.com/_archives/mar03/zayo.asp>, Mar. 2003, vol. 6, No. 1.
Spector, “Updated WinZip Alters Zip Format,” May 30, 2003, PC World, Retrieved from the Internet on Sep. 30, 2006: URL: ttp://www.pcworld.com/article/id, 110820-page, 1/article.html>.
Stallings, W., Cryptography and Network Security: Principles and Practice, 1999, Prentice Hall, 2nd Edition, pp. 164-206 and 356-398.
Tip et al., “Practical Experience with an Application Extractor for JAVA,” Oct. 1999, ACM, p. 292-305.
Web Site Information: http://203.162.7.85/unescocourse/computervision/101.htm#10.ImageCompression, 10.1 Introduction to image compression, pp. 1-2, retrieved from internet Apr. 11, 2006.
Web Site Information: http://corsoft.com/aileron.asp, Palm Email with attachments, Corsoft, pp. 1-2, retrieved from Internet Apr. 4, 2006.
Web Site Information: http://cuteftp.com/cutezip/features.asp, GlobalSCAPE—CuteZIP, CuteZIP 2.1 Features, pp. 1-2, retrieved from Internet Sep. 9, 2003.
Web Site Information: http://cuteftp.com/cutezip/tour_ 1.asp, GlobalSCAPE—CuteZIP, Product Feature Tour: CuteZIP, pp. 1-7, retrieved from Internet Sep. 9, 2003.
Web Site Information: http://dogma.net/DataCompression/ArithmeticCoding.shtml, The Data Compression Library—Arithmetic Coding, pp. 1-4, retrieved from Internet Apr. 13, 2006.
Web Site Information: http://reviews.cnet.com/4505-3514_7-204 71822-2.html?legacy=cent&tag=dir, Globalscape CuteZip 2.1—Full review—Browsers—CNET Reviews, pp. 1-3, retrieved from Internet Sep. 9, 2003.
Web Site Information: http://www.cc.gatech.edu/-kingd/comp_links.html, Data Compression and Information Theory Links, pp. 1-2, retrieved from Internet Apr. 13, 2006.
Web Site Information: http://www.cs.duke.edu/-jsv/Papers/catalog/node63. retrieved from the Internet Apr. 13, 2006 html#HoV:ACsurvey, External Memory Algorithms, 1/0 Efficiency, pp. 1-2.
Web Site Information: http://www.cuteftp.com/cutezip/, GlobalSCAPE—CuteZIP—Compression Software, p. 1, retrieved from Internet Mar. 3, 2004.
Web Site Information: http://www.dpdirectory.com/prescuri.htm, Shareware Press Release, pp. 1-4, retrieved from Internet Mar. 3, 2004.
Web Site Information: http://www.hn.is.uec.ac.jp/-arimura/compression_links.html, Mitsuharu ARIMURA'S Bookmarks on Source Coding/Data Compression, pp. 1-12, retrieved from Internet Apr. 13, 2006.
Web Site Information: http://www.noisette-software.com/products/pocketpc/CrunchIt/, CrunchIt for Microsoft Pocket PC, pp. 1-3, retrieved from Internet Apr. 4, 2006.
Web Site Information: http://www.plexobject.com/software/plexcrypt, PlexObject Solutions, Inc., pp. 1-2, retrieved from Internet Apr. 4, 2006.
Web Site Information: http://www.pocketsoft.com/oem/overview.html, Pocket Soft, Inc.—RTPatch OEM, pp. 1-3, retrieved from Internet Nov. 12, 2001.
Web Site Information: http://www.pocketsoft.com/products.html, Pocket Soft, Inc.—Products Page, pp. 1-2, retrieved from Internet Nov. 12, 2001.
Web Site Information: http://www.pocketsoft.com/products.html, RTPatch Professional Products, pp. 1-4, retrieved from Internet Apr. 23, 1998.
Web Site Information: http://www.pocketsoft.com/unix/overview.html, Pocket Soft, Inc.—RTPatch for UNIX, pp. 1-2, retrieved from Internet Nov. 12, 2001.
Web Site Information: http://www.pocketsoft.com/vxworks/overview.html, Pocket Soft, Inc.—RTPatch for VxWorks, pp. 1-2, retrieved from Internet Nov. 12, 2001.
Web Site Information: http://www.pocketsoft.com/wince/overview.html, Pocket Soft, Inc.—RTPatch for CE, pp. 1-2, retrieved from Internet Nov. 12, 2001.
Web Site Information: http://www.pocketsoft.com/windows/overview.html, Pocket Soft, Inc.—RTPatch for Windows, pp. 1-2, retrieved from Internet Nov. 12, 2001.
Web Site Information: http://www.resco.net/pocketpc/explorer/default.asp, Resco Explorer 2005 for Pocket PC, pp. 1-2, retrieved from Internet Apr. 4, 2006.
Web Site Information: http://home.worldnet.fr/mounierr/HomePage.html, Welcome to Arjfolder Official Site, pp. 1-2, retrieved from Internet Feb. 15, 2000.
Web Site Information: http://www.cleverness.com/cleverzip/browse/explorer.html, CleverZip—Explorer View, p. 1, retrieved from Internet Feb. 15, 2000.
Web Site Information: http://www.creative.net/-acco/, Aeco Systems Presents . . . Zip Explorer Pro v2.54, p. 1, retrieved from Internet Feb. 15, 2000.
Web Site Information: http://www.knoware.com/in32docs/index.html, Internet Neighborhood FTP Client—The Premier FTP Namespace Extension for Windows, pp. 1-2, retrieved from Internat Feb. 15, 2000.
Web Site Information: http://www.knoware.com/in32docs/screenshots.html, Internet Neighborhood—the premier FTP Namespace Extension, KnoWare, Inc., Award-Winning Internet Utilities, pp. 1-3, retrieved from Internat Feb. 15, 2000.
Web Site Information: http://www.mijeniz.com/zipmagic2000.asp, ZipMagic 2000—Take the Hassle out of Zip files!, Mijenix Corporation, pp. 1-2, retrieved from the Internet Feb. 15, 2000.
Web Site Information: http://www.mijeniz.com/zm2000primer.asp, ZipMagic 2000 Compression Primer, Mijenix Corporation, pp. 1-2, retrieved from Internat Mar. 7, 2000.
Web Site Information: http://www.netexplore.de/english/features.htm, Features, FTP in a New Generation, pp. 1-2, retrieved from Internat Feb. 15, 2000.
Web Site Information: http://www.netzip.com/products/Info_Netzip_Win.html, Netzip—Award Winning Zip File, Download, and File Viewing Utilities, Netzip 5 Top Internet Programs, pp. 1-3, retrieved from Internat Feb. 15, 2000.
Web Site Information: http://www1.sprintpcs.com/media/Assets/Equipment/Handsets/pdf/samsungspi600.pdf, Sprint PCS VisionSM Smart Device SP-i600 by Samsung® User's Guide, pp. 1-182.
Web Site Information: Feldspar, “An Explanation of the Deflate Algorithm,” Aug. 23, 1997, http://www.gzip.org/deflate.html, accessed on Jan. 20, 2010.
WinAce 2.6.5, Nov. 30, 1999, E-Merge, http://winace.com.
“Winzip” Announcement Nico Mak Computing, XX, XX, 1995, pp. 1-106, XP002908148.
Winzip Computing, Inc.: “AES Encryption Information”, Internet Article, Online!, May 15, 2003, XP002296117, http://web.archive.org/web/20030618094654/http://www. winzip.com/aes info.htm.
Ziv J et al: “A Universal Algorithm for Sequential Data Compression”, IEEE Transactions on Information Theory, IEEE Inc. New York, US, vol. 23, No. 3, 1977, pp. 337-343, XP002911734, ISSN: 0018-9448.
Ziv J et al: “Compression of Individual Sequences Via Variable-Rate Coding”, IEEE Transactions on Information Theory, IEEE Inc. New York, US, vol. IT-24, No. 5, Sep. 1978, pp. 530-536, XP000565213.
PKWARE Appnote—Sep. 29, 2006.
PKWARE, “PKZIP® 6.0 for Windows Getting Started Manual” (Jan. 28, 2003).
PKWARE, “Appnote.txt,” Version 5.2 (Jun. 2, 2003).
PKWARE, “Appnote.txt,” Version 5.2.1 (Oct. 6, 2003).
PKWARE, “Appnote.txt,” Version 5.2.4 (Jan. 12, 2004).
PKWARE, “Appnote.txt,” Version 6.2.0 (Apr. 26, 2004).
Notice of Acceptance for Australia Patent Application No. 23208 / Serial No. 785475; filed Nov. 3, 2002.
European Search Report for Application No. EP 02 25 1648; dated Mar. 25, 2004.
Examination Report for European Application No. 02 251 648.8-1225; dated Apr. 8, 2005.
Summons to attend oral proceedings for European Application No. 02 251 648.8-1225; dated Apr. 27, 2007.
Decision to refuse European Application No. 02 251 648.8-1225; dated Sep. 17, 2007.
Examination Report for European Application No. 04 254 277.9-1247; dated Mar. 16, 2006.
European Search Report for Application No. EP 04 25 4277; dated Sep. 14, 2004.
Related Publications (1)
Number Date Country
20200250329 A1 Aug 2020 US
Continuations (5)
Number Date Country
Parent 16178873 Nov 2018 US
Child 16800760 US
Parent 14753888 Jun 2015 US
Child 16178873 US
Parent 13489011 Jun 2012 US
Child 14753888 US
Parent 10945292 Sep 2004 US
Child 13489011 US
Parent 10620960 Jul 2003 US
Child 10945292 US