Abstract: An elliptic curve random number generator avoids escrow keys by choosing a point Q on the elliptic curve as verifiably random. An arbitrary string is chosen and a hash of that string computed. The hash is then converted to a field element of the desired field, the field element regarded as the x-coordinate of a point Q on the elliptic curve and the x-coordinate is tested for validity on the desired elliptic curve. If valid, the x-coordinate is decompressed to the point Q, wherein the choice of which is the two points is also derived from the hash value. Intentional use of escrow keys can provide for back up functionality. The relationship between P and Q is used as an escrow key and stored by for a security domain. The administrator logs the output of the generator to reconstruct the random number with the escrow key.

Abstract: A system and method for independently routing vehicles and delivering containers and closures to unit operation stations are disclosed. The containers and closures can, in some cases, be transported on the same vehicle. In other cases, the containers and closures can be transported on different vehicles.

Abstract: A method for key agreement between a first party and a second party over a public communications channel, the method including selecting, by the first party, a first value “a”; multiplying the first value “a” by a second value “b” using Knuth multiplication to create a third value “d”, the third value “d” being a semistandard tableau; sending the third value “d” to the second party; receiving, from the second party, a fourth value “e”, the fourth value being a second semistandard tableau comprising the second value “b” multiplied by a fifth value “c” selected by the second party; and creating a shared secret by multiplying the first value “a” with the fourth value “e” using Knuth multiplication, wherein the shared secret matches the third value “d” multiplied by the fifth value “c” using Knuth multiplication.

Abstract: A system can validate multiple nonvolatile random-access memory (NVRAM) devices in parallel. The system can concurrently write a first data to a first volatile memory of a first NVRAM device and a second NVRAM device. The system can modify a first electrical power source that provides an electrical power output that is received by the first NVRAM device and is received by the second NVRAM device to modify a voltage of the electrical power from a first value to a second value to initiate the first NVRAM device and the second NVRAM device to respectively perform a vault. The system can reset the first electrical power source, causing the first NVRAM device and the second NVRAM device to reset. The system can verify whether the first NVRAM device and the second NVRAM device respectively store the first data in volatile memory subsequent to performing the resetting.

Abstract: The present invention relates to peptide conjugates of microtubule-targeting agents such as maytansinoid derivatives which are useful for the treatment of diseases such as cancer.

Abstract: A method for verification at a computing device of a signed message received from a first party over a public communications channel, the method including extracting a message digest “a” belonging to a semigroup from the signed message; obtaining a public key [c,e] for the first party, including a fixed value checker “c” and an endpoint “e”, checker “c” and endpoint “e” belonging to the semigroup and the endpoint comprising a multiplication of a private key “b” for the first party and the checker “c”, multiplying the message digest “a” and the endpoint “e” to create an endmatter “ae”; extracting a signature “d” from the signed message, the signature “d” belonging to the semigroup and being a multiplication of message digest “a” and private key “b”; multiplying the signature “d” and the checker “c” to create a signcheck “dc”; and verifying that the endmatter “ae” matches the signcheck “dc”.

Abstract: A method of manufacturing a motoring system for a gas turbine having the steps of: assembling a pinned mechanical fuse, the pinned mechanical fuse including at least one shear pin; forming an outer housing; installing a reduction gear train into the outer housing, the reduction gear train having an input and an output; operably connecting a motor to the input; operably connecting a clutch to the output using the pinned mechanical fuse, the clutch in operation engages and disengages the reduction gear train; operably connecting a starter to the clutch, the starter having an output shaft; and operably connecting an accessory gearbox to the output shaft of the starter. The clutch is operably connected to the accessory gearbox through the starter and the output shaft. The at least one shear pin in operation shears when torque on the pinned mechanical fuse is greater than or equal to a selected value.

Abstract: A computing system receives a request to project a performance of a first player from a current team on a destination team. The computing system generates, based on the request, player-position features corresponding to the first player. The computing system generates team features corresponding to the first player. The computing system generates rating features for the first player. The computing system generates, via a prediction model, a player box score prediction based on the player-position features, the team features, and the rating features. The player box score prediction includes a plurality of per game metrics of the first player on the destination team.

Abstract: The application discloses a method and apparatus for imaging a sample by interferometric scattering microscopy, the method comprising illuminating a sample with at least one coherent light source, the sample being held at a sample location comprising an interface having a refractive index change, illuminating the sample with illuminating radiation to generate a backpropagating signal from the sample comprising light reflected at the interface and light scattered by the sample, splitting the backpropagating signal into first and second signals, modifying the second signal using a modifying element such that the second signal differs from the first signal, directing the first and second signals onto first and second detectors to generate, respectively, first and second images and comparing, by a processor, the first and second images to determine one or more characteristics of the sample.

Abstract: A method for providing Cheon-resistance security for a static elliptic curve Diffie-Hellman cryptosystem (ECDH), the method including providing a system for message communication between a pair of correspondents, a message being exchanged in accordance with ECDH instructions executable on computer processors of the respective correspondents, the ECDH instructions using a curve selected from a plurality of curves, the selecting including choosing a range of curves; selecting, from the range of curves, curves matching a threshold efficiency; excluding, within the selected curves, curves which may include intentional vulnerabilities; and electing, from non-excluded selected curves, a curve with Cheon resistance, the electing comprising a curve from an additive group of order q, wherein q is prime, such that q?1=cr and q+1=ds, where r and s are primes and c and d are integer Cheon cofactors of the group, such that cd?48.

