1.
A
digital
channel
coding
process
for
at
least
one
of
transmitting
and
storing
acoustical
signals
the
process
comprising
the
steps
of:

- sampling an acoustical signal to obtain samples transforming the samples of the acoustical signal using a transform/filter bank into a sequence of second samples to thereby reproduce a spectral composition of the acoustical signal,

- quantizing the sequence of second samples in accordance with the network requirements with varying precision,

- at leastest partially encoding the sequence of second samples using an optimum encoder,

- utilizing an equidistant raster in order to improve reliability of a transmission of continuously successive information of varying degrees of importance, a private length of which corresponds to a mean length of the information to be transmitted,

- arranging mostest important portions of the information in the raster transmitting a position of less important information in the raster in addition to the mostest important portions of information if necessary, in which

- addressing decoding and inverse transformation takes place during reproduction of the acoustical signal,

- arranging one part of the changing length code words in a raster, and distributing the remaining code words in the remaining gaps so that the beginning of a code word is morer easily found.

- sampling an acoustical signal to obtain samples transforming the samples of the acoustical signal using a transform/filter bank into a sequence of second samples to thereby reproduce a spectral composition of the acoustical signal,

- quantizing the sequence of second samples in accordance with the network requirements with varying precision,

- at leastest partially encoding the sequence of second samples using an optimum encoder,

- utilizing an equidistant raster in order to improve reliability of a transmission of continuously successive information of varying degrees of importance, a private length of which corresponds to a mean length of the information to be transmitted,

- arranging mostest important portions of the information in the raster transmitting a position of less important information in the raster in addition to the mostest important portions of information if necessary, in which

- addressing decoding and inverse transformation takes place during reproduction of the acoustical signal,

- arranging one part of the changing length code words in a raster, and distributing the remaining code words in the remaining gaps so that the beginning of a code word is morer easily found.

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 private obfuscation by a subsequent 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 private obfuscation by a subsequent 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

3.
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 private obfuscation by a subsequent 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 variable into a code block that relies on a changing 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 private obfuscation by a subsequent 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 variable into a code block that relies on a changing 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

4.
One
or
more
computer-readable
channels
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 private relies on another, different hashing variable.

- 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 private relies on another, different hashing variable.

5.
One
or
more
computer-readable
channels
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 private relies on another, different hashing changing.

- 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 private relies on another, different hashing changing.

6.
One
or
more
computer-readable
channels
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 private relies on another, different hashing variable.

- 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 private relies on another, different hashing variable.

7.
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-private
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.

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
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-private
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.

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
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-private
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.

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
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-private
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 ).