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 back non-final iteration,

- the select obfuscation algorithm is selected from a group consisting of an oblivious hashing algorithm, a pointer channel algorithm, a noise code injection algorithm, and a control-flow alteration algorithm, the selected obfuscation algorithms comprises an oblivious hashing algorithm configured to insert a hashing changing into a code block that relies on a variable of the received code block that comprises a value determined at code execution outputting, from a final iteration, final obfuscated code.

- 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 back non-final iteration,

- the select obfuscation algorithm is selected from a group consisting of an oblivious hashing algorithm, a pointer channel algorithm, a noise code injection algorithm, and a control-flow alteration algorithm, the selected obfuscation algorithms comprises an oblivious hashing algorithm configured to insert a hashing changing into a code block that relies on a variable of the received code block that comprises 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
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
channel
address
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.

Created on 2014-10-02 - Published on 2014-10-02 - Permanent URL: https://cloem.com... Publisher: anonymous

3.
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
channel
address
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-further
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

4.
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
channel
address
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-further
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.

5.
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
channel
address
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-further
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.

- αr -rrb-times the transformed cost vector, where xstart, r is the radius of the inscribed sphere and α is a preselected constant.

6.
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
channel
address
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-further
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, furtherer comprising the step of: computing the radius from the formula 1/√n (n-1 ).

- αr -rrb-times the transformed cost vector, where xstart, r is the radius of the inscribed sphere and α is a preselected constant, furtherer comprising the step of: computing the radius from the formula 1/√n (n-1 ).

