Abstract: Methods and apparatus, including computer program products, are provided for securing data in a multi-tenant cloud-based system. In some implementations, there is provided a method. The method may include requesting access to at least one encrypted data element; obtaining, in response to the requesting, a long bit stream assigned to a client associated with the requested access; generating a key to decrypt the at least one data element, the key generated by selecting, based on a permutation, portions of the long bit stream; and decrypting, based on the generated key, the at least one data element. Related systems, methods, and articles of manufacture are also disclosed.

Abstract: Systems and methods include determination of a first data analysis period, determination of a first plurality of sets of parameter values, each of the first plurality of sets of parameter values being associated with a respective time period within the first data analysis period and describing a statistical distribution of data points associated with the respective time period, determination of a statistical distribution associated with the first data analysis period based on the first plurality of sets of parameter values, determination of a system condition based on the statistical distribution associated with the first data analysis period, and initiation of an action based on the determined system condition.

Abstract: Systems and methods are provided for receiving a request for an allocation of a task in a cluster comprising a plurality of client nodes, determining a node type for the task, based on mapping the task to a list of categories, wherein at least two of categories in the list of categories overlap in range. The systems and methods further providing for searching for available client nodes based on the node type for the task to select a client node to allocate the task, determining a zone of the selected client node, wherein the zone is mapped to the list of categories, determining a wait algorithm associated with the zone of the selected node, and contacting the selected client node and passing the task and the wait algorithm to the selected client node.

Abstract: Various embodiments of systems, computer program products, and methods for encrypting data in a multi-tenant cloud environment are described herein. In an aspect, an encryption time frame to encrypt data associated with a user in a multi-tenant cloud environment may be retrieved. Based on the encryption time frame, a list of object types to be encrypted may be identified. A batch encryption period may be determined for encrypting data corresponding to the list of object types. Further, batches are sequentially selected based on the batch encryption period, for a selected batch: one or more data records may be retrieved based on the batch encryption period and the one or more data records may be encrypted in groups based on at least one throttling value.

Abstract: The present disclosure involves systems, software, and computer implemented methods for identifying traits of an object. In one example, a set of traits is identified in an object-oriented system. A set of trait rules is identified. A trait data structure is generated. A set of classes in the object-oriented system is identified. For each class in the set of classes, a metadata structure is constructed. For each trait in the trait data structure, a trait rule in the trait computation rules structure is identified. The trait rule is applied to the particular metadata structure to generate a trait rule result. Whether the particular class has the particular trait is determined based on the trait rule result. In response to a determination that the particular class has the particular trait, the trait data structure is updated. The updated trait data structure indicates that the particular class has the particular trait.

Abstract: When storing encrypted data within a database, a key identifier may be appended to the encrypted data as a prefix. Then, when decrypting the encrypted data, the key identifier may then be used to identify an encryption key used to encrypt the data, even when multiple encryption keys have been used in encrypting and storing the encrypted data as a whole.

Abstract: Techniques are provided for identifying and encrypting fields of an application object at an application layer in a multi-tenant cloud architecture, using an object metadata structure of the application object. Accordingly, transparent, per-tenant encryption capabilities are provided, while enabling transfer of encrypted object data between the application layer and a storage layer.

Abstract: In one aspect, systems and techniques for modifying a storage structure with newly encryptable fields is described. A delta encryption system loads a current database schema and an object model for a new database schema to a memory. The current database schema includes meta information identifying multiple fields and field information for a current application build. The object model includes meta information identifying multiple fields and field information for a new application build. The fields identified by the object model meta information include one or more encryptable fields. The delta encryption system calculates a field size information for the encryptable fields and compares the meta information from the current database schema with the meta information from the object model. In response to the comparison, the delta encryption system identifies which of the encryptable fields are newly encryptable fields and modifies a database based on the calculated field size information.

Abstract: The present disclosure involves systems, software, and computer implemented methods for identifying traits of an object. In one example, a set of traits is identified in an object-oriented system. A set of trait rules is identified. A trait data structure is generated. A set of classes in the object-oriented system is identified. For each class in the set of classes, a metadata structure is constructed. For each trait in the trait data structure, a trait rule in the trait computation rules structure is identified. The trait rule is applied to the particular metadata structure to generate a trait rule result. Whether the particular class has the particular trait is determined based on the trait rule result. In response to a determination that the particular class has the particular trait, the trait data structure is updated. The updated trait data structure indicates that the particular class has the particular trait.

Abstract: Various embodiments of systems, computer program products, and methods for encrypting data in a multi-tenant cloud environment are described herein. In an aspect, an encryption time frame to encrypt data associated with a user in a multi-tenant cloud environment may be retrieved. Based on the encryption time frame, a list of object types to be encrypted may be identified. A batch encryption period may be determined for encrypting data corresponding to the list of object types. Further, batches are sequentially selected based on the batch encryption period, for a selected batch: one or more data records may be retrieved based on the batch encryption period and the one or more data records may be encrypted in groups based on at least one throttling value.

