Classifications

• • G—PHYSICS
  • G06—COMPUTING; CALCULATING OR COUNTING
  • G06F—ELECTRIC DIGITAL DATA PROCESSING
  • G06F7/00—Methods or arrangements for processing data by operating upon the order or content of the data handled
  • G06F7/58—Random or pseudo-random number generators
  • G06F7/582—Pseudo-random number generators
• • H—ELECTRICITY
  • H04—ELECTRIC COMMUNICATION TECHNIQUE
  • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
  • H04L9/00—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols
  • H04L9/06—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols the encryption apparatus using shift registers or memories for block-wise or stream coding, e.g. DES systems or RC4; Hash functions; Pseudorandom sequence generators
  • H04L9/065—Encryption by serially and continuously modifying data stream elements, e.g. stream cipher systems, RC4, SEAL or A5/3
  • H04L9/0656—Pseudorandom key sequence combined element-for-element with data sequence, e.g. one-time-pad [OTP] or Vernam's cipher
  • H04L9/0662—Pseudorandom key sequence combined element-for-element with data sequence, e.g. one-time-pad [OTP] or Vernam's cipher with particular pseudorandom sequence generator
• • H—ELECTRICITY
  • H04—ELECTRIC COMMUNICATION TECHNIQUE
  • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
  • H04L2209/00—Additional information or applications relating to cryptographic mechanisms or cryptographic arrangements for secret or secure communication H04L9/00
  • H04L2209/20—Manipulating the length of blocks of bits, e.g. padding or block truncation
• • H—ELECTRICITY
  • H04—ELECTRIC COMMUNICATION TECHNIQUE
  • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
  • H04L2209/00—Additional information or applications relating to cryptographic mechanisms or cryptographic arrangements for secret or secure communication H04L9/00
  • H04L2209/60—Digital content management, e.g. content distribution
  • H04L2209/608—Watermarking

Definitions

