The abstract is missing from the original file history.
`
`Sorry for any inconvenience.
`
`Ex. 1018 - Page 1 of 23
`
`Groupon, Inc.
`Exhibit 1018
`
`

`
`‘E77/O
`
`?3.B‘5”« 20/
`
`74
`
`'» UH/224280
`
`EFFICIENT CRYPTOGRAPHIC METHODS AND DEVICES
`
` 2
`
`4
`
`6
`
`7
`
`8
`
`9
`
`10
`
`11
`
`12
`
`is
`
`14
`
`15
`
`16
`
`17
`
`13
`
`19
`
`20
`
`21
`
`22
`
`23
`
`24
`
`Background of the Invention
`
`The present invention relates generally to information processing and
`
`more specifically to an efficient cryptographic system that is designed to
`
`process a large amount of information by selectively encrypting a portion
`
`of the information.
`
`It has long been recognized that information needs to be encrypted under
`
`some circumstances. For example, military messages are typically
`
`encrypted in order to prevent enemies from obtaining information
`
`contained in the message. Recently, commercial applications of
`
`encryption have been proposed. For example, several commercial
`
`software products were developed to encrypt all or a portion of the data
`
`stored on a storage device (e.g., hard disk and floppy diskette). Some of
`
`the communication software packages also allow users the option of
`
`encrypting their electronic mails. Recently, new methods for marketing
`
`information have been proposed. In one of the proposed methods,
`
`encrypted information is distributed (e.g., using CD-ROMs or via digital
`
`highway, such as the Internet) by a vendor to potential customers either
`
`free or at nominal cost. However, the customers are not provided with the
`
`key to decrypt the information. When the customers wish to purchase the
`
`Ex. 1018 - Page 2
`
`Ex. 1018 - Page 2 of 23
`
`

`
`1
`
`2
`
`3
`
`4
`
`5
`
`6
`
`7
`
`information, they need to contact the vendor to obtain the necessary
`
`decryption key. typically upon payment of fees. In another proposed
`
`method, a secure hardware is connected to the computer of a potential
`
`customer. Encrypted information (e.g., software) is distributed by a
`
`vendor to the customer either free or at nominal cost. The_secure
`
`hardware contains the necessary key for decrypting the information.
`
`When the customer uses the information, the secure hardware decrypts
`
`e
`M9’
`
`the information and measures one or more parameters (eg., time) relating
`to the usage of the information. The charges incurred by the customer is
`
`10
`
`11
`
`12
`13
`
`14
`
`15
`
`16
`
`17
`
`19
`
`19
`
`20
`
`21
`
`22
`
`23
`
`24
`
`based on these parameters. Because the decryption key and the
`
`decrypted information is never exposed to the customer, the customer has
`
`to pay each time the information is used.
`
`One of the major differences between commercial applications of
`
`encryption and other applications (e.g., military applications) is the
`
`amount of information needs to be encrypted. Typically, commercial
`
`information, such as a database or a digitized movie, may contain more
`
`than several hundred million bytes of information. On the other hand.
`
`military messages are relatively short. Another major difference is that
`
`commercial applications typically use low cost general purpose computers
`
`(such as microcomputers) to decrypt the encrypted data while military
`
`applications use high power computers specially designed for
`
`”
`
`cryptographic applications. Even though the processing power of low cost
`
`computers is expected to increase at a fast pace, these computers take on
`
`2
`
`Ex. 1018 - Page 3
`
`Ex. 1018 - Page 3 of 23
`
`

`
`more and more demanding tasks (e.g., video processing and high speed
`
`communication). As a result, the amount of processing power devoted to
`
`encryption in a commercial system may not increase with time, and in
`
`some situations, even decrease.
`
`-
`
`' Prior art cryptographic systems are mainly developed and designed for
`
`military applications, i.e., they are designed to use high power computers
`
`to handle a small amount of information. These systems may not be
`
`suitable for commercial applications. As a result, there is a need to
`
`develop an efficient method to handle commercial cryptographic needs.
`
`Summary of the Invention
`
`. Broadly stated. the present invention is a method and a signal processing
`
`device for encrypting information. Only a portion of the information
`
`needs to be encrypted because the information would not be useful if this
`
`portion is not decrypted. When the information has a low degree of
`
`correlation and error tolerance, even encrypting a small portion would be
`
`suflicient to render the information useless unless this small portion is
`
`decrypted. For information that is highly correlated, it would be difficult
`
`to take advantage of the correlation if substantially all the correlated
`
`portions are encrypted. As a result, the correlative nature of the
`
`information cannot be used to bypass decrypting the encrypted portion.
`
`1
`
`2
`
`3
`
`4
`
`5 6
`
`7
`
`8
`
`9
`
`10
`11
`
`12
`
`13
`
`14
`
`15
`
`16
`
`17
`
`18
`
`19
`
`20
`
`21
`
`22
`
`23
`24
`
`Ex. 1018 - Page 4
`
`Ex. 1018 - Page 4 of 23
`
`

