20 resultados para elliptic curve cryptography

em Bulgarian Digital Mathematics Library at IMI-BAS


Relevância:

100.00% 100.00%

Publicador:

Resumo:

* Work is partially supported by the Lithuanian State Science and Studies Foundation.

Relevância:

80.00% 80.00%

Publicador:

Resumo:

2000 Mathematics Subject Classification: 11G15, 11G18, 14H52, 14J25, 32L07.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

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 girth and their cryptographical applications. It contains new explicit algebraic constructions of in finite families of such graphs. We show that they can be used for the implementation of secure and very fast symmetric encryption algorithms. The symbolic computations technique allow us to create a public key mode for the encryption scheme based on algebraic graphs.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

The aim of this paper is to study a generalized form of elliptic-type integrals which unify and extend various families of elliptic-type integrals studied recently by several authors. In a recent communication [1] we have obtained recurrence relations and asymptotic formula for this generalized elliptic-type integral. Here we shall obtain some more results which are single and multiple integral formulae, differentiation formula, fractional integral and approximations for this class of generalized elliptic-type integrals.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

∗ This research is partially supported by the Bulgarian National Science Fund under contract MM-403/9

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Recognition of the object contours in the image as sequences of digital straight segments and/or digital curve arcs is considered in this article. The definitions of digital straight segments and of digital curve arcs are proposed. The methods and programs to recognize the object contours are represented. The algorithm to recognize the digital straight segments is formulated in terms of the growing pyramidal networks taking into account the conceptual model of memory and identification (Rabinovich [4]).

Relevância:

20.00% 20.00%

Publicador:

Resumo:

2000 Mathematics Subject Classification: 35J40, 49J52, 49J40, 46E30

Relevância:

20.00% 20.00%

Publicador:

Resumo:

2000 Mathematics Subject Classification: Primary 34C07, secondary 34C08.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

2000 Mathematics Subject Classification: Primary 14H55; Secondary 14H30, 14H40, 20M14.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Николай Кутев, Величка Милушева - Намираме експлицитно всичките би-омбилични фолирани полусиметрични повърхнини в четиримерното евклидово пространство R^4

Relevância:

20.00% 20.00%

Publicador:

Resumo:

2010 Mathematics Subject Classification: Primary 35S05; Secondary 35A17.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

2010 Mathematics Subject Classification: 35B65, 35S05, 35A20.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

2010 Mathematics Subject Classification: Primary 35J70; Secondary 35J15, 35D05.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

2010 Mathematics Subject Classification: 74J30, 34L30.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

2010 Mathematics Subject Classification: 35J65, 35K60, 35B05, 35R05.