All a b c d e f g h i j k l m n o p q r s t u v w x y z Other

Previous Page 4 Next

Displaying 61 – 80 of 105

Showing per page

Nonassociative algebras: some applications.

Santos González, Consuelo Martínez (2003)

Revista Matemática Iberoamericana

Nonassociative algebras can be applied, either directly or using their particular methods, to many other branches of Mathematics and other Sciences. Here emphasis will be given to two concrete applications of nonassociative algebras. In the first one, an application to group theory in the line of the Restricted Burnside Problem will be considered. The second one opens a door to some applications of non-associative algebras to Error correcting Codes and Cryptography.

On Distributed Oblivious Transfer

Nikov, Ventzislav, Nikova, Svetla, Preneel, Bart (2007)

Serdica Journal of Computing

The paper has been presented at the International Conference Pioneers of Bulgarian Mathematics, Dedicated to Nikola Obreshkoff and Lubomir Tschakaloff , Sofia, July, 2006. The material in this paper was presented in part at INDOCRYPT 2002This paper is about unconditionally secure distributed protocols for oblivious transfer, as proposed by Naor and Pinkas and generalized by Blundo et al. In this setting a Sender has ζ secrets and a Receiver is interested in one of them. The Sender distributes the...

On Graph-Based Cryptography and Symbolic Computations

V. A., Ustimenko (2007)

Serdica Journal of Computing

We have been investigating the cryptographical properties of in nite families of simple graphs of large girth with the special colouring of vertices during the last 10 years. Such families can be used for the development of cryptographical algorithms (on symmetric or public key modes) and turbocodes in error correction theory. Only few families of simple graphs of large unbounded girth and arbitrarily large degree are known. The paper is devoted to the more general theory of directed graphs of large...

On Proactive Verifiable Secret Sharing Schemes

Nikov, Ventzislav, Nikova, Svetla, Preneel, Bart (2007)

Serdica Journal of Computing

The paper has been presented at the International Conference Pioneers of Bulgarian Mathematics, Dedicated to Nikola Obreshkoff and Lubomir Tschakaloff , Sofia, July, 2006. The material in this paper was presented in part at the 11th Workshop on Selected Areas in Cryptography (SAC) 2004This paper investigates the security of Proactive Secret Sharing Schemes. We first consider the approach of using commitment to 0 in the renewal phase in order to refresh the player's shares and we present two types of...

On the anti–synchronization detection for the generalized Lorenz system and its applications to secure encryption

Volodymyr Lynnyk, Sergej Čelikovský (2010)

Kybernetika

In this paper, a modified version of the Chaos Shift Keying (CSK) scheme for secure encryption and decryption of data will be discussed. The classical CSK method determines the correct value of binary signal through checking which initially unsynchronized system is getting synchronized. On the contrary, the new anti-synchronization CSK (ACSK) scheme determines the wrong value of binary signal through checking which already synchronized system is loosing synchronization. The ACSK scheme is implemented...

On the invertibility of finite linear transducers

Ivone Amorim, António Machiavelo, Rogério Reis (2014)

RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications

Linear finite transducers underlie a series of schemes for Public Key Cryptography (PKC) proposed in the 90s of the last century. The uninspiring and arid language then used, condemned these works to oblivion. Although some of these schemes were afterwards shown to be insecure, the promise of a new system of PKC relying on different complexity assumptions is still quite exciting. The algorithms there used depend heavily on the results of invertibility of linear transducers. In this paper we introduce...

On the joint 2-adic complexity of binary multisequences

Lu Zhao, Qiao-Yan Wen (2012)

RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications

Joint 2-adic complexity is a new important index of the cryptographic security for multisequences. In this paper, we extend the usual Fourier transform to the case of multisequences and derive an upper bound for the joint 2-adic complexity. Furthermore, for the multisequences with pn-period, we discuss the relation between sequences and their Fourier coefficients. Based on the relation, we determine a lower bound for the number of multisequences with given joint 2-adic complexity.

On the joint 2-adic complexity of binary multisequences∗

Lu Zhao, Qiao-Yan Wen (2012)

RAIRO - Theoretical Informatics and Applications

Joint 2-adic complexity is a new important index of the cryptographic security for multisequences. In this paper, we extend the usual Fourier transform to the case of multisequences and derive an upper bound for the joint 2-adic complexity. Furthermore, for the multisequences with pn-period, we discuss the relation between sequences and their Fourier coefficients. Based on the relation, we determine a lower bound for the number of multisequences...

Currently displaying 61 – 80 of 105