• the present invention relates generally to steganographic methods of encoding digital data for secure transmission or storage of information.
• the invention also relates to complementary decoding methods and to a method of generating a pseudo-random number sequence using any digital file.
• the pseudo-random number sequence may be used in the steganographic encoding or decoding methods.
• the encoding method is especially suited to digital camouflaging or steganography for confidential information such as text, audio, still image or video data, and it will be convenient to describe the method in relation to that example application. It should be appreciated, however, that the encoding method is intended for broader application and use.
• the method of generating a pseudo-random number sequence may be used in applications other than steganography applications.
• Patent 5,659,726 to Sandford and Handel discloses methods to impress an identification code on a carrier, such as an electronic data signal or a physical medium, in a manner that permits the identification code to be later discerned and the carrier thereby identified.
• Sandford and Handel disclose a method of embedding auxiliary information into host data, such as a photograph, television signal, facsimile transmission, or identification card. The method operates by manipulating a noise component of the host data in accordance with the auxiliary information.
• a steganographic encoding method which may allow a relatively long string of secondary data (such as text, image, audio or video data) to be encoded using primary data (such as text, image, audio or video data) without degradation of the primary data.
• This seed may be a number, a bit-stream, a digital file or any other form of data.
• Typical random number generators use hashing functions for example, SHA (secure hash algorithm), as in US Patent Number 5,787,179 awarded to Microsoft Corporation (1998), and US Patent Number 5,732,138 awarded to Silicon Graphics Inc. (1998).
• SHA secure hash algorithm
• the present invention provides a method of generating a pseudo-random number sequence including the steps of: providing source data including an ordered plurality of data elements, the content of each data element being represented by a group of digits; reading the groups of digits into an array such that each position in the array contains one of said digits; selecting a starting position within the array of digits; and regrouping said digits to form new groups of digits with reference to the starting position, such that each new group represents a pseudo-random number and successive new groups represent said pseudo-random number sequence.
• each data element of the source data are represented in binary notation and the content of each data element is preferably represented by a byte (ie. 8 bits).
• each bit of each 8-bit byte constitutes a digit which may be read into a bit array such that each position in the array contains one bit.
• the starting position may be selected randomly, pseudo-randomly or in a pre-defined manner. Based on that starting position the bits are regrouped into new groups of preferably eight bits, each new group constituting a new byte of information. In this way, each new byte represents a pseudo-random number which bears no numerical relationship to numerical values of the data elements of the source data.
• the term "pre-defined” as used throughout this specification refers to that which is defined or can be defined by a user or by the program.
• the source data may be obtained from a digital file available in the public domain, a private database, or any digital storage medium (DSM).
• the file may represent a text sequence, an image, an audio sequence, a video sequence, a graphics representation, a computer program, or any accessible digital data.
• the present invention uses the whole or part of a digital file.
• the contents of digital files can be considered as random depending on the location selected for the starting position and how the bits are grouped.
• the same digital file with different starting positions and grouping methods will generate completely different pseudo-random number sequences.
• Different digital files with the same starting position and the same grouping method will also generate completely different pseudo-random number sequences.
• This has the distinct advantage that it is able to regenerate the same sequence of pseudorandom numbers as long as the same digital file, the same starting position, and the same grouping method are used. Since this method is not based on any mathematical formula, there is no way of obtaining the same sequence of random numbers without knowing the source file, the starting position, and the grouping method.
• the pseudo-random number sequence is stored for use in a steganographic data encoding or decoding method, a cryptographic encoding or decoding method, or for any other purpose requiring a sequence of random numbers.
• the present invention provides an encoding method including the steps of: providing primary data including an ordered plurality of first data elements; providing secondary data including a plurality of second data elements; and for each second data element
• the encoding method includes, prior to performing said operations, a step of rearranging the first data elements of the primary data.
• a plurality of techniques for rearranging the first data elements may be available and a selection may be made from the plurality of techniques. The selection may be made randomly or pseudo-randomly, or by a user.
• the first data elements may be rearranged in a predefined manner or in a random or pseudo-random manner. Alternatively, or additionally, similar rearranging steps may be performed on the second data elements of the secondary data.
• the primary data is in the form of a primary data array containing the first data elements and the secondary data is in the form of a secondary data array containing the second data elements.
• the encoding method may include a step of resizing the primary data array to match the size of the secondary data array. If the secondary data array is smaller than the primary data array, the primary data array may be truncated to match the size of the secondary data array. If the secondary data array is larger than the primary data array, first data elements of the primary data array may be repeated so as to increase the size of the first data array to match that of the secondary data array. In an embodiment including a rearranging step as well as a resizing step, the repeated first data elements may be rearranged according to techniques other than the technique selected for rearranging the first group of first data elements.
• each group of multiplied first data elements need not necessarily be rearranged according to the same technique as the first group of first data elements.
• each repeated group may be arranged according to a different technique.
• the operation to be performed between the first and second data elements may include a mathematical operation, a logical operation, a mapping function, or any other operation which serves to generate key elements as a result of the operation.
• a plurality of operations is available and a selection is made from the plurality of operations. The selection may be made randomly or pseudo-randomly, or by a user.
• the encoding method may generate a string of key elements which is associated with a corresponding string of second data elements.
• Unique key data which is generated for given primary and secondary data, may be stored for use in a complementary decoding method, as described below.
• the key elements are stored in a key file, which may then be O 00/25203
• information about the encoding process is also stored in the key file.
• This information may be stored within a header or attribute section of the key file.
• An attribute section may be positioned anywhere in the key file, not necessarily at the beginning.
• the source, primary, secondary and key data mentioned above may be represented in digital binary form. However, any form of data representation or notation, using any convenient set of symbols, may be used, eg. alphanumeric characters, integer numbers, etc.
• the primary data may represent or be derived from a still image, motion video, audio, text or other type of information.
• the secondary data may represent a still image, motion video, audio, text or other information.
• the secondary data includes a text message and each second data element includes an alphanumeric character.
• each secondary data element may include a character from another character set.
• the alphanumeric characters may be used to compose the text message.
• the text message may include confidential information relating to an image, a video or an audio sequence contained in the primary data.
• the text message may include one or more of the following: a title, an artist, a copyright holder, a body to which royalties should be paid, and general terms of publisher distribution.
• the text message may be a confidential message, a representation of an image, a representation of an audio sequence, or a combination of the above.
• the primary data may represent a text message, a still image, an audio sequence, a motion video segment, general multimedia data, a graphics file, a complete program, or any other accessible digital data that can be retrieved from the public domain, such as an Internet website, a private database, the random access memory or buffer of a computer, or any digital storage medium.
• the first data elements of the primary data may be arranged in an array.
• Each first data element may define a characteristic associated with a still image element.
• the first data elements may be obtained from a stream of data representing a digitised still image.
• the image may be obtained from an Internet web site, a digital camera, a computer game, computer software or other source. It may be a greyscale or color image (wherein each first data element defines a grey level or colour component, for example) and may be stored in any known format, eg. BMP, GIF, TIFF, or JPEG.
• each first data element may define a characteristic associated with a motion video element.
• the first data elements may be obtained from a stream of data representing digitised motion video.
• the digitised video may be obtained from an Internet web site, a Video Compact Disc (VCD) player, a Laser Disc (LD) player, a computer game, computer software, a Digital Versatile Disc (DVD) player or other source, and may be stored in any known format, eg. MPEG or AVI.
• each first data element may define a characteristic associated with a digital audio sample.
• the digital audio samples may be obtained from a stream of data representing digitised sound or music.
• the digitised sound may be obtained from an Internet web site, a Compact Disc (CD) player, Digital Audio Tape (DAT) player, Laser Disc player, Video Compact Disc (VCD) player or other source, and may be stored in any known format eg. WAV, AIFF, MIDI, etc.
• the digital audio samples are obtained from two streams of data representing two channels of digitised sound for stereo reproduction.
• the primary data includes a random or pseudo-random number sequence.
• the still image, motion video or audio data mentioned in the preceding three paragraphs may be used as source data for generating a pseudo-random number sequence according to the method described above. That number sequence, based on the original image, video or audio data, may then be used as primary data in the encoding method of the invention.
• the primary data may be obtained from a conventional random-number generator or other suitable source.
• the present invention provides a method of decoding secondary data including a plurality of second data elements, said secondary data being encoded in a plurality of key elements such that each key element is generated by an operation performed with a respective first data element of primary data, said method including the steps of: providing said primary data including an ordered plurality of said first data elements; providing said plurality of key elements; for each key element, generating a corresponding said second data element by performing an inverse of said operation.
• the present invention has the distinct advantage that long sentences of text, large amounts of data of any form, e.g. images, audio, video, or any binary files, may be encoded and subsequently decoded in confidence.
• any form of data e.g. images, audio, video, binary files, digital bit patterns
• the integrity of the primary data is never affected or compromised in any way.
• the primary data may be transmitted by any means e.g. by mail, e-mail, telephone, fax, ftp, http, dial-up networking, local area network, wide area network, Internet, Intranet,
• Extranet or by any other electronic means.
• the data can also be retrieved from any storage medium, such as hard disk, floppy disk, zip disk, CD ROM, DAT,
• VCD VCD
• DVD VCD
• the primary data since the primary data is never modified, there is no need to re-send the primary data for every message. Only the key data has to be sent. Therefore, this method results in lower bandwidth usage and faster transmission via a communication channel when compared to any existing steganographic or watermarking technique.
• the primary or source data when access to open or stored data, eg. Internet, CD ROM, VCD or DVD, etc., is restricted or limited at the receiving end of the transmission channel, the primary or source data (in whole or in part) may also be sent as part of the key file.
• This embodiment of the invention offers a lower level of security but may be preferred by some users for its convenience.
• a password or other protection may be implemented in conjunction with the invention.
• This embodiment of the invention can then form part of a larger system for transmitting confidential information.
• Figure 2 shows a flow-chart of a preferred embodiment of the invention incorporating a two-part steganographic encoding method
• Figure 3 shows an example of rearranging a primary data file for use in the steganographic encoding method
• Figure 4 shows an example of a mathematical operation
• Figure 5 shows an example of a logical XOR operation between primary and secondary data
• Figure 6 shows an example of a 1:1 mapping operation
• Figure 7 shows an example of the steganographic encoding method performed on a password.
• a preferred embodiment of the invention uses source or primary data, such as a still image, motion video, audio, text or other data, to steganographically encode secondary data, such as a data file containing confidential information.
• the confidential information may likewise include a still image, motion video, audio, text or any other type of data.
• the encoding process generates unique key data representing the secondary data in an encoded form.
• One embodiment of the invention includes two main processes. The first main process uses source data, such as a still image, motion video, audio, text or other data, to generate an array containing a pseudo-random number sequence. That array of pseudo-random numbers is then used as primary data in a second main process to steganographically encode the secondary data.
• the source data may be provided as a file containing the image, video, audio, text or other data.
• this file will be referred to as the Container File.
• the secondary data may be provided as a file which, for ease of description, will be referred to as the Confidential File.
• the key data may also be stored to a file, which will be referred to as the Key File.
• Figure 1 there is shown a preferred embodiment of the invention used for secure transmission of confidential data over an open communication channel.
• the sender 10 performs a steganographic encoding process 11 on a Confidential File 12 so as to generate a unique Key File 13 which may be securely transmitted over the open communication channel 14.
• the receiver 15 of the Key File 13 performs a complementary decoding process 16 on that file to retrieve the Confidential File 12A.
• either the sender 10 or the encoding process 11 selects 17 from the Internet 18 a data file to be downloaded 19 for use as the Container File in the encoding process 11.
• the sender 10 can transmit the Key File 13 to the receiver 15 over the open channel 14.
• the receiver 15 can then send a request 20 to the Internet 18 to download 21 the same Container File at his/her end and perform the decoding process 16 on the Key File 13.
• the sender 10 and receiver 15 may have agreed on a particular Internet file to use as the Container File in the encoding and decoding processes.
• the Key File 13 may carry information on where to find the Internet file used by the sender.
• the Container File and Confidential File may contain any types of data. Accordingly, one can choose to encode a video file using an audio file, an image file using a text file, or any other combination. The invention does not constrain the user to a particular combination.
• FIG 2 there is shown a flowchart illustrating in more detail the two-part staganographic encoding process of the preferred embodiment of the invention. Steps 30-32 relate to the first main process for generating an array of pseudo-random numbers based on source data (Container File) and steps 33-37 relate to the second main process of steganographically encoding secondary data (Confidential File) using the array of pseudo-random numbers as primary data to generate key data (Key File).
• This process generates an array of pseudo-random numbers based on a source file containing digital data.
• a digital source file (Container File) containing a plurality of bytes of data is read into an array of bits.
• the source file may be any type of file containing any type of information, eg. audio, video, image, text, etc.
• one of the elements of the bit array is selected as a starting position. This selection may be made in a random or pseudo-random manner or in a predefined manner.
• step 32 the elements of the bit array are regrouped into new groups of bytes (8 bits) beginning from the starting position.
• the resulting new groups represent pseudo-random numbers in a sequence which may be stored as an array.
• this process is applicable to number systems other than one based on two (ie. binary). That is, the digital information carried in the source data need not necessarily be converted into bits. If the information is converted into a decimal system, or a number system with a base of 16, etc., the same principle may be applied to create new random numbers.
• the regrouping step performed in step 32 need not always regroup the bits into new groups of eight. Supposing the binary system is used, and the array of bits is regrouped into bytes, the range of the generated random numbers will be from 0 to 255. If instead the bits are regrouped into nibbles (4 bits), the range will be narrower (0-15). For a larger range, the groups can be made larger. For other number base systems, the size of the groups chosen may similarly be varied.
• This process steganographically encodes secondary data (Confidential File) using primary data (eg. the array of pseudo-random numbers obtained from Step 32 in Main Process 1) to generate key data (Key File).
• primary data eg. the array of pseudo-random numbers obtained from Step 32 in Main Process 1
• key data Key File
• the primary data may be obtained from a conventional random number generator or from an image, video, audio, text, or other digital data file.
• the primary data array of random numbers is rearranged so as to increase the difficulty of breaking the code.
• the user may be provided with a wide choice of techniques for rearranging the array of random numbers so as to further increase the difficulty of hacking.
• the selection of the rearranging technique may be determined randomly. For example, a password may be used as a seed to generate a pseudo-random number (for example by the use of the RAND() function in the C programming language) to select a rearrangement technique.
• the user may be allowed to define or select the rearrangement technique to apply.
• the technique of rearranging may be in a predefined or pseudo-random manner. Examples include: arranging in the reverse order, scanning row-by-row, column-by-column, in a zig-zag manner, or in a spiral manner, etc.
• Figure 3 shows an example of rearranging a typical data stream from a Container File 38 in the reverse order 39.
• the spiral method involves first taking the element at the X position, then the element at the (X+1) position, then the element at the (X-1 ) position, then the (X+2) position, then the (X-2) position, and so on.
• the rearranging step is optional and may be omitted if it is felt that the degree of randomness introduced by applying a random number generator to the source data file is sufficient.
• the random number array is rearranged to introduce a higher degree of randomness.
• Step 34 the primary data array of random numbers may be resized to match the size of the secondary data array of second data elements contained in the Confidential File.
• the array of random numbers may be larger or smaller than the array of secondary data.
• the array of random numbers is therefore either truncated or repeated so as to match the size of the array of secondary data array. Therefore, whether this step is necessary depends on the relative sizes of the arrays and on the types of operations performed or to be performed in subsequent steps of the process.
• Step 33 In the event that the secondary data array is larger than the array of random numbers, all or part of the array of random numbers is repeated and the repeated random numbers may be rearranged (in Step 33) according to a different technique. In this manner, more random numbers may be provided for the subsequent operation in Step 35, described below.
• Step 35 at least one operation is performed between elements of the array of random numbers and elements of the secondary data array contained in the Confidential File. This results in a key array which contains the results of the operations. Because each operation is between at least one random number and at least one element of the secondary data, the result obtained is different even for similar elements of the secondary data. For example, given an array of random numbers [3, 5, 2 ] and an array of second data elements [1 , 3, 1 ,....], and supposing the operation chosen is to subtract the values of the second data elements from the random numbers, the key array obtained will be [2, 2, 1 ,....].
• the first and third elements of the secondary data array are identical but produce different key elements because of the way in which the random numbers are utilised in the encoding process. This is an important advantage of the invention because it makes cracking of the code more difficult.
• the invention does not limit the user to the selection of the operation(s) to perform, thus making hacking even more difficult.
• Various types of operations may be performed, including the following:
• a logical operation such as the XOR operation. Such an operation is shown in Figure 5 wherein each bit of each second data element 50 is XORed with a corresponding bit of each first data element 51 to generate a resultant bit of each key element 52.
• a 1 :1 mapping function is illustrated in Figure 6 wherein mapping is based on the index positions as specified by the second data elements. For example, if the content of a second data element 60 has a value of "2", then "2" is taken as an index pointing to the random number 61 at position 2. The random number 61 at position 2 has a value of "98" and this is taken to be the value to be stored in the corresponding key element 62 of the key array.
• the selection of operation(s) to be performed may be determined randomly. For example, a password may be used as a seed to generate a pseudo-random number (for example by the use of the RAND() function in C) to choose an operation to be performed. Alternatively, the user may be allowed to define or select the operation(s) to perform.
• Step 36 information about the encoding process is stored in a header or attribute file, which is then combined in Step 37 with the key array to form a Key File.
• the Information Header or Attribute Section of the Key File contains all necessary information to perform the complementary decoding process. Such information may include the physical location of the Container File, the starting position for the pseudo-random number generation process, the techniques and means of rearranging the array of random numbers, the operation performed, etc.
• the encoding process may optionally include a password feature to increase security.
• the sender may provide a password which is also put through the encoding process.
• the receiver may be prompted to enter a password and decoding is performed on the encoded password provided by the sender. Only if the decoded password matches that provided by the receiver will the decoding process proceed to reproduce the Confidential File. This process is illustrated in Figure 7 wherein a Password Array 70 containing the password
• HaWorld is represented by the ASCII code 72, 101 , 108, etc. These ASCII codes are then subtracted from the random numbers 71 to create key elements
• the data transmission application shown in Figure 1 may or may not incorporate the two-part encoding process shown in Figure 2.
• the first main process for generating the pseudo-random number array on the Container File may be omitted.
• the Container File may be used as primary data in the encoding process instead of the random number array.
• the rearranging and resizing steps within the encoding process, Main Process 2 are optional and may be omitted.
• a key part of the decoding process is to perform an inverse operation of that performed in the encoding process. If rearranging and resizing of the primary data (ie. the random number array) has been performed in the encoding process, details must be stored in the attribute section of the Key File, or elsewhere, so that a reverse operation may be performed during the decoding process. Similarly, if a random number array has been generated from a source data file using Main Process 1 , that same random number array must again be reproduced from the source data file for use in decoding of the Key File.
• the present invention Compared with existing steganographic or watermarking techniques the present invention has the distinct advantage that long sentences of text, large amount of data of any form, e.g. images, audio, video, binary files, may be encoded (camouflaged) and subsequently decoded in confidence.
• long sentences of text large amount of data of any form, e.g. images, audio, video, binary files, may be encoded (camouflaged) and subsequently decoded in confidence.
• the integrity of the primary data or secondary data is never affected or compromised in any way.
• the decoding technique is lossless.
• the primary data may be optionally transmitted in any form e.g. by mail, telephone, e-mail, fax, ftp, http, dial-up networking, local area network, wide area network, Internet, intranet, or by any other electronic means.
• the data can also be retrieved from any storage medium, such as hard disk, floppy disk, zip disk,
• This invention has a significant advantage over the conventional methods, such as least significant bit (LSB) coding, which impose distortion to the data, thus the whole Container File must be sent.
• LSB coding allows only high bit-depth Container Files to be used, thus it is not applicable to most multimedia data.
• the invention disclosed above has another distinct advantage in that even with the same primary data and secondary data, the generated key data is always different and unique. This makes it almost impossible for any hacker to crack the code by analysing the generated key data.
• This invention includes a garbage-in-garbage-out password protection system.
• the password may be used to generate the random rearranging method and/or the starting location of the primary data and or secondary data to start. Since this is designed as a garbage-in-garbage-out system, it does not give any clue as to whether the password is invalid or the primary data is invalid. Therefore, even if hackers manage to get information on the primary data file, which is already very difficult, constantly hacking the key file with various passwords without any success may finally lead the hackers to think that the primary data file is not the right one.
• Unique primary data files known only to the intended users can be easily generated. Examples of these could be a digital image of the intended users, an audio speech of the intended users, and a video clip of the intended users.
• the invention may be used for confidential data communication.
• the primary data may be predetermined and the generated key file may then be transmitted to the intended users e.g. by mail, telephone, video conferencing, e-mail, fax, ftp, http, dial-up networking, internet, Intranet, or by any other electronic means. It is found that the size of the Key File that needs to be sent is almost of equal size to the actual message, with an overhead usually of fewer than 10 bytes.
• the invention may be implemented as a plug-in for an Internet web browser, e-mail program, graphics program, document program or any other computer program so that confidential data can be hidden and sent only to intended users.
• software developers who want to protect their data can also apply the invention disclosed above.
• Microsoft® Word the program can use the password and the document itself to hide the original data. Only the user who is able to enter the correct password would be able to view the document. Therefore, even if other programs are able to open Microsoft® Word documents, the opened document will still be presented as unintelligent data.
• this embodiment may be extended to other programs for example, an e-mail program such as ExchangeTM, or a graphic software such as AutoCAD®.
• the invention may be used as a data verifier for the detection of modification of a sent message.
• the sent message in this case may be considered as the primary data while a digital signature of the sender may be considered as the secondary data or vice versa.
• the receiver Upon receiving the message, the receiver can decode it to detect if the actual sender has sent it and to check if that message has been modified.
• confidential information or authentication codes may be stored in credit cards, passports, identity cards, cash cards, or any devices in which both primary data and secondary data exist.
• the biometrics eg. photographs, fingerprints, voice, etc.
• the authentication codes may be considered as the secondary data or vice versa.
• the decoded confidential information or authentication codes would not tally.
• the technique may be used to generate a digital watermark in any digital image, text, audio, video or any other digital data.
• the image, text, audio, video or digital data may be considered as the primary data (Container File) while the digital watermark may be considered as the secondary data (Confidential File).
• a Key File will be generated according to the invention disclosed. The rightful owner will hold the unique Key File and he can use it to decode the digital watermark from the primary data, thence proving the originality of the primary data.
• part of the current invention may be used in the field of cryptography.
• cryptography no container file is used as in the case of steganography. Instead, a hashing function is used to decode an encrypted message.
• This hashing function may be a password string or a very large prime number known only to the sender and the receiver. Therefore, the pseudo-random number sequence generated using Main Process 1 can be used in place of any hashing function.
• hacking the pseudo-random number sequence will be extremely difficult if not impossible.
• the current invention may also be applied complementarily to the field of cryptography.
• the current invention either O 00/25203
• the hashing function or the encrypted message may be encoded and subsequently decoded for added security.
• the Key File generated using the current invention may be encrypted before transmission to the sender for subsequent decryption before being decoded steganographically.
• the invention will be modelled and implemented in software on general-purpose computer platforms.
• the invention may be implemented using hardwired circuitry, CPU, DSP and incorporated in one or more application specific ICs.
• the invention may be embedded into facsimile machines, telephones, digital cameras, walkie- talkies or other electronic messaging devices to enable the encoding and decoding of confidential information.