Abstract: An elliptic curve random number generator avoids escrow keys by choosing a point Q on the elliptic curve as verifiably random. An arbitrary string is chosen and a hash of that string computed. The hash is then converted to a field element of the desired field, the field element regarded as the x-coordinate of a point Q on the elliptic curve and the x-coordinate is tested for validity on the desired elliptic curve. If valid, the x-coordinate is decompressed to the point Q, wherein the choice of which is the two points is also derived from the hash value. Intentional use of escrow keys can provide for back up functionality. The relationship between P and Q is used as an escrow key and stored by for a security domain. The administrator logs the output of the generator to reconstruct the random number with the escrow key.

Abstract: An enforcement module receives management instructions from a segmentation server for enforcing a segmentation policy. The management instructions include one or more rules specifying one or more groups of workloads that a workload executing on the operating system instance is permitted to communicate with according to certain communication constraints, and membership information specifying workload identifiers for workloads in each of the groups. An optimization module processes the management instructions to reduce the number of rules and the number of workload groups to which the rules apply, thereby simplifying the firewall configuration. The enforcement module then configures a firewall according to the optimized rules to enforce the segmentation policy. The optimization process beneficially improves performance of the firewall and thereby enables more efficient enforcement of the segmentation policy utilizing fewer computing resources.

Abstract: A method for providing Cheon-resistance security for a static elliptic curve Diffie-Hellman cryptosystem (ECDH), the method including providing a system for message communication between a pair of correspondents, a message being exchanged in accordance with ECDH instructions executable on computer processors of the respective correspondents, the ECDH instructions using a curve selected from a plurality of curves, the selecting including choosing a range of curves; selecting, from the range of curves, curves matching a threshold efficiency; excluding, within the selected curves, curves which may include intentional vulnerabilities; and electing, from non-excluded selected curves, a curve with Cheon resistance, the electing comprising a curve from an additive group of order q, wherein q is prime, such that q?1=cr and q+1=ds, where r and s are primes and c and d are integer Cheon cofactors of the group, such that cd?48.

Abstract: A method for key agreement between a first party and a second party over a public communications channel, the method including selecting, by the first party, a first value “a”; multiplying the first value “a” by a second value “b” using Knuth multiplication to create a third value “d”, the third value “d” being a semistandard tableau; sending the third value “d” to the second party; receiving, from the second party, a fourth value “e”, the fourth value being a second semistandard tableau comprising the second value “b” multiplied by a fifth value “c” selected by the second party; and creating a shared secret by multiplying the first value “a” with the fourth value “e” using Knuth multiplication, wherein the shared secret matches the third value “d” multiplied by the fifth value “c” using Knuth multiplication.

Abstract: A segmentation firewall executing on a host enforces a segmentation policy. In a co-existence mode, the segmentation firewall operates in co-existence with a system firewall that enforces a security policy. The segmentation firewall is configured to either drop packets that do not match any permissive rule or pass packets that match a permissive rule to the system firewall to enable the system firewall to determine whether to drop or accept the passed packets. To enable efficient operation of the segmentation firewall when operating in co-existence with the system firewall, the segmentation firewall may include a plurality of rule chains and may be configured to exit a chain and bypass remaining rule chains upon an input packet matching a permissive rule of the segmentation policy.

Abstract: Disclosed are crystalline salt Forms C and D of 6-(cyclopropanecarboxamido)-4-((2-methoxy-3-(1-methyl-1H-1,2,4-triazol-3-yl)phenyl)amino)-N-(methyl-d3)pyridazine-3-carboxamide. Form C is a MSA salt and Form D is a sulfate salt of Compound (I). Characterization data for the Forms are disclosed.

Abstract: A method for key agreement between a first party and a second party over a public communications channel, the method including selecting, by the first party, from a semigroup, a first value “a”; multiplying the first value “a” by a second value “b” to create a third value “d”, the second value “b” being selected from the semigroup; sending the third value “d” to the second party; receiving, from the second party, a fourth value “e”, the fourth value comprising the second value “b” multiplied by a fifth value “c” selected by the second party from the semigroup; and creating a shared secret by multiplying the first value “a” with the fourth value “e”, wherein the shared secret matches the third value “d” multiplied by the fifth value “c”.

Abstract: A gateway includes memory configured to store computer-readable program code; and processing circuitry configured to access the memory and execute the computer-readable program code. The gateway is connected or connectable to a low-power wide area (LPWA) network. The gateway is caused to transmit a common timing reference at a constant interval that delineates an epoch including timeslots assignable to network nodes and a free-for-all interval. The gateway is also caused to join a network node to the LPWA network based on the common timing reference and is further caused to receive a join message including a measure of received signal strength or quality of the common timing reference at the network node. The gateway is also caused to assign one or more timeslots within the epoch, a frequency, a channel, or a modulation to the network node based on the measure of received signal strength or other quality.

Abstract: A weigh-in-motion scale system for a linear synchronous motor conveyor and a method for weighing objects on a linear synchronous motor conveyor are described herein. In one embodiment, the weigh-in-motion scale system includes a support structure for supporting the following: a weigh cell, a section of a linear synchronous motor conveyor track, a vehicle for transporting an object, and an object; and a weigh cell on the support structure on which a section of a linear synchronous motor conveyor track rests directly or indirectly. In one embodiment, the method includes transporting a vehicle with an object thereon along a section of a linear synchronous motor conveyor track; and at a weighing station while the vehicle with the object thereon is being transported, weighing the section of a linear synchronous motor conveyor track, vehicle, and object to determine the weight of the object.