Abstract: The described system and method provide for an encryption and authentication technique that achieves enhanced integrity verification through assured error-propagation using a multistage sequence of pseudorandom permutations. The method generates intermediate data-dependent cryptographic variables at each stage, which are systematically combined into feedback loops. The encryption technique also generates an authentication tag with minimal post processing that is the size of the state. The size of the state is dependent on the number of pseudorandom permutations and the size of the LFSR. The authentication tag provides a unique mapping to the plaintext for any number of plaintext blocks that is less than or equal the size of the state. In addition to being a stand alone encryption algorithm, the disclosed technique is applicable to any mode that uses pseudorandom permutations such as, key dependent lookup tables, S-Boxes, and block ciphers such as RC5, TEA, and AES.

Abstract: An efficient implementation of a cryptographic processor that dynamically updates the encryption state is described. The cryptographic processor can be implemented with a minimal number of gates, yet still perform cryptographic operations quickly. The cryptographic processor has an interface, a memory, a pseudorandom permutation block and control logic. The interface receives input data blocks and returns cryptographically processed data blocks. The memory is used to store an encryption state of the cryptographic processor. The pseudorandom permutation block transforms a portion of the encryption state that is modified for each input data block by at least the input data block and a previously transformed data block. The control logic routes data in the cryptographic processor to return cryptographically processed data blocks at the interface and update dynamically the encryption state stored in memory using the transformed data blocks from the pseudorandom permutation block.

Abstract: An encryption and authentication technique that achieves enhanced integrity verification through assured error-propagation using a multistage sequence of pseudorandom permutations. The method generates intermediate data-dependent cryptographic variables at each stage, which are systematically combined into feedback loops. The encryption technique also generates an authentication tag with minimal post processing that is the size of the state.

Abstract: An encryption and authentication technique that achieves enhanced integrity verification through assured error-propagation using a multistage sequence of pseudorandom permutations. The present invention generates intermediate data-dependent cryptographic variables at each stage, which are systematically combined into feedback loops. The encryption technique also generates an authentication tag without any further steps that is N times longer than the block size where N is the number of pseudorandom permutations used in the encipherment of each block. The authentication tag provides a unique mapping to the plaintext for any number of plaintext blocks that is less than or equal to N. In addition to being a stand alone encryption algorithm, the disclosed technique is applicable to any mode that uses pseudorandom permutations such as, key dependent lookup tables, S-Boxes, and block ciphers such as RC5, TEA, and AES.

Abstract: An efficient implementation of a cryptographic processor that dynamically updates the encryption state is described. The cryptographic processor can be implemented with a minimal number of gates, yet still perform cryptographic operations quickly. The cryptographic processor has an interface, a memory, a pseudorandom permutation block and control logic. The interface receives input data blocks and returns cryptographically processed data blocks. The memory is used to store an encryption state of the cryptographic processor. The pseudorandom permutation block transforms a portion of the encryption state that is modified for each input data block by at least the input data block and a previously transformed data block. The control logic routes data in the cryptographic processor to return cryptographically processed data blocks at the interface and update dynamically the encryption state stored in memory using the transformed data blocks from the pseudorandom permutation block.

Abstract: An encryption and authentication technique that achieves enhanced integrity verification through assured error-propagation using a multistage sequence of pseudorandom permutations. The method generates intermediate data-dependent cryptographic variables at each stage, which are systematically combined into feedback loops. The encryption technique also generates an authentication tag with minimal post processing that is the size of the state.

Abstract: The described system and method provide for an encryption and authentication technique that achieves enhanced integrity verification through assured error-propagation using a multistage sequence of pseudorandom permutations. The method generates intermediate data-dependent cryptographic variables at each stage, which are systematically combined into feedback loops. The encryption technique also generates an authentication tag with minimal post processing that is the size of the state. The size of the state is dependent on the number of pseudorandom permutations and the size of the LFSR. The authentication tag provides a unique mapping to the plaintext for any number of plaintext blocks that is less than or equal the size of the state. In addition to being a stand alone encryption algorithm, the disclosed technique is applicable to any mode that uses pseudorandom permutations such as, key dependent lookup tables, S-Boxes, and block ciphers such as RC5, TEA, and AES.