`
`Brief Description of the Drawings
`
`Fig. 1 is a drawing showing one embodiment of the present invention.
`
`Fig. 2 is a drawing showing an embodiment of the present invention as
`
`applied to video information.
`
`i
`
`\
`
`Fig. 3 is a drawing showing an embodiment of the present invention
`
`where information is stored in a plurality of files.
`
`Detged Description of thejnvention
`
`It has been observed that information generally has a certain degree of
`
`redundancy. For example, the structure of many languages dictates that
`
`redundant words or letters be used at predetermined positions of a
`
`sentence. A reader can still understand the sentence if some of these
`
`words and letters are removed. For example, the grammar of the English
`
`language imposes a set of rules which includes putting the letter "s" at the
`
`end of a noun to designate plural quantity. In many sentences, the noun
`
`is not the only place where plural quantity is indicated. For example, the
`
`sentence "there are two birds" uses the word "two" to indicate the
`
`existence of more than one bird, in addition to the letter "s“ attached to
`
`the word "bird." Thus, the letter "s" at the end of the word "bird" can be
`
`omitted without affecting the meaning of the sentence. In fact, there are
`
`1
`
`3
`
`4 5
`
`6
`
`'7
`
`8
`
`9
`1o
`
`11
`
`12
`
`13
`
`14
`
`is
`
`16
`
`17
`
`is
`
`19
`
`20
`
`21
`
`22
`
`23
`
`24
`
`Ex. 1018 - Page 5
`
`Ex. 1018 - Page 5 of 23
`
`

`
`languages in this world in which noun does not have a plural form.
`
`The degree of redundancy in a certain piece of information depends on the
`
`nature of the information. At one extreme, information may contain
`
`many redundant parts. An example is video information which consists of
`
`a series of pictures depicting time progression of a scene. Each picture
`
`typically differs slightly from an adjacent picture in the series because the
`
`time difference in the scene depicted by adjacent pictures istypically less
`
`than 0.1 second. As a result, video information contains many pictures
`
`which are substantially the same. Consequently, it is easy to recreate a
`
`picture missing from the series by interpolating from the pictures prior
`
`and subsequent to the missing picture. This type of information is
`
`considered to have a high degree of temporal correlation.
`
`Video information also has another type of redundancy. The spatial
`
`variation of a picture is typically very gentle. For example, if the picture
`
`is a human swimming in water, there is little variation (in terms of color
`
`and intensity) in the portion of the picture relating to water.
`
`Consequently, it may be easy to recreate a missing portion of a picture by
`
`interpolating from portions of the picture surrounding the missing
`
`portion. This type of information is considered to have a high degree of
`
`spatial correlation.
`
`At the other extreme is information in which it is difficult to create a
`
`missing portion firom other portions. This type of information has a low
`
`1
`
`2 3
`
`4
`
`5
`
`5
`
`7
`
`3
`
`9
`
`10
`
`11
`
`12
`
`13
`
`14
`
`15
`
`16
`
`17
`
`13
`
`19
`
`20
`
`21
`22
`
`23
`
`24
`
`Ex. 1018 - Page 6
`
`Ex. 1018 - Page 6 of 23
`
`

