Abstract: A computer implemented system and method for generating and recovering an authorization code. The system creates an authorization code by accepting a base-sentence from a user. Based on the characters present in this base-sentence, the system computes a base-sentence matrix. The system also generates a plurality of patterns. The user can either select the pattern from the multiple patterns suggested by the system or can create his/her own pattern. The system then performs multiplications between the base-sentence matrix and the selected pattern matrix at different stages in the path forward, for obtaining a strong authorization code. In case the user forgets the base sentence, the system also has provisions to manage forgotten authorization code. This is done by fragmenting the base-sentence into different matrices and storing the fragmented matrices into a repository after computing matrix multiplication with a security question answer and with a secret key provided by the user.

Abstract: Method and system for determining the number of computing resources for executing a plurality of jobs. In accordance with the method and the system, the plurality of jobs along with a plurality of variables associated to the plurality of jobs may be received. The plurality of variables may include a mean processing time (?), a standard deviation (?), a service level agreement (?), and a confidence level (1-?). After the receipt of the plurality of variables, an inverse parameter (?) may be determined using the mean processing time (?), the standard deviation (?), and the confidence level (1-?). Further, a queue length (k) may be computed based upon the total processing time (T), the mean processing time (?), the standard deviation (?), and the inverse parameter (?). Finally, the queue length (k) and the number of jobs (n) may be processed in order to determine the number of computing resources.

Abstract: Method and system for determining the total processing time required for executing a plurality of jobs. In certain aspects, a set of jobs along with a mean processing time and a queue length are received. The set of jobs are distributed across computing resources based upon the queue length. A set of priority jobs is received when the execution of a subset of jobs from the set of jobs has been executed in a first processing time (TF). Further, the set of priority jobs is distributed for execution across the plurality of computing resources. A second processing time (TS) required for the execution of the set of priority jobs is computed. Further, a third processing time (TT) required for the execution of the set of remaining jobs from the set of jobs is determined. Finally, the total processing time is determined by summing TF, TS, and TT.

Abstract: A computer implemented system and method for generating and recovering an authorization code. The system creates an authorization code by accepting a base-sentence from a user. Based on the characters present in this base-sentence, the system computes a base-sentence matrix. The system also generates a plurality of patterns. The user can either select the pattern from the multiple patterns suggested by the system or can create his/her own pattern. The system then performs multiplications between the base-sentence matrix and the selected pattern matrix at different stages in the path forward, for obtaining a strong authorization code. In case the user forgets the base sentence, the system also has provisions to manage forgotten authorization code. This is done by fragmenting the base-sentence into different matrices and storing the fragmented matrices into a repository after computing matrix multiplication with a security question answer and with a secret key provided by the user.

Abstract: Method and system for determining the total processing time required for executing a plurality of jobs (n). The plurality of jobs along with a mean processing time (?), and a queue length (k) are received. A number of preliminary jobs (p) of the plurality of jobs (n) are distributed across computing resources based upon the queue length (k). A first processing time (TF) required for the execution of the number of preliminary jobs (p) is determined. Further, a number of remaining jobs (n?p) of the plurality of jobs (n) are distributed for execution across the plurality of computing resources. A second processing time (TS) required for the execution of the set of remaining jobs (n?p) is computed. Finally, the total processing time is determined by summing TF and TS.

Abstract: Method and system for determining the total processing time required for executing a plurality of jobs (n). The plurality of jobs along with a mean processing time (?), and a queue length (k) are received. A number of preliminary jobs (p) of the plurality of jobs (n) are distributed across computing resources based upon the queue length (k). A first processing time (TF) required for the execution of the number of preliminary jobs (p) is determined. Further, a number of remaining jobs (n?p) of the plurality of jobs (n) are distributed for execution across the plurality of computing resources. A second processing time (TS) required for the execution of the set of remaining jobs (n?p) is computed. Finally, the total processing time is determined by summing TF and TS.

Abstract: Method and system for determining the total processing time required for executing a plurality of jobs. In certain aspects, a set of jobs along with a mean processing time and a queue length are received. The set of jobs are distributed across computing resources based upon the queue length. A set of priority jobs is received when the execution of a subset of jobs from the set of jobs has been executed in a first processing time (TF). Further, the set of priority jobs is distributed for execution across the plurality of computing resources. A second processing time (TS) required for the execution of the set of priority jobs is computed. Further, a third processing time (TT) required for the execution of the set of remaining jobs from the set of jobs is determined. Finally, the total processing time is determined by summing TF, TS, and TT.

Abstract: Method and system for determining the number of computing resources for executing a plurality of jobs. In accordance with the method and the system, the plurality of jobs along with a plurality of variables associated to the plurality of jobs may be received. The plurality of variables may include a mean processing time (?), a standard deviation (?), a service level agreement (?), and a confidence level (1-?). After the receipt of the plurality of variables, an inverse parameter (?) may be determined using the mean processing time (?), the standard deviation (?), and the confidence level (1-?). Further, a queue length (k) may be computed based upon the total processing time (T), the mean processing time (?), the standard deviation (?), and the inverse parameter (?). Finally, the queue length (k) and the number of jobs (n) may be processed in order to determine the number of computing resources.

Abstract: A deterministic random number generator includes a number series generator adapted to generate an infinite Pi series, a summation generator adapted to generate a partial sum of said infinite Pi series, a computer adapted to compute a finite sequence from said partial sum of infinite Pi series, a shuffler adapted to shuffle said computed finite sequence to obtain a shuffled sequence, a masker adapted to mask said shuffled sequence to obtain a masked sequence, a non-linear function processor adapted to process said masked sequence to obtain a non-linear processed sequence, and a linear feedback shift register adapted to receive and shift bits of said non-linear processed sequence in a pre-determined manner to obtain a deterministic random number and a method for generating a deterministic random number for cryptography and watermarking.

Abstract: A system and method for implementing the Elliptic Curve scalar multiplication method in cryptography, where the Double Base Number System is expressed in decreasing order of exponents and further on using it to determine Elliptic curve scalar multiplication over a finite elliptic curve.

Abstract: A system and method for designing a secure hash function is provided. Both of which have been designed for secure hash functionality, Secure Hash Algorithm (SHA-3) using pre processing (MP) methods and to help reduce hash collisions. It is a one way hash function which is a combination of message pre-processing which is a bijective function and the cipher block chaining mode (CBC).

Abstract: A system and method for designing a secure hash function is provided. Both of which have been designed for secure hash functionality, Secure Hash Algorithm (SHA-3) using pre processing (MP) methods and to help reduce hash collisions. It is a one way hash function which is a combination of message pre-processing which is a bijective function and the cipher block chaining mode (CBC).

Abstract: A deterministic random number generator comprising: number series generator adapted to generate an infinite Pi series; summation means adapted to generate a partial sum of said infinite Pi series; computation means adapted to compute a finite sequence from said partial sum of infinite Pi series; shuffling means adapted to shuffle said computed finite sequence to obtain a shuffled sequence; masking means adapted to mask said shuffled sequence to obtain a masked sequence; non-linear function means adapted to process said masked sequence to obtain a non-linear processed sequence; and linear feedback shift register means adapted to receive and shift bits of said non-linear processed sequence in a pre-determined manner to obtain a deterministic random number and a method for generating a deterministic random number for cryptography and watermarking.

Abstract: A system and method for implementing the Elliptic Curve scalar multiplication method in cryptography, where the Double Base Number System is expressed in decreasing order of exponents and further on using it to determine Elliptic curve scalar multiplication over a finite elliptic curve.