Abstract: Methods and systems are disclosed for planning and delivering curricula and specifically for managing learning and development in organizations. In some embodiments, a method for conducting training in an organization comprises identifying a candidate project in the organization, wherein identifying the candidate project includes determining that the candidate project is at risk and that a level of training for the candidate project is below a training threshold conducting, by one or more processors, a marginal benefit analysis including determining a marginal success rate increase as a function of a training level increase; conducting, by the one or more processors, a learning effectiveness analysis including determining a plurality of effectiveness scores and a plurality of cost values corresponding to a plurality of training courses; and determining a training plan for an employee of the organization based on the marginal benefit analysis and the learning effectiveness analysis.

Abstract: A secure end to end connection is established between a remote device having a wireless link and a control/monitoring location for the remote device through a gateway. During the establishing of the secure connection, a compressed message representation is used to communicate between the gateway and the remote device over the wireless link and an uncompressed message representation is used to communicate between the gateway and the first location. The establishment of the secure connection utilizes public-key algorithms.

Abstract: Modular multiplication of two elements X(t) and Y(t), over GF(2), where m is a field degree, may utilize field degree to determine, at least in part, the number of iterations. An extra shift operation may be employed when the number of iterations is reduced. Modular multiplication of two elements X(t) and Y(t), over GF(2), may include a shared reduction circuit utilized during multiplication and reduction. In addition, a modular multiplication of binary polynomials X(t) and Y(t), over GF(2), may utilize the Karatsuba algorithm, e.g., by recursively splitting up a multiplication into smaller operands determined according to the Karatsuba algorithm.

Abstract: A system, method and computer program product are provided for optimizing an altered hardware design utilizing power reports. In use, a first hardware design is synthesized. Additionally, a first power report is generated for the synthesized first hardware design. Further, the first hardware design is altered. Further still, the altered hardware design is synthesized. Also, a second power report is generated for the synthesized altered hardware design. Furthermore, the altered hardware design is optimized utilizing the first power report and the second power report.

Abstract: Method and apparatus for optimizing mesh routing for stability and system lifetime maximization in networks, for example in wireless networks. A routing module may be instantiated in nodes on the network. The routing module may implement a link quality and node health aware routing protocol on the network that considers a combination of link quality and node health/residual lifetime metrics in the calculation of the desirability of nodes and links between nodes as parts of an overall route. A route selection metric for each route may be determined from routing cost metrics for the nodes on the route and the number of hops on the route. A node may then select a best route according to the determined route selection metrics for the routes.

Abstract: Method and apparatus for optimizing mesh routing for stability and system lifetime maximization in networks, for example in wireless networks. A routing module may be instantiated in nodes on the network. The routing module may implement a link quality and node health aware routing protocol on the network that considers a combination of link quality and node health/residual lifetime metrics in the calculation of the desirability of nodes and links between nodes as parts of an overall route. A route selection metric for each route may be determined from routing cost metrics for the nodes on the route and the number of hops on the route. A node may then select a best route according to the determined route selection metrics for the routes.

Abstract: An elliptic curve processing apparatus that performs operations on elliptic curves specified over binary polynomial fields includes a functional unit that has a digit serial multiplier with a digit size of at least two bits. The elliptic curve processing apparatus performs reduction for respective generic curves using arbitrary irreducible polynomials, which correspond to respective ones of the generic curves. The elliptic curve processing apparatus may include hardwired reduction circuits in the functional unit for use with respective named curves. A storage location in the elliptic curve processing apparatus may be used to specify whether an operation is for one of the named curves or for one of the generic curves.

Abstract: Modular multiplication of two elements X(t) and Y(t), over GF(2), where m is a field degree, may utilize field degree to determine, at least in part, the number of iterations. An extra shift operation may be employed when the number of iterations is reduced. Modular multiplication of two elements X(t) and Y(t), over GF(2), may include a shared reduction circuit utilized during multiplication and reduction. In addition, a modular multiplication of binary polynomials X(t) and Y(t), over GF(2), may utilize the Karatsuba algorithm, e.g., by recursively splitting up a multiplication into smaller operands determined according to the Karatsuba algorithm.

Abstract: Modular multiplication of two elements X(t) and Y(t), over GF(2), where m is a field degree, may utilize field degree to determine, at least in part, the number of iterations. An extra shift operation may be employed when the number of iterations is reduced. Modular multiplication of two elements X(t) and Y(t), over GF(2), may include a shared reduction circuit utilized during multiplication and reduction. In addition, a modular multiplication of binary polynomials X(t) and Y(t), over GF(2), may utilize the Karatsuba algorithm, e.g., by recursively splitting up a multiplication into smaller operands determined according to the Karatsuba algorithm.

Abstract: A client node is communicatively coupled to a gateway node via a TCP/IP network. One or more constrained devices that include a wireless receiver/transmitter circuit communicate with the gateway node via a wireless network. The gateway node includes a web server that provides a dynamic web page accessible by the client node that has a list of the one or more active constrained devices on the wireless network. Each device entry in the list includes a URL that acts as an entry point for the client node to communicate with a web server in a corresponding constrained device. The gateway node automatically discovers a new device on the wireless network and populates the list of the one or more active constrained devices with the newly present constrained device. The new constrained device may be detected based on a periodic message sent by the constrained device indicating the constrained device has turned on its receiver/transmitter circuit for a period of time.