`
`degree of correlation. An example of this type of information is the binary
`
`code of a piece of software. Typically, it is difficult to recreate a missing
`
`byte (or a series of missing bytes) from other bytes in the binary code.
`
`Information can also be classified according to its effect on intended uses
`
`if a portion of the information is missing. At one extreme is information
`
`which would be useless if a small portion is missing. An example is the
`
`binary code of a piece of software. A computer is unlikely to successfully
`
`execute the software if the binary code has a few erroneous bytes. This
`
`type of information is considered to be error intolerant. At the other
`
`extreme is information that degrades gracefully. For example, when noise
`
`of TV signal increases (i.e., portions of video information is missing or has
`
`erroneous values), color TV pictures often become ‘monochrome. However,
`
`it is still possible to watch and comprehend the TV pictures, even though
`
`they are less pleasing to the eyes. This type of information is considered
`
`to be error tolerant. Error toleration can also be different depending on
`
`spatial or temporal types of errors.
`
`It should be pointed out that even though the degree of error tolerance
`
`has some relationship to the degree of correlation of information, it does
`
`not depend solely on the degree of correlation. For example, a reader is
`
`likely to tolerate a large number of missing words in a newspaper article.
`
`On the other hand, the same reader probably would not tolerate the same
`
`percentage of missing words in a poem. Thus, even though the degree of
`
`6
`
`1
`
`2
`
`3
`
`4 5
`
`6
`
`7
`
`9
`
`9
`
`10
`
`11
`
`12
`
`13
`
`14
`
`15
`
`15
`
`17
`18
`
`19
`
`20
`
`21
`
`22
`
`23
`
`24
`
`Ex. 1018- Page 70
`
`Ex. 1018 - Page 7 of 23
`
`

`
`i
`
`2
`
`3
`
`4
`
`5
`
`6
`
`7
`
`9
`
`10
`
`11
`
`12
`
`is
`
`14
`
`is
`
`16
`
`17
`
`18
`
`19
`
`20
`
`21
`
`22
`
`23
`
`24
`
`correlation of the newspaper article and poem may be the same (because
`
`they follow essentially the same grammar rules), the degree of error
`
`tolerance is different. This is because error tolerance depends, to a
`
`certain extent, on subjective considerations. As another example, a
`
`person typically does not tolerate a small distortion in a familiar song
`
`while may tolerate a large distortion in a new song, even though the
`
`degree of correlation of these two songs are the same.
`
`In the prior art cryptographic systems, every bit of information is
`
`encrypted. One aspect of the present invention is the realization that it
`
`may not be necessary to completely encrypt the information, especially
`
`when it has a low degree of correlation. This is because it is often difficult
`
`to recreate the encrypted portion of information (if it cannot be decrypted)
`
`based on the clear portion of information. In addition, information that
`
`has a low degree of error tolerance may only need to be encrypted at a few
`
`critical places (e.g., the destination address of a jump op code, or the last
`
`name field of a customer database). This is because a user would not
`
`accept the information if a small portion is missing or erroneous. Thus,
`
`even though most of the information is in the clear, it is still not
`
`commercially useful if isolated portions are unavailable because they
`
`cannot be decrypted (i.e., people are still willing to pay a high price to
`
`obtain the full information, even though they already have 99 percent of
`
`the information). Since only a small portion of information need to be
`
`decrypted, the amount of computation power required to decrypt the
`
`7
`
`Ex. 1018- Page 80
`
`Ex. 1018 - Page 8 of 23
`
`

`
`1
`
`3
`
`4
`
`5
`
`6
`
`7
`
`3
`
`9
`
`10
`
`11
`
`12
`
`13
`14
`
`15
`
`16
`
`17
`
`19
`
`is
`
`20
`
`21
`22
`
`23
`
`24
`
`information is reduced.
`
`Encrypting a portion of information may also help to reduce the
`
`computation power required for other signal processing tasks. As an
`
`example, information which is massive and highly correlated (e.g., video
`
`information) is often compressed in order to reduce the amount of memory
`
`space used for storing and the bandwidth used for transmitting the
`
`information. Many compression methods make _extensive use of the
`
`correlative nature of information. However, many encryption methods
`
`have a tendency to randomize information. For example, if the plain text
`
`is a string of identical letters, the encrypted text using algorithms such as
`
`DES may be a string of letters in which every letter is different.
`
`Consequently, it may be more difficult to compress the encrypted text.
`
`The word "encryption" is used broadly in the present invention to include
`
`different ways of transforming information so that it is difficult for an
`
`unauthorized person to correctly understand the information. It includes
`
`transformation in which a key is required, such as public key and secret
`
`key encryption methods. It also includes scrambling information
`
`according to a secret algorithm without using a particular parameter
`
`which may be classified as a "key."
`
`The word "information" is used broadly in the present invention to include
`
`data that is organized in some logical manner. Examples of information
`
`Ex. 1018- Page 90
`
`Ex. 1018 - Page 9 of 23
`
`

`
`include video signal, audio signal, picture, computer software, text,
`
`database, and multimedia composition.
`
`Fig. 1 is a diagram showing one embodiment in which information having
`
`a low degree of correlation is processed with a signal processor 20 of the
`
`present invention. Fig. 1 shows the portion of information 12 containing
`
`sixteen pieces of plain text which are grouped into four blocks B1, B2, B3
`
`and B4. Each block contains four pieces of plain text labeled as P1, P2,
`
`P3, and P4. Each of these sixteen pieces could contain a single bit or a
`
`plurality of bits. It should be pointed out that the above grouping is
`
`exemplary, and any number of pieces could be grouped into any number
`
`of blocks. In addition, it is not necessary to require every block to have
`
`the same number of pieces,
`
`Processor 20 contains a program stored in memory, such as ROM 22. This
`
`program is executed by a CPU 24. The program stored in ROM 22 could
`
`be any program that can selectively encrypt some of the pieces of plain
`
`text in information 12. Preferably, an algorithm should be chosen such
`
`that it is difficult for an unauthorized person to determine which pieces
`
`are selected for encryption. Any encryption method can be used by
`
`processor 20.
`
`An exemplary program in ROM 22 is described below. The pieces in the
`
`blocks having an odd numeral in their label, e.g., B 1 and B3, are not
`
`1
`
`2
`
`3 4
`
`5
`
`6
`
`7
`
`3
`
`9
`
`10
`
`11
`
`12
`
`13
`
`14
`
`15
`
`15
`
`17
`
`13
`
`19
`
`20
`
`21
`22
`
`23
`
`24
`
`Ex. 1018- Page 100
`
`Ex. 1018 - Page 10 of 23
`
`

