Wyniki wyszukiwania - BazTech

1

Liczby podwójne i ich modyfikacje w neurokryptografii

Płonkowski M., Urbanowicz P.

Przegląd Elektrotechniczny

|

2012

|

R. 88, nr 11b

340-341

PL

Nowym kierunkiem badań nad sieciami neuronowymi jest neurokryptografia, która wykorzystuje aparat sieci neuronowych w rozwiązaniach kryptograficznych. Jednym z ważniejszych jej aspektów jest zastosowanie architektur TPM (Tree Parity Machine) w protokole uzgadniania klucza. W niniejszym artykule zostanie opisana konstrukcja architektury TPSCM (Tree Parity Split–Complex Machine) oparta o strukturę algebraiczną liczb podwójnych.

EN

A new field of research on neural networks, which uses neural network methods in cryptographic solutions is known as neural cryptography. One of its most important aspects is the application of the TPM (Tree Parity Machine) architectures in the key exchange protocol. This article describes the TPSCM (Tree Parity Split–Complex Machine) architecture based on the algebraic structure of the split-complex numbers and is founded on the classic TPM model.

2

The implementation of cubic public keys based on a new family of algebraic graphs

Klisowski M., Romańczuk U., Ustimenko V.

Annales Universitatis Mariae Curie-Skłodowska. Sectio AI, Informatica

|

2011

|

Vol. 11, no. 2

127--141

EN

Families of edge transitive algebraic graphs defined over finite commutative rings were used for the development of stream ciphers, public key cryptosystems and key exchange protocols. We present the results of the first implementation of a public key algorithm based on the family of algebraic graphs, which are not edge transitive. The absence of an edge transitive group of symmetries means that the algorithm can not be described in group theoretical terms. We hope that it licates cryptanalysis of the algorithm. We discuss the connections between the security of algorithms and the discrete logarithm problem.The plainspace of the algorithm is Kn, where K is the chosen commutative ring. The graph theoretical encryption corresponds to walk on the bipartite graph with the partition sets which are isomorphic to Kn. We conjugate the chosen graph based encryption map, which is a composition of several elementary cubical polynomial automorphisms of a free module Kn with special invertible affine transformation of Kn. Finally we compute symbolically the corresponding cubic public map g of Kn onto Kn. We evaluate time for the generation of g, and the number of monomial expression in the list of corresponding public rules.

3

Secure time information in the internet key exchange protocol

Szałachowski P., Kotulski Z.

Annales Universitatis Mariae Curie-Skłodowska. Sectio AI, Informatica

|

2011

|

Vol. 11, no. 3

41--56

EN

Many network services and protocols can work correctly only when freshness of messages sent between participants is assured and when the protocol parties’ internal clocks are adjusted. In this paper we present a novel, secure and fast procedure which can be used to ensure data freshness and clock synchronization between two communicating parties. Next, we show how this solution can be used in other cryptographic protocols. As an example of application we apply our approach to the Internet Key Exchange (IKE) protocol family.