Abstract: The present invention describes a system and method for securely identifying and authenticating devices in a symmetric encryption system. An RFID tag can generate indicators using encryption state variables and a symmetric key. An RFID reader, after receiving the encryption state variables from the tag, may identify the tag by performing an exhaustive key search in a key database. Each key in the database may be tested by using the key and encryption state variables to perform an encryption operation similar to that performed by the tag. The result is then compared with the received tag indicators to determine if the tag has been identified. A rotor-based encryption scheme provides for a low cost key search while providing resilience against cloning, tracking, tampering and replay attacks.

Abstract: A system, process and method for data encryption and transmission are disclosed. By adopting the paradigm of a pre-paid self addressed express envelope end-users will interact with this invention in much the same way they interact with traditional delivery systems. They simply provide the content, and delivery takes place without any further user intervention. The encryption is a “software appliance”. This software already knows the identity of the sender and the receiver and the encryption key that is to be used; all it needs from the user is the information which is to be securely transported.

Abstract: An encryption and authentication technique that achieves enhanced integrity verification through assured error-propagation using a multistage sequence of pseudorandom permutations. The present invention generates intermediate data-dependent cryptographic variables at each stage, which are systematically combined into feedback loops. The encryption technique also generates an authentication tag without any further steps that is N times longer than the block size where N is the number of pseudorandom permutations used in the encipherment of each block. The authentication tag provides a unique mapping to the plaintext for any number of plaintext blocks that is less than or equal to N. In addition to being a stand alone encryption algorithm, the disclosed technique is applicable to any mode that uses pseudorandom permutations such as, key dependent lookup tables, S-Boxes, and block ciphers such as RC5, TEA, and AES.

Abstract: An encryption and authentication technique that achieves enhanced integrity verification through assured error-propagation using a multistage sequence of pseudorandom permutations. The present invention generates intermediate data-dependent cryptographic variables at each stage, which are systematically combined into feedback loops. The encryption technique also generates an authentication tag without any further steps that is N times longer than the block size where N is the number of pseudorandom permutations used in the encipherment of each block. The authentication tag provides a unique mapping to the plaintext for any number of plaintext blocks that is less than or equal to N. In addition to being a stand alone encryption algorithm, the disclosed technique is applicable to any mode that uses pseudorandom permutations such as, key dependent lookup tables, S-Boxes, and block ciphers such as RC5, TEA, and AES.

Abstract: An encryption and authentication technique that achieves enhanced integrity verification through assured error-propagation using a multistage sequence of pseudorandom permutations. The present invention generates intermediate data-dependent cryptographic variables at each stage, which are systematically combined into feedback loops. The encryption technique also generates an authentication tag without any further steps that is N times longer than the block size where N is the number of pseudorandom permutations used in the encipherment of each block. The authentication tag provides a unique mapping to the plaintext for any number of plaintext blocks that is less than or equal to N. In addition to being a stand alone encryption algorithm, the disclosed technique is applicable to any mode that uses pseudorandom permutations such as, key dependent lookup tables, S-Boxes, and block ciphers such as RC5, TEA, and AES.

Abstract: A system (100) and method (400, 500) for data encryption and decryption are disclosed. The encryption system is operable at encryption rates in excess of 10 Mbps and is expandable to over 200 Mpbs. For encryption, plain characters are received, and a key block (120) includes key characters corresponding to the plain characters is accessed. A current key character corresponding to a current plain character is located. A next key character corresponding to a next plain character is located. An offset between the current key character and the next key character is determined to encrypt the plain characters. Aliases are used to facilitate the encryption and decryption. Vector distances of offsets are utilized for the encryption and decryption, using many variables and many dimensions, such as using coordinates.