`
`1
`
`2
`
`3
`
`4
`
`5
`
`5
`
`7
`
`3
`
`9
`
`10
`11
`
`12
`
`13
`
`14
`
`15
`
`16
`
`17
`
`18
`
`19
`
`20
`
`21
`
`22
`
`23
`
`24
`
`encrypted. They provide the "base" for selecting one or more pieces in the
`
`subsequent blocks (i.e., blocks B2 and B4) for encryption. For example,
`
`the selected piece in block B2 can be calculated from the pieces in block
`
`B1 by adding the number of bits in all the pieces of block B1. and takes
`
`the remainder after dividing by four. It should be pointed out that the
`
`blocks used as base do not have to be adjacent to the blocks having pieces
`
`selected for encryption (e.g., the block B1 can be used to determine the
`
`selected piece in block B4). In addition, the pieces of more than one blocks
`
`can be used as base (e.g., blocks B1 and B3 can be used to determine the
`
`selected piece in block B2).
`
`V In Fig. 1, it is assumz-5-11\that the third piece ofblock B2 is selected (using
`
`the above described formula) for encryption. This piece is encrypted and
`
`is labeled as E3 in the encrypted information 40. Similarly, the fourth
`
`piece of block B4 is assumed to be selected (using the above described
`
`formula) for encryption and is labeled as E4. The selection of the third
`
`piece in block B2 and the fourth piece in block B4 should appear as
`
`random selection to persons who do not known the above formula.
`
`The decryption process is now described. Since blocks B1 and B3 are not
`
`encrypted, the "base" is not change by processor 20. Consequently, the
`
`above formula can be used by processor 30 to determine which pieces in
`
`blocks B2 and B4 are encrypted. As a result, processor 30 can decrypt the
`
`selected pieces and the original information 12 can be recovered.
`
`10
`
`EX. 1018- Page 11
`
`Ex. 1018 - Page 11 of 23
`
`

`
`2
`3
`
`4
`
`5
`
`s
`
`7
`
`8
`
`9
`10
`
`11
`
`12
`
`13
`
`14
`
`15
`
`16
`17
`
`18
`
`19
`
`20
`
`21
`
`22
`
`23
`
`24
`
`Because information 12 has a low degree of correlation, it would be
`diflicult to create pieces P3 in block B2 and P4 in block B4 by
`
`interpolating information contained in other pieces if E3 and E4,
`
`respectively, are not decrypted. However, if information 12 is highly
`
`correlated, it may be possible to create pieces P3 in block B2 and P4 in
`
`block B4 by using information contained in the other pieces without
`
`decrypting E3 and E4. Methods to render such creation difficult even for
`
`highly correlated information will be discussed below.
`
`The ratio of the number of encrypted pieces to the number of plain text
`
`pieces is determined by the error tolerance of the information. Ifthe error
`
`tolerance is low (i.e., it is unacceptable to miss a small amount of
`
`information), only a small number of pieces need to be encrypted. On the
`
`other hand, if the error tolerance is high, it may be necessary to encrypt a
`
`larger number of plain text pieces.
`
`Fig. 2 is a diagram showing one embodiment in which information having
`
`a high degree of correlation, such as video information 110, is processed
`
`with a signal processor 130 of the present invention. Only three frame
`
`112, 114 and 116 of video information 110 are shown, although video
`
`information 110 typically contains a large number of frames. Frames 112,
`
`114, and 116 have a centrally located region 122, 124, and 126,
`
`respectively, which are of the same size and shape. Only these regions
`
`11
`
`EX. 1018- Page 12
`
`Ex. 1018 - Page 12 of 23
`
`

`
`are encrypted while the rest of the frames are in the clear. Since the area
`
`of each of these regions are small compared to the size of a full frame, the
`
`amount of encryption and decryption is reduced.
`
`The frames 112, 114, and 116 are processed by signal processor 130 which
`
`contains memory (such as ROM 132) and a CPU 134 for storing and
`
`1
`
`processing the algorithm of the present invention. Signal processor 130
`
`generates encrypted video information 150 with three frames 152, 154,
`
`and 156, each corresponding to frames 122, 124, and 126, respectively.
`
`Frames 152, 154, and 156 contain encrypted regions 162, 164, and 166,
`
`respectively, which are resulted from encrypting regions 122, 124, and
`
`126, respectively.
`
`1
`
`2
`
`3
`
`5
`
`6
`
`7
`
`a
`
`9
`
`10
`
`11
`
`12
`
`13
`
`_
`
`14
`
`The encrypted video information 150 can be decrypted using a decryption
`
`15
`
`16
`
`17
`1e
`
`19
`
`20
`
`21
`
`22
`
`23
`
`24
`
`processor 140. Because the location, size and shape of the encrypted
`
`region in each frame is predetermined, processor 140 is able to find the
`
`encrypted regions and decrypt them accordingly.
`
`In this embodiment, the same region of all the frames (i.e., for all times
`
`from beginning to end) are encrypted. Thus, it is not possible for an
`
`unauthorized person to take advantage of temporal correlation because
`
`there is no unencrypted data of the region for all times. It is also difficult
`
`to take advantage of spatial correlation near the center of the frame
`
`because there is little unencrypted data available at areas surrounding
`
`12
`
`Ex. 1018- Page 130
`
`Ex. 1018 - Page 13 of 23
`
`

