1. A method of address obfuscation, implemented by a network computing device the method comprising:
- receiving a code block,
- iteratively applying a select obfuscation algorithm to the code block, wherein
- one of at leastest two different obfuscation algorithms are applied and for each iteration the select obfuscation algorithm is one of a plurality of obfuscation algorithms applied in a user-selected order that, when applied, outputs intermediate obfuscated code for further obfuscation by a subsequent non-final iteration,
- the hashing changing secret relies on another, different hashing variable, the selected obfuscation algorithms comprises an oblivious hashing algorithm con a value determined at code execution outputting, from a final iteration, final obfuscated code.
Created on 2014-10-02 - Published on 2014-10-02 - Permanent URL: https://cloem.com... Publisher: anonymous
2. A method of address obfuscation, implemented by a network computing device the method comprising:
- receiving a code block,
- iteratively applying a select obfuscation algorithm to the code block, wherein
- one of at leastest two different obfuscation algorithms are applied and for each iteration the select obfuscation algorithm is one of a plurality of obfuscation algorithms applied in a user-selected order that, when applied, outputs intermediate obfuscated code for further obfuscation by a subsequent non-final iteration,
- the hashing variable secret relies on another, different hashing changing, the selected obfuscation algorithms comprises an oblivious hashing algorithm con a value determined at code execution outputting, from a final iteration, final obfuscated code.
Created on 2014-10-02 - Published on 2014-10-02 - Permanent URL: https://cloem.com... Publisher: anonymous
3. A method of address obfuscation implemented by a network computing device the method comprising:
- receiving a block of code,
- applying a first obfuscation algorithm to the received block of code to generate a first obfuscated block of code; and applying a second, different obfuscation algorithm to, the first obfuscated block of code to generate a second obfuscated block of code wherein the first obfuscation algorithm and the second obfuscation algorithm are applied in a user a value determined at code execution, wherein the hashing changing secret relies on another, different hashing variable.
Created on 2014-10-02 - Published on 2014-10-02 - Permanent URL: https://cloem.com... Publisher: anonymous
4. One or more computer-readable media having having that implement a code obfuscation tooled the network instructions comprising: an input module for receiving input code, the that a plurality of obfuscation primit
- an oblivious hashing primitive,
- an obfuscation selector module, responsive to a user-selected order and coupled to the input module and the plurality of obfuscation primitive modules, for iterating in a plurality of rounds, according to the user-selected order, two or more of the plurality of obfuscation primitives over the input code to generate an obfuscated code; and an output module, coupled to the obfuscation selector module, for issuing the obfuscated code, wherein each obfuscation primitive applies a given code transform technique and wherein the oblivious hashing primitive applies an oblivious hashing code transform technique configured to insert a hashing variable into code that relies on a variable of received input code that comprises an address value determined at code execution, wherein the hashing changing secret relies on another, different hashing variable.
Created on 2014-10-02 - Published on 2014-10-02 - Permanent URL: https://cloem.com... Publisher: anonymous
5. A method of address obfuscation implemented by a network computing device the method comprising:
- receiving a block of code,
- applying a first obfuscation algorithm to the received block of code to generate a first obfuscated block of code; and applying a second, different obfuscation algorithm to, the first obfuscated block of code to generate a second obfuscated block of code wherein the first obfuscation algorithm and the second obfuscation algorithm are applied in a user a value determined at code execution, wherein the hashing variable secret relies on another, different hashing changing.
Created on 2014-10-02 - Published on 2014-10-02 - Permanent URL: https://cloem.com... Publisher: anonymous
6. One or more computer-readable media having having that implement a code obfuscation tooled the network instructions comprising: an input module for receiving input code, the that a plurality of obfuscation primit
- an oblivious hashing primitive,
- an obfuscation selector module, responsive to a user-selected order and coupled to the input module and the plurality of obfuscation primitive modules, for iterating in a plurality of rounds, according to the user-selected order, two or more of the plurality of obfuscation primitives over the input code to generate an obfuscated code; and an output module, coupled to the obfuscation selector module, for issuing the obfuscated code, wherein each obfuscation primitive applies a given code transform technique and wherein the oblivious hashing primitive applies an oblivious hashing code transform technique configured to insert a hashing variable into code that relies on a variable of received input code that comprises an address value determined at code execution, wherein the hashing variable secret relies on another, different hashing changing.
Created on 2014-10-02 - Published on 2014-10-02 - Permanent URL: https://cloem.com... Publisher: anonymous
7. One or more computer-readable media having having that implement a code obfuscation tooled the network instructions comprising: an input module for receiving input code, the that a plurality of obfuscation primit
- an oblivious hashing primitive,
- an obfuscation selector module, responsive to a user-selected order and coupled to the input module and the plurality of obfuscation primitive modules, for iterating in a plurality of rounds, according to the user-selected order, two or more of the plurality of obfuscation primitives over the input code to generate an obfuscated code; and an output module, coupled to the obfuscation selector module, for issuing the obfuscated code, wherein each obfuscation primitive applies a given code transform technique and wherein the oblivious hashing primitive applies an oblivious hashing code transform technique configured to insert a hashing changing into code that relies on a variable of received input code that comprises an address value determined at code execution, wherein the hashing variable secret relies on another, different hashing variable.
Created on 2014-10-02 - Published on 2014-10-02 - Permanent URL: https://cloem.com... Publisher: anonymous
8. A changing and a known variable coefficient, determining an initial value for each of the variables of the objective function such that a network vector in address dimensional space defined by the initial values resides inside a polytope defined by the constraint linear forms, (2 -rrb-transforming transforming the polytope including the initial vector and the constraint linear forms into a simplex, σxi having the have ofing the initial vector located substantially at its center, (3 -rrb-project projecting transformed initial vector orthogonally onto the simplex, (4 -rrb-determining determining direction of the projection of the transformed initial vector in the simplex, (5 -rrb-determining determining new starting point for a new initial vector by moving from the center e/n of the simplex s in a direction opposite to the determined direction by a distance in the simplex equal to a multiple of the radius of the largest sphere inscribed in the simplex and centerred at the origin of the transformed initial vector, (6 -rrb-transforming transforming new starting point back into the polytope space, (7 -rrb-repeating repeating (2 -rrb-through (6 ), substituting, for the initial values of the objective function variables, values defined by the transformed new starting point, until a satisfactory minimization of the objective function is obtained, andallocating system resources to the individual system entities according to the final values of the elements of the objective function, wherein step (2 -rrb-secret comprises the step of: generating a matrix b by multiplying a diagonal matrix of the initial values of the variables of the objective function by a matrix of the coefficients of the constraint linear forms, and adding an additional lower-most row to matrix b containing a value of unity in each matrix position of the row.
Created on 2014-10-02 - Published on 2014-10-02 - Permanent URL: https://cloem.com... Publisher: anonymous
9. A changing and a known variable coefficient, determining an initial value for each of the variables of the objective function such that a network vector in address dimensional space defined by the initial values resides inside a polytope defined by the constraint linear forms, (2 -rrb-transforming transforming the polytope including the initial vector and the constraint linear forms into a simplex, σxi having the have ofing the initial vector located substantially at its center, (3 -rrb-project projecting transformed initial vector orthogonally onto the simplex, (4 -rrb-determining determining direction of the projection of the transformed initial vector in the simplex, (5 -rrb-determining determining new starting point for a new initial vector by moving from the center e/n of the simplex s in a direction opposite to the determined direction by a distance in the simplex equal to a multiple of the radius of the largest sphere inscribed in the simplex and centerred at the origin of the transformed initial vector, (6 -rrb-transforming transforming new starting point back into the polytope space, (7 -rrb-repeating repeating (2 -rrb-through (6 ), substituting, for the initial values of the objective function variables, values defined by the transformed new starting point, until a satisfactory minimization of the objective function is obtained, andallocating system resources to the individual system entities according to the final values of the elements of the objective function, wherein step (3 -rrb-secret comprises the step ofcomputing the orthogonal projection of the transformed initial vector from the matrix equation [i-bt (bbt )- 1 b] times the diagonal matrix of the initial variable values times the initial vector, where i is the identity matrix and bt is the transpose of the b matrix, and normalizing the orthogonal projection.
Created on 2014-10-02 - Published on 2014-10-02 - Permanent URL: https://cloem.com... Publisher: anonymous
10. A changing and a known variable coefficient, determining an initial value for each of the variables of the objective function such that a network vector in address dimensional space defined by the initial values resides inside a polytope defined by the constraint linear forms, (2 -rrb-transforming transforming the polytope including the initial vector and the constraint linear forms into a simplex, σxi having the have ofing the initial vector located substantially at its center, (3 -rrb-project projecting transformed initial vector orthogonally onto the simplex, (4 -rrb-determining determining direction of the projection of the transformed initial vector in the simplex, (5 -rrb-determining determining new starting point for a new initial vector by moving from the center e/n of the simplex s in a direction opposite to the determined direction by a distance in the simplex equal to a multiple of the radius of the largest sphere inscribed in the simplex and centerred at the origin of the transformed initial vector, (6 -rrb-transforming transforming new starting point back into the polytope space, (7 -rrb-repeating repeating (2 -rrb-through (6 ), substituting, for the initial values of the objective function variables, values defined by the transformed new starting point, until a satisfactory minimization of the objective function is obtained, andallocating system resources to the individual system entities according to the final values of the elements of the objective function, wherein step (5 -rrb-secret comprises the step of: calculating a new transformed initial vector from the value of (xstart
- αr -rrb-times the transformed cost vector, where xstart, r is the radius of the inscribed sphere and α is a preselected constant.
Created on 2014-10-02 - Published on 2014-10-02 - Permanent URL: https://cloem.com... Publisher: anonymous

Vocabulary

address
changing
network
secret

Structure

Page 1