Landscapes

• Engineering & Computer Science (AREA)
• Physics & Mathematics (AREA)
• Theoretical Computer Science (AREA)
• General Physics & Mathematics (AREA)
• Signal Processing (AREA)
• Computational Mathematics (AREA)
• Computer Networks & Wireless Communication (AREA)
• Mathematical Analysis (AREA)
• Mathematical Optimization (AREA)
• Pure & Applied Mathematics (AREA)
• General Engineering & Computer Science (AREA)
• Computer Security & Cryptography (AREA)
• Compression Or Coding Systems Of Tv Signals (AREA)
• Editing Of Facsimile Originals (AREA)
• Image Processing (AREA)

Applications Claiming Priority (3)

Publications (2)

Family

ID=20430088

Family Applications (1)

Country Status (4)

Cited By (1)

Families Citing this family (9)

Citations (2)

Family Cites Families (3)

• 1999
  • 1999-10-26 JP JP2000578722A patent/JP2002528770A/ja active Pending
  • 1999-10-26 WO PCT/SG1999/000105 patent/WO2000025203A1/en not_active Application Discontinuation
  • 1999-10-26 AU AU64943/99A patent/AU6494399A/en not_active Abandoned
  • 1999-10-26 EP EP99952884A patent/EP1125189A4/de not_active Withdrawn

Patent Citations (2)

Non-Patent Citations (2)

Also Published As

Similar Documents

Legal Events