The description below is simplified and does not reflect the many different implementations fully. The purpose is to describe the main flows.


How it works:

I. A initiates a session by connecting to the access server (AS). The server then authenticates A. If A is a Kelisec member the AS initiates communication with B which also will be authenticated in a similar process. Each node has a unique DNA. The two unique elements are blended in the AS. The blended DNA is irreversible. A secure session has been established.

II. The next step is to transport the blended DNA to the nodes. The function of the AS is switched off and the server instead functions as a seed server. The seed server is fed by different fractal elements. There is no specific point in the solution where the complete solution is stored or created. Random bits are applied to the information. The random bits will never be the same in A or B. The information flow then mutates constantly. The blended DNA cannot be sent unprotected. Kelisec solves this by encrypting the blended DNA.

III. There are now two blended and encrypted DNAs available in the seed server. The ingenious aspect of creating the blended DNA with A’s and B’s DNA is that node A and B, and only A and B, can decrypt the information, since A receives the part encrypted with DNAA and B receives the part encrypted with DNAB. No secret is shared.

IV. The same procedure is now applied in both nodes to find 256 positions (for 512-bits) in the blended DNA. This procedure is configurable! To exemplify: the initiating node A uses position 2,4,…512, and node B uses 1,3,...511.

V. The positions will be used as an index in our blended DNA and will generate a polymorphic string. The positions are merged into a list 2,4,...512,1,3,..511 For example, suppose the blended DNA is 1010001100101000011… Then the polymorphic string will begin with 0001… i.e. the values of positions 2,4,6,8… in the blended DNA.

Configurable parameters:

There are a number of configurable variables in the implementation, for example:

  • Key length, no upper limit.
  • Choice of random number generators.
  • Time stamp application.
  • blended DNA is configurable.
  • Mutation frequency.
  • Adding metadata (up to 8Mb)