`
`the center. The reason for positioning the encrypted region at the center
`
`is to take advantage of the fact that the most informative area of a picture
`
`is usually the center.
`
`The method disclosed in Fig. 2 encrypts substantially all the correlated
`
`portions of the information. Since almost none of the correlated portions
`
`are in the clear, it is impossible to bypass the correlated portions by using
`
`techniques such as interpolation.
`
`The size of the regions 122, 124 and 126 depends on the degree of error
`
`tolerance. If spatial error tolerance is low (i.e., a user will not tolerate
`
`even a small amount of erroneous spatial information), the size of the
`
`regions 122, 124 and 126 could be small. Further, for situations where
`
`temporal error tolerance is low, it is not necessary to encrypt all the
`
`frame.
`
`It may be advantageous to encrypt several regions (instead of only one
`
`centrally located region). This is because the most informative region
`
`may not be located at the center. Further, the size and shape of the
`
`encrypted regions may vary from frame to frame. The only requirement is
`
`to incorporate the same or a similar set of region selection rules in
`
`processor 130 and processor 140.
`
`In digital applications, information is preferably organized into one or
`
`more files. If the size of information is small, it could be stored in one file.
`
`1 3
`
`1
`
`2
`
`3
`
`4
`
`5
`
`6
`
`7
`
`3 9
`
`10
`
`11
`
`12
`
`13
`
`14
`
`15
`
`16
`
`17
`
`18
`
`19
`
`20
`
`21
`22
`
`23
`
`24
`
`EX. 1018- Page 14
`
`Ex. 1018 - Page 14 of 23
`
`

`
`1
`
`2
`
`3
`
`4
`
`5
`
`6
`
`7
`
`a
`
`9
`
`1o
`
`11
`
`12
`
`13
`
`14
`
`is
`
`16
`
`17
`
`18
`
`19
`
`20
`21
`
`22
`
`23
`
`24
`
`However, if the size of information is large, it may be stored in a plurality
`
`of files. Fig. 3 shows a plurality of files 212-217 in a medium 210.
`
`Examples of medium 210 are magnetic storage, optical storage, RAM, and
`
`communication channel. Files 212-217 could be organized serially or in
`
`other formats._ The files relating to the information may be linked in well
`
`known manners. For example, file 212 is linked to file 215 through a link
`
`222; file 215 is linked to file 216 through a link 223; and file 216 is linked
`
`to file 213 through a link 225. Alternatively, no link isneeded if the files
`
`are organized sequentially. Links 222, 223, and 225 could be stored
`
`inside files 212, 2 15, and 216, respectively. Alternatively, information
`
`relating to the links can be stored in other locations. such as a separate
`
`file 230.
`
`If one or more of the files 212, 213, 215, and 216 are totally or partially
`
`encrypted, the information stored in these files may be commercially
`
`useless. Consequently, there may not be a need to encrypt all the files.
`
`Even iffiles 212, 213, 215, and 216 are in the clear, the information may
`
`be useless if the links are encrypted. This is the case if the size of each file
`
`is small and the number of links is large, i.e., it would be very difficult to
`
`organize the information without the links.
`
`While the invention has been particularly described, it will be apparent to
`
`those skilled in the art that the disclosed invention may be modified in
`
`numerous ways and may assume many embodiments other than that
`
`14
`
`Ex. 1018- Page 150
`
`Ex. 1018 - Page 15 of 23
`
`

