Abstract: Embodiments described herein are directed to allowing a user to extend the functionality of a software code interpretation system. In one embodiment, a computer system receives user-defined conversion rules from a user for converting dynamic language code to continuation-based abstract memory representations. The computer system identifies portions of software code that are to be converted from dynamic language abstract memory representations into continuation-based abstract memory representations, where the identified code portions include undefined, extensible input primitives. The computer system also generates a dynamic, extensible set of output primitives interpretable by a continuation-based code interpretation system using the received conversion rules and converts the identified code portions including the undefined, extensible input primitives from dynamic language abstract memory representations into continuation-based abstract memory representations using the generated set of output primitives.

Abstract: A method of generating a key by a first correspondent. The key is computable by a second correspondent. The method comprises the steps of: a) making available to the second correspondent a first short term public key; b) obtaining a second short term public key from the second correspondent; c) computing a first exponent derived from the first short term private key, the first short term public key, and the first long term private key; d) computing a second exponent derived from the first short term private key, the first long term public key, the second short term public key and the first long term private key; computing a simultaneous exponentiation of the first exponent with the second short term public key and the second exponent with the second long term public key.

Abstract: Presented is a remote control for interacting with a navigation system that allows content presented on a display device to be navigated in an organized and categorized fashion. The remote control comprises operational controls grouped by navigational function located on at least three sides of the remote control for selecting content. An infrared transmitter is provided for transmitting instructions coded as infrared signals. A programmable controller is operative to receive an indication that a control was selected and instruct the transmitter to transmit an infrared signal corresponding to the control selected.

Abstract: This invention describes a method for evaluating a polynomial in an extension field FqM, wherein the method comprises the steps of partitioning the polynomial into a plurality of parts, each part is comprised of smaller polynomials using a q?th power operation in a field of characteristic q; and computing for each part components of q?th powers from components of smaller powers. A further embodiment of the invention provides for a method of converting a field element represented in terms of a first basis to its representation in a second basis, comprising the steps of partitioning a polynomial, being a polynomial in the second basis, into a plurality of parts, wherein each part is comprised of smaller polynomials using a q?th power operation in a field of characteristic q; evaluating the polynomial at a root thereof by computing for each part components of q?th powers from components of smaller powers; and evaluating the field element at the root of the polynomial.

Abstract: The applicants have recognized an alternate method of performing modular reduction that admits precomputation. The precomputation is enabled by approximating the inverse of the truncator T, which does not depend on the scalar. The applicants have also recognized that the representation of a scalar in a ?-adic representation may be optimized for each scalar that is needed. The applicants have further recognized that a standard rounding algorithm may be used to perform reduction modulo the truncator. In general terms, there is provided a method of reducing a scalar modulo a truncator, by pre-computing an inverse of the truncator. Each scalar multiplication then utilizes the pre-computed inverse to enable computation of the scalar multiplication without requiring a division by the truncator for each scalar multiplication.

Abstract: Computerized testing of a system to identify combinations of input values that expose failures in the system's operation. Attributes are applied to fields in a source code version of a test case template corresponding to the object. Applied attributes can indicate fields that are to be used when generating test cases for the object. The source code version of the test case template is subsequently compiled or interpreted into a binary test case template. Metadata in the binary test case template is inspected (e.g., through reflection) to identify the fields, data types, and attributes that are to be used when generating test cases. Based on possible input values for the identified fields and generation rules, a plurality of test cases is generated. The generated test cases are executed to identify combinations of input values that expose failures in the system's operation.

Abstract: This invention relates to a system for forming a composite from a cyanoacrylate composition and a filler within depressions, holes, cracks or spaces in a substrate. The system also allows for the placement of a cantilevered member in the filled depression, hole, crack or space in the substrate to support a load when the cyanoacrylate has cured.

Abstract: A method of generating a key by a first correspondent. The key is computable by a second correspondent. The method comprises the steps of: a) making available to the second correspondent a first short term public key, b) obtaining a second short term public key from the second correspondent; c) computing a first exponent derived from the first short term private key, the first short term public key, and the first long term private key; d) computing a second exponent derived from the first short term private key, the first long term public key, the second short term public key and the first long term private key; computing a simultaneous exponentiation of the first exponent with the second short term public key and the second exponent with the second long term public key.

Abstract: Computerized testing of an object to identify one or more call sequences that give rise to exceptions. A set of potential operations (consisting of methods and associated parameter values) is automatically generated. A parameter generator may supply interesting parameter values that may more likely result in a thrown exception. A number of call sequences is automatically constructed using the operations in the set of operations as steps in the sequence. Each call sequence is then executed using a new instance of the object. If an exception is thrown, a report may be issued containing information helpful in evaluating whether the exception is appropriate. This information might include the exception type as well as the invalid call sequence that gave rise to the thrown exception. The invalid call sequence may also be minimized to assist the tester in evaluating the root cause and appropriateness of the exception.