Abstract: A system (100) and method (400, 500) for data encryption and decryption are disclosed. The encryption system is operable at encryption rates in excess of 10 Mbps and is expandable to over 200 Mpbs. For encryption, plain characters are received, and a key block (120) includes key characters corresponding to the plain characters is accessed. A current key character corresponding to a current plain character is located. A next key character corresponding to a next plain character is located. An offset between the current key character and the next key character is determined to encrypt the plain characters. Aliases are used to facilitate the encryption and decryption. Vector distances of offsets are utilized for the encryption and decryption, using many variables and many dimensions, such as using coordinates.

Abstract: A system (100) and method (400, 500) for data encryption and decryption are disclosed. The encryption system is operable at encryption rates in excess of 10 Mbps and is expandable to over 200 Mpbs. For encryption, plain characters are received, and a key block (120) includes key characters corresponding to the plain characters is accessed. A current key character corresponding to a current plain character is located. A next key character corresponding to a next plain character is located. An offset between the current key character and the next key character is determined to encrypt the plain characters. Aliases are used to facilitate the encryption and decryption. Vector distances of offsets are utilized for the encryption and decryption, using many variables and many dimensions, such as using coordinates.

Abstract: A system (100) and method (400, 500) for data encryption and decryption are disclosed. The encryption system is operable at encryption rates in excess of 10 Mbps and is expandable to over 200 Mpbs. For encryption, plain characters are received, and a key block (120) includes key characters corresponding to the plain characters is accessed. A current key character corresponding to a current plain character is located. A next key character corresponding to a next plain character is located. An offset between the current key character and the next key character is determined to encrypt the plain characters. Aliases are used to facilitate the encryption and decryption. Vector distances of offsets are utilized for the encryption and decryption, using many variables and many dimensions, such as using coordinates.

Abstract: A system (100) and method (400, 500) for data encryption and decryption are disclosed. The encryption system is operable at encryption rates in excess of 10 Mbps and is expandable to over 200 Mpbs. For encryption, plain characters are received, and a key block (120) includes key characters corresponding to the plain characters is accessed. A current key character corresponding to a current plain character is located. A next key character corresponding to a next plain character is located. An offset between the current key character and the next key character is determined to encrypt the plain characters. Aliases are used to facilitate the encryption and decryption. Vector distances of offsets are utilized for the encryption and decryption, using many variables and many dimensions, such as using coordinates.

Abstract: A method and system of selectively encrypting data at a server side, and selectively downloading the encrypted information to a remote user as a function of the key a requesting remote user has. The present invention is particularly advantageous to allow a server to download HTML or other type of documents to requesting remote user, and then allowing sensitive information to only be downloaded to a remote user depending on the type of key the user holds. Within the documents at the server side are tags which indicate the presence of sensitive information encrypted at the server and which may be processed by a remote user to download and decrypt the sensitive information as a function of the key level the remote user holds. Different levels of sensitive information are downloadable to a remote user, whereby when general non-sensitive information is downloadable to a user without the key.

Abstract: A system, process and method for data encryption and transition are disclosed. By adopting the paradigm of a pre-paid self addressed express envelope end-users will interact with this invention in much the same way they interact with traditional delivery systems. They simply provide the content, and delivery takes place without any further user intervention. The encryption is a “software appliance”. This software already knows the identity of the sender and the receiver and the encryption key that is to be used; all it needs from the user is the information which is to be securely transported.

Abstract: A system (100) and method (400, 500) for data encryption and decryption are disclosed. The encryption system is operable at encryption rates in excess of 10 Mbps and is expandable to over 200 Mpbs. For encryption, plain characters are received, and a key block (120) includes key characters corresponding to the plain characters is accessed. A current key character corresponding to a current plain character is located. A next key character corresponding to a next plain character is located. An offset between the current key character and the next key character is determined to encrypt the plain characters. Aliases are used to facilitate the encryption and decryption. Vector distances of offsets are utilized for the encryption and decryption, using many variables and many dimensions, such as using coordinates.