Features | Benefits |
---|---|
Industry Performance | High performance streaming algorithm |
Large internal key | Uses a 524,288 bit key internally |
Continuous Fractal Mapping | Fractal value based shift registers |
Fast Fractal initialisation | Single fractal key initialisation |
Indefinite Transform Mutation | The fractal stream morphs indefinitely |
Portalz Fractal Streaming differs from standard fractal transformation for performance optimisation.
Fractal Transformation | Fractal Streaming |
---|---|
Fractal stream matches payload size | Fixed length 524,288 bit fractal stream |
Fractal Stream directly transforms payload | Fractal shift registers morph the payload |
Fractal iteration overhead matches payload size | Single fractal iteration initialisation |
Highest security for documents and key stores | High security for continuous data streaming performance |
Both encryption technologies are impenetrable and Quantum Proof.
Portalz Fractal Streaming generates a fractal key that is used to secure the payload stream.
This is a single initialisation performed prior to stream transformation.
The Bit Streaming Key is traversed in bytes, there being a total of 65,536 bytes.
We use a list of 256 prime numbers between 11 and 65,536, and use the last fractal byte to select one.
The selected prime number is used to 'cut' the fractal buffer at the prime number location.
The use of primes ensures no segment of the fractal stream is ever reused in the same sequence.
Each 256 byte scan (above) applies each fractal value to a corresponding shift buffer using XOR.
The resulting shift buffer value is then applied to the stream payload in sequence using XOR.
The shift buffer is 'cut' using the first value of each fractal buffer scan every time it jumps to a new scan position.
The shift buffer increases entropy and isolates the transformation from the fractal stream.
The Fractal Streaming processes are performance optimised and well suited to direct memory manipulation.
Once the fixed fractal buffer is generated or retrieved from a cache, the stream transformation does not need to perform fractal value or navigation computations.
The stream transformation is highly efficient and scalable.
![]() |
Copyright © 2025 All Rights Reserved |
Contact: [email protected] |