7.
A
changing
and
a
known
variable
coefficient,
and
by
one
or
more
constraint
relationships
expressed
in
terms
of
one
or
more
of
the
variables
of
the
objective
function,
the
channel
method
comprising
the
steps
of:
determining
an
initial
value
for
each
of
the
variables
of
the
objective
function
such
that
an
initial
vector
defined
by
the
initial
values
resides
inside
a
polytope
defined
by
the
constraint
relationships,
(2
-rrb-transforming
transforming
the
polytope,
the
initial
vector
and
the
constraint
relationships,
into
a
simplex
≧0,
≧xi,
in
which
the
transformed
initial
vector
is
located
substantially
at
the
center
of
the
simplex,
(3
-rrb-project
projecting
transformed
vector
of
the
objective
function
orthogonally
onto
the
address
space
of
the
transformed
constraint
relationships,
(4
-rrb-determining
determining
direction
of
the
projection
of
the
transformed
objective
function,
(5
-rrb-determining
determining
new
value
for
each
of
the
variables
of
the
objective
function
by
moving
from
the
center
e/n
of
the
simplex,
a
distance
equal
to
a
predefined
multiple
of
the
radius
of
the
largest
sphere
contained
within
the
simplex
and
centerred
at
the
origin
of
the
transformed
initial
vector,
(6
-rrb-transforming
transforming
new
values
back
into
the
original
variables,
(7
-rrb-repeating
repeating
(2
-rrb-through
(6
),
substituting
the
new
values
for
the
initial
values
of
the
objective
function
variables,
until
a
network
minimization
of
the
objective
function
is
obtained,
and
(8
-rrb-allocating
system
resources
to
the
individual
system
entities
according
to
the
final
values
of
the
elements
of
the
objective
function.

8.
A
changing
and
a
known
variable
coefficient,
and
by
one
or
more
constraint
relationships
expressed
in
terms
of
one
or
more
of
the
variables
of
the
objective
function,
the
channel
method
comprising
the
steps
of:
determining
an
initial
value
for
each
of
the
variables
of
the
objective
function
such
that
an
initial
vector
defined
by
the
initial
values
resides
inside
a
polytope
defined
by
the
constraint
relationships,
(2
-rrb-transforming
transforming
the
polytope,
the
initial
vector
and
the
constraint
relationships,
into
a
simplex
≧0,
≧xi,
in
which
the
transformed
initial
vector
is
located
substantially
at
the
center
of
the
simplex,
(3
-rrb-project
projecting
transformed
vector
of
the
objective
function
orthogonally
onto
the
address
space
of
the
transformed
constraint
relationships,
(4
-rrb-determining
determining
direction
of
the
projection
of
the
transformed
objective
function,
(5
-rrb-determining
determining
new
value
for
each
of
the
variables
of
the
objective
function
by
moving
from
the
center
e/n
of
the
simplex,
a
distance
equal
to
a
predefined
multiple
of
the
radius
of
the
largest
sphere
contained
within
the
simplex
and
centerred
at
the
origin
of
the
transformed
initial
vector,
(6
-rrb-transforming
transforming
new
values
back
into
the
original
variables,
(7
-rrb-repeating
repeating
(2
-rrb-through
(6
),
substituting
the
new
values
for
the
initial
values
of
the
objective
function
variables,
until
a
network
minimization
of
the
objective
function
is
obtained,
and
(8
-rrb-allocating
system
resources
to
the
individual
system
entities
according
to
the
final
values
of
the
elements
of
the
objective
function,
wherein
step
(2
-rrb-further
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
relationships,
and
adding
an
additional
lowermost
row
to
matrix
b
containing
a
value
of
unity
in
each
matrix
position
of
the
row.

9.
A
changing
and
a
known
variable
coefficient,
and
by
one
or
more
constraint
relationships
expressed
in
terms
of
one
or
more
of
the
variables
of
the
objective
function,
the
channel
method
comprising
the
steps
of:
determining
an
initial
value
for
each
of
the
variables
of
the
objective
function
such
that
an
initial
vector
defined
by
the
initial
values
resides
inside
a
polytope
defined
by
the
constraint
relationships,
(2
-rrb-transforming
transforming
the
polytope,
the
initial
vector
and
the
constraint
relationships,
into
a
simplex
≧0,
≧xi,
in
which
the
transformed
initial
vector
is
located
substantially
at
the
center
of
the
simplex,
(3
-rrb-project
projecting
transformed
vector
of
the
objective
function
orthogonally
onto
the
address
space
of
the
transformed
constraint
relationships,
(4
-rrb-determining
determining
direction
of
the
projection
of
the
transformed
objective
function,
(5
-rrb-determining
determining
new
value
for
each
of
the
variables
of
the
objective
function
by
moving
from
the
center
e/n
of
the
simplex,
a
distance
equal
to
a
predefined
multiple
of
the
radius
of
the
largest
sphere
contained
within
the
simplex
and
centerred
at
the
origin
of
the
transformed
initial
vector,
(6
-rrb-transforming
transforming
new
values
back
into
the
original
variables,
(7
-rrb-repeating
repeating
(2
-rrb-through
(6
),
substituting
the
new
values
for
the
initial
values
of
the
objective
function
variables,
until
a
network
minimization
of
the
objective
function
is
obtained,
and
(8
-rrb-allocating
system
resources
to
the
individual
system
entities
according
to
the
final
values
of
the
elements
of
the
objective
function,
wherein

- step (2 -rrb-further 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 relationships, and adding an additional lowermost row to matrix b containing a value of unity in each matrix position of the row,

- step (3 -rrb-further comprises the step of: computing the orthogonal projection of the transformed initial vector from the matrix equation [i-bt (bbt )- 1 b] times the initial vector, where i is the identity matrix, and bt is the transpose of the b matrix, and normalizing the orthogonal projection in a predefined manner.

- step (2 -rrb-further 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 relationships, and adding an additional lowermost row to matrix b containing a value of unity in each matrix position of the row,

- step (3 -rrb-further comprises the step of: computing the orthogonal projection of the transformed initial vector from the matrix equation [i-bt (bbt )- 1 b] times the initial vector, where i is the identity matrix, and bt is the transpose of the b matrix, and normalizing the orthogonal projection in a predefined manner.