Abstract: Accelerated computation of combinations of group operations in a finite field is provided by arranging for at least one of the operands to have a relatively small bit length. In a elliptic curve group, verification that a value representative of a point R corresponds the sum of two other points uG and vG is obtained by deriving integers w,z of reduced bit length and so that v=w/z. The verification equality R=uG+vQ may then be computed as ?zR+(uz mod n) G+wQ=O with z and w of reduced bit length. This is beneficial in digital signature verification where increased verification can be attained.

Abstract: A method and systems provided for basis conversion in a cryptographic system. The method comprises the steps of a first correspondent transmitting an element represented in the first basis to an intermediate processor, the intermediate processor converting the element into a second basis representation and forwarding the converted element to the first correspondent who then uses the converted element in a cryptographic operation. A further embodiment of the invention provides for the intermediate processor to perform the basis conversion on a field element and then forward the converted element to a second correspondent. A still further embodiment of the invention provides for the correspondents in a cryptographic scheme making use of a bit string as a function of a sequence of traces of a field element, wherein the bit string is a shared secret for performing certain cryptographic operations.

Abstract: A method of masking a cryptographic operation using a secret value, comprising the steps of dividing the secret value into a plurality of parts; combining with each part a random value to derive a new part such that the new parts when combined are equivalent to the original secret value; and utilizing each of the individual parts in the operation.

Abstract: A method of generating a key by a first correspondent. The key is computable by a second correspondent. The method comprises the steps of: a) making available to the second correspondent a first short term public key; b) obtaining a second short term public key from the second correspondent; c) computing a first exponent derived from the first short term private key, the first short term public key, and the first long term private key; d) computing a second exponent derived from the first short term private key, the first long term public key, the second short term public key and the first long term private key; computing a simultaneous exponentiation of the first exponent with the second short term public key and the second exponent with the second long term public key.

Abstract: This invention provides a method for accelerating multiplication of an elliptic curve point Q(x,y) by a scalar k, the method comprising the steps of selecting an elliptic curve over a finite field Fq where q is a prime power such that there exists an endomorphism ?, where ?(Q)=?.Q for all points Q(x,y) on the elliptic curve: and using smaller representations ki of the scalar k in combination with the mapping ? to compute the scalar multiple of the elliptic curve point Q.

Abstract: A computerized method (and structure) of implementing a business-to-business (B2B) boarding process includes providing a set of questions related to the B2B boarding process to a new business to be boarded into an existing B2B system.

Abstract: This invention relates to cyanoacrylate-containing compositions that exhibit at least one of improved shock resistance and bond strength, while demonstrating relative surface insensitivity with respect to establishing and maintaining fixture times that are on the order of comparable cyanoacrylate compositions without the added carboxylic acids. The compositions include, in addition to the cyanoacrylate component, certain carboxylic acids.

Abstract: This invention provides a method for accelerating multiplication of an elliptic curve point Q(x,y) by a scalar k, the method comprising the steps of selecting an elliptic curve over a finite field Fq where q is a prime power such that there exists an endomorphism ?, where ?(Q)=?·Q for all points Q(x,y) on the elliptic curve; and using smaller representations ki of the scalar k in combination with the mapping y to compute the scalar multiple of the elliptic curve point Q.

Abstract: The present invention comprises a method and apparatus for playback of programs and other works recorded on random access storage media. One embodiment of the invention relates to random access storage media such as a DVD (“digital versatile disk” or “digital video disk”) used to distribute motion pictures and other audio/video programs or works. The invention involves a manner of utilizing secondary storage space of the storage media not used by the primary program being distributed to store secondary programs such as movie trailers and product advertisements, and to present the secondary programs to the user in a topical and interesting manner. In one embodiment, storage space, of a random access storage medium such as a DVD is allocated to a number of variously sized programs or program portions called “chapters.” In one embodiment, each primary and secondary program constitutes a separate chapter.

Abstract: A system and method for defining specifications for outputting content to multiple formats. More specifically, a system and method for creating a single multi-purpose stylesheet file from a single user interface, the single multi-purpose stylesheet being capable of designing multiple output media formats. For example, the multi-purpose stylesheet may convert input XML content to HTML, PDF, PostScript, WML, or other output formats. The method includes creating or modifying a multipurpose stylesheet containing formatting rules corresponding to various properties of different output media formats. The user can configure the multi-purpose stylesheet by selecting different formatting properties for different output media formats.

Abstract: Computerized testing of an object to identify one or more call sequences that give rise to exceptions. A set of potential operations (consisting of methods and associated parameter values) is automatically generated. A parameter generator may supply interesting parameter values that may more likely result in a thrown exception. A number of call sequences is automatically constructed using the operations in the set of operations as steps in the sequence. Each call sequence is then executed using a new instance of the object. If an exception is thrown, a report may be issued containing information helpful in evaluating whether the exception is appropriate. This information might include the exception type as well as the invalid call sequence that gave rise to the thrown exception. The invalid call sequence may also be minimized to assist the tester in evaluating the root cause and appropriateness of the exception.