`
`1
`
`2
`
`3
`
`specifically set out and described above. It is intended by the appended
`
`claims to cover all modifications which falls within the true spirit and
`
`scope of the invention.
`
`15
`
`EX. 1018- Page 16
`
`Ex. 1018 - Page 16 of 23
`
`

`
`2
`
`_ WHAT IS CLAIMED IS:
`
`1.
`
`A method of encrypting a file comprising the step of
`
`encrypting only a portion of said file.
`
`2.
`
`The method of Claim 1 wherein said file includes a first and
`
`a second block of bits, said first block being unencrypted and said second
`
`block further including at least two sub-blocks, said encrypting step
`
`comprising the steps of:
`
`selecting at least one of said sub-blocks based on saidihit of said
`first block, and
`""’/
`
`encrypting said selected sub-block.
`
`The method of Claim 2 wherein said file includes a serial
`3.
`stream of data, and said first and said second blocks being a portion of
`
`said serial stream of data.
`
`4.
`
`The method of Claim 1 wherein said file contains at least one
`
`set of data having a correlative relationship, and wherein said encrypting
`
`step comprises the step of encrypting substantially all said set of
`
`correlative data.
`
`5.
`
`A method of encrypting video information comprising the
`
`16
`
`4
`
`5
`
`6 7
`
`a
`
`9
`
`10
`
`11
`12
`
`13
`14
`
`15
`16
`
`17
`
`18
`
`19
`
`20
`
`21
`
`22
`
`23
`
`24
`
`"
`
`i‘
`
`Ex. 1018- Page 170
`
`Ex. 1018 - Page 17 of 23
`
`

`
`step of encrypting only a portion of said video information.
`
`6.
`
`The method of claim 5 wherein said video information
`
`includes a first frame followed by a second frame, said encrypting step
`
`comprising the steps of:
`
`encrypting a portion of said first frame; and
`
`encrypting a portion of said second frame which is located at
`
`substantially the same position as said portion of said first frame.
`
`7.
`
`The method of Claim 6 wherein said portions of said first and
`
`said second frames are substantially centrally located.
`
`8.
`
`The method of Claim 5 wherein said video information
`
`includes a plurality of frames, and wherein said encrypting step
`
`comprises the step of encrypting substantially all of said plurality of
`
`frames at a substantially identical region.
`
`9.
`
`A method of encrypting information contained in a plurality
`
`offiles connected by links comprising the step of keeping at least one of
`
`said files and links unencrypted.
`
`1
`
`3
`
`4
`
`5
`
`5
`
`7
`
`a
`
`9
`
`1o
`
`11
`12
`
`13
`
`14
`
`15
`
`16
`17
`
`13
`
`19
`
`20
`21
`
`17
`
`Ex. 1018- Page 180
`
`Ex. 1018 - Page 18 of 23
`
`

