Abstract: An encryption specification named “MetaEncrypt” implemented as a method and associated apparatus is disclosed for unbreakable encryption of data, code, applications, and other information that uses a symmetric key for encryption/decryption and to configure the underlying encryption algorithms being utilized to increase the difficulty of mathematically modeling the algorithms without possession of the key. Data from the key is utilized to select several encryption algorithms utilized by MetaEncrypt and configure the algorithms during the encryption process in which block sizes are varied and the encryption technique that is applied is varied for each block. Rather than utilizing a fixed key of predetermined length, the key in MetaEncrypt can be any length so both the key length and key content are unknown.

Abstract: An encryption specification named “MetaEncrypt” implemented as a method and associated apparatus is disclosed for unbreakable encryption of data, code, applications, and other information that uses a symmetric key for encryption/decryption and to configure the underlying encryption algorithms being utilized to increase the difficulty of mathematically modeling the algorithms without possession of the key. Data from the key is utilized to select several encryption algorithms utilized by MetaEncrypt and configure the algorithms during the encryption process in which block sizes are varied and the encryption technique that is applied is varied for each block. Rather than utilizing a fixed key of predetermined length, the key in MetaEncrypt can be any length so both the key length and key content are unknown.

Abstract: An encryption specification named “MetaEncrypt” implemented as a method and associated apparatus is disclosed for unbreakable encryption of data, code, applications, and other information that uses a symmetric key for encryption/decryption and to configure the underlying encryption algorithms being utilized to increase the difficulty of mathematically modeling the algorithms without possession of the key. Data from the key is utilized to select several encryption algorithms utilized by MetaEncrypt and configure the algorithms during the encryption process in which block sizes are varied and the encryption technique that is applied is varied for each block. Rather than utilizing a fixed key of predetermined length, the key in MetaEncrypt can be any length so both the key length and key content are unknown.

Abstract: An encryption specification named “MetaEncrypt” implemented as a method and associated apparatus is disclosed for unbreakable encryption of data, code, applications, and other information that uses a symmetric key for encryption/decryption and to configure the underlying encryption algorithms being utilized to increase the difficulty of mathematically modeling the algorithms without possession of the key. Data from the key is utilized to select several encryption algorithms utilized by MetaEncrypt and configure the algorithms during the encryption process in which block sizes are varied and the encryption technique that is applied is varied for each block. Rather than utilizing a fixed key of predetermined length, the key in MetaEncrypt can be any length so both the key length and key content are unknown.

Abstract: An encryption specification named “MetaEncrypt” implemented as a method and associated apparatus is disclosed for unbreakable encryption of data, code, applications, and other information that uses a symmetric key for encryption/decryption and to configure the underlying encryption algorithms being utilized to increase the difficulty of mathematically modeling the algorithms without possession of the key. Data from the key is utilized to select several encryption algorithms utilized by MetaEncrypt and configure the algorithms during the encryption process in which block sizes are varied and the encryption technique that is applied is varied for each block. Rather than utilizing a fixed key of predetermined length, the key in MetaEncrypt can be any length so both the key length and key content are unknown.

Abstract: An encryption specification named “MetaEncrypt” implemented as a method and associated apparatus is disclosed for unbreakable encryption of data, code, applications, and other information that uses a symmetric key for encryption/decryption and to configure the underlying encryption algorithms being utilized to increase the difficulty of mathematically modeling the algorithms without possession of the key. Data from the key is utilized to select several encryption algorithms utilized by MetaEncrypt and configure the algorithms during the encryption process in which block sizes are varied and the encryption technique that is applied is varied for each block. Rather than utilizing a fixed key of predetermined length, the key in MetaEncrypt can be any length so both the key length and key content are unknown.

Abstract: An online auction bidding system utilizes a three state auction model that includes an auction open state, followed by a closing state, and an auction closed state which occurs last in which the online auction is ended and bids will not be accepted. The highest bid received prior to the auction end is considered the winning bid. In the auction open state, bids are guaranteed to be accepted if they are qualified, for example, by meeting certain conditions such as being above a current high bid by some desired increment. The closing state is of indeterminate length and thus the time that the online auction ends is unknown by the bidders which makes the practice of sniping difficult. Qualified bids are accepted during the closing state but bidders run the risk that a later bid will not be accepted should the auction end prior to that bid being placed.

Abstract: An apparatus and method for performing calculations is provided so that a paradigm of a tape is utilized in a calculator application that executes on a computing platform and which is configured to enable a user to see and interact with multiple virtual tapes that each show numerical values and operators. Each tape functions as a user-accessible memory and a memory value may be recalled from any one tape and that value placed on any other tape. The calculator application is configured to enable the user to enter a sequence of values and operators which are all displayable on a given tape, as well as support the user's ability to edit any value or operator that was previously entered on that tape. Calculations are updated to reflect the user's edits on both the tape currently being edited and any other tape that uses the edited tape as a memory.

Abstract: An online auction bidding system utilizes a three state auction model that includes an auction open state, followed by a closing state, and an auction closed state which occurs last in which the online auction is ended and bids will not be accepted. The highest bid received prior to the auction end is considered the winning bid. In the auction open state, bids are guaranteed to be accepted if they are qualified, for example, by meeting certain conditions such as being above a current high bid by some desired increment. The closing state is of indeterminate length and thus the time that the online auction ends is unknown by the bidders which makes the practice of sniping difficult. Qualified bids are accepted during the closing state but bidders run the risk that a later bid will not be accepted should the auction end prior to that bid being placed.

Abstract: An apparatus and method for performing calculations is provided so that a paradigm of a tape is utilized in a calculator application that executes on a computing platform and which is configured to enable a user to see and interact with multiple virtual tapes that each show numerical values and operators. Each tape functions as a user-accessible memory and a memory value may be recalled from any one tape and that value placed on any other tape. The calculator application is configured to enable the user to enter a sequence of values and operators which are all displayable on a given tape, as well as support the user's ability to edit any value or operator that was previously entered on that tape. Calculations are updated to reflect the user's edits on both the tape currently being edited and any other tape that uses the edited tape as a memory.