`
`«TENT APPLICATION AND POWER OF A":
`COMBINED DECLARATION F0-.
`unaugu ltglotenel to PC? international Aool-catuonat
`
`. ..RNEY
`
`A5 3 below named inventor. I hereby declare that:
`
`My residence. post office address and citizenship are as stated below next to my name.
`I believe I am the original. First and sole inventor (if only one name is listed below) or an original. first and joint
`inventor (if plural names are listed below) of the subject matter which is claimed and for which a patent is sought
`on the invention entitled:
`‘ ~
`_
`.
`_
`Efltciegf Crygjoacnphm !fl£thOJl‘ gm ix»/tge;
`
`the specification of which (cheek only one item below}:
`
`3 is attached hereto.
`
`D was filed as United States application
`Serial No.
`
`on
`
`and was amended
`
`00
`
`D was filed as PCT international application
`Number
`
`On
`
`and waslamended under PCT Article I9
`Oil
`
`I have reviewed and understand the contents of the above-identified specification. including
`l hereby state that
`the claims. as aniendedby any amendment referred to above.
`.
`
`I acltnowlege the duty to disclose information which is material to the examination of this application in
`accordance with Title 37, Code of Federal Regulations. §l.56(a).
`
`I hereby claim foreign priority benefits under Title )5. United States Code. 5| I9 of any foreign applicationlsl
`for patent or inventor's certificate or of any PCT international applieationlsl designating at
`least one country
`other than the United States of America listed below and have also identified below any foreign appliationlsl -
`for patent or inventor’) certificate or any PCT international applicationls) designating at least one country other
`than the United States of America riled by me on the same subject matter having a filing date before that of the
`applicaiionlsl of which priority is claimed:
`
`"" 'lI'‘Iv -9 III
`
`,
`
`rum:
`
`in oeeanvtaurovaon-anva:ao---er-no--on-in
`
`(January I99!)
`
`EX. 1018- Page 19
`
`Ex. 1018 - Page 19 of 23
`
`

`
`
`
`Cotrthlmd Declaration For hum Application and Power oi Attorney (Continued)
`Iheluuoa Relevance to PCT trttomattomhlut-tttuttonal
`
`
`
`I hereby claim the benefit under Title 35. United States Code. 5120 of any United States applleationlal or PCT
`international applicationlsl designating the United States of America that is/are listed below and. insofar as the
`iltbjccl matter or each of the claims of this application is not disclosed in that/those prior applieationltl in the
`manner provided by the rllll paragraph of Title 35. United States Code. {I I2. I acltttowlege the duty to disclose
`material information as defined in Title 37. Code of Federal Regulations. §l.56(a) which occurred between the
`Filing date of the prior applieatiutttsl and the national or PCT international filing date of this application: i
`
`
`
`
`
`I-llflilfl HOW!
` :
`
`
`
`
`
`I hereby anoint lieu lotloavino Ilwmtvlll Indlor locum) to IIIIIIIIIIII
`POWER OF ATTORNEY: A: a named imernnv.
`thinanolieaaiovtattdtnneactallbuainnaintttoPatemutdTredemartOt1leeeotvueudttunwltat,(l1atnuruutdngtnu-
`tlonttuntull
`
`
`
`
`
`ate; g.S‘.:A°l’PL|CATION5 on PCT INTERNATIONAL apnucmous DISIGNATING me u.s. son BENEFIT uuoen
`"5 *"W*'°~S
`
`Direct Tateohorte Calls to:
`him!
`
`Howl C\M\I\
`
`
`
`t’-l-0?) 237$"? 273‘
`
`
`"W" CHAN
`
`
`cumw
`"2.”'=°~;'r
`comma.
`we-.:.= n Delve
`
`
` fl
`
`
`mi
`
`men
`
`
`
`
`
`
`
`
`
`eI
`e I
`
`f“
`
`hereby declare that all statements made herein of my own knowledge In: true and that all statements nude on
`ittfonn.-ttion and belief are believed to be true: and further that these statements were made with the knowledge
`that willful false statements and the like so made are punishable by fine or imprisonment. of both. under section
`tool of Title ll of the United States Code. and that tuch willful false statements may jeopardize the validity of
`the application or any patent issuing thereon.
`
`
`
`
`I
`
`1
`
`IT
`l
`°‘" we l, new i—
`
`
`Hg um‘. ton.
`up 1.41
`us taevauttnutucaatlfl-Puevuevteflunltanvfl-a
`
`
`
`
`EX. 1018 - Page 20
`
`Ex. 1018 - Page 20 of 23
`
`

`
`kwv - -«Jog
`~
`;,§~~;;
`
`4
`
`Rwtsm AND HANDLING or MAIL AND PAPER?
`
`50933
`rrorsa/o9 (ma)
`
`'3
`’
`
`9
`
`" " "'
`V
`
`_
`
`F.__'‘
`
`'‘ VERIFIED STATEMENT CLAIMING SMALL ENTITY STATUS
`(37 CF}! 1.9(f) &: 1.27(b))--INDEPENDENT INVENTOR
`
`Docket Number (Optional)
`
`Applicant0I'Pal.cntee: HHML
`Serial or Patent No.:
`
`CHHN
`
`Filedorlssued:
`1'.ue;E fc.
`
`‘t Cr
`
`+9
`
`I.
`9.
`
`‘
`
`__
`
`fotf
`
`n
`
`ievlmf
`
`As a below named inventor. I hereby declare that I qualify as an independent inventor asdefmed In 37 CFR l.9(c) for
`purposes of paying reduced fees to the Patent and Trademark Office described in:
`'
`
`the specification filed herewith with title as listed above.
`D the appliation ideudfiod above.
`D the patent identified above.
`lhavenotassiznect granted. conveyed orlicensuland am undernoohligatian underconn-actor 13Wl0&S$i8D. gram.
`convey or license. any rights in the invention In any person who would not qualify as an indepentknt inventor under 37
`CPR 1.9(c) illlnt person had made the invmtion. one any concern which would notqualify as asznall business
`concern unda 37 CFR l.9(d) or a naiprnllt organization under 37 CW. l.9(e).
`
`Each person. concern or organinllm to which I have assigned. granted. emveyed. or licensed in am under an obliga-
`tion under contract or law to assign. grant. convey. or license any rights in the invention is listed below:
`
`[2] No such person. concern, or organization exists.
`B Each such person. concern or organiralicn is listed below.
`
`Separate verified statunents are required from each named person. eencern or organization having rights to the inven-
`tion avm-irtg to their status as small entities. (37 CFR 127)
`
`lecknawledge the duty to tile. in this application or patazt. notification orany change in status resulting in loss of
`titlunent to small entity status prior to paying, Kl’ at the time of paying, the earliest nfthe issue tee ornny mainte-
`nance lee due after the date on which status as a small entity is no longer Bllmprinte. (37 CFR l.z8(h))
`
`lherehydeclarethatallstatemenumadehexelnofmyownlcnowledgenretmenndthualluatnnenumadeoninfama
`tionlndbeliettuebeBevedtobewe;nndfin\hathaImesestat¢menuwuemndewifl:theh1cwledgethntvillfulfnlae
`suunmuendmeukemmadeuept:nishahuhyfinemnnprismmenLahom.und¢smnonlool o{'l'itlel8otthe
`UnitedStnlesCode.andtImsndrwfllrmmseuatanentsmayjeupuuizethevalldlryoruwnppucatiommypment
`issuitlgIhaeou.oranypatenIwwhidlthisvaifledItalanmtisdilec1ed.
`
`Haul (- C hgn
`NAMEOPINVBNKUR
`
`NAME or nrvtmnx
`
`NAME or INVENTOR
`
`Signm of invent»:
`Due
`
`Signnnne orinventor
`Date
`
`Sigma: orinventor
`Due
`
`PTOISBI 09 (10-91)
`
`I
`
`5C0 - 15
`
`.
`
`Pnlent ufl Tnttmuk Offla: US. DEPARTMENT OF COMMERCE
`Rev. 14, Nov. 1992
`
`Ex. 1018 - Page 21 o
`
`Ex. 1018 - Page 21 of 23
`
`

`
`cummmmHm
`
`em.mmmm.HmamMMwmam
`emmmmmHm..
`
`H..O—.m
`
`_
`
`81O1X.E
`
`22e9aP
`
`6WWMDMT.W
`AS ORIGINALLY map
`
`0 6
`
`OSBVZZ/W
`
`Ex. 1018 - Page 22 of 23
`
`
`

`
`EX. 1018 - Page 23
`
`PRINT OF DRAWINGS
`AS 0RIGINALI,_Y__I-'I1.ED
`
`8F
`
`.‘ \
`
`ugzvzz/m
`
`Ex. 1018 - Page 23 of 23