931 resultados para cryptographic pairing computation, elliptic curve cryptography


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:

Functional programming has a lot to offer to the developers of global Internet-centric applications, but is often applicable only to a small part of the system or requires major architectural changes. The data model used for functional computation is often simply considered a consequence of the chosen programming style, although inappropriate choice of such model can make integration with imperative parts much harder. In this paper we do the opposite: we start from a data model based on JSON and then derive the functional approach from it. We outline the identified principles and present Jsonya/fn — a low-level functional language that is defined in and operates with the selected data model. We use several Jsonya/fn implementations and the architecture of a recently developed application to show that our approach can improve interoperability and can achieve additional reuse of representations and operations at relatively low cost. ACM Computing Classification System (1998): D.3.2, D.3.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.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

We propose a new approach for secret key exchange involving the variation of the cavity length of an ultra-long fibre laser. The scheme is based on the realisation that the free spectral range of the laser cavity can be used as an information carrier. We present a proof-of-principle demonstration of this new concept using a 50-km-long fibre laser to link two users, both of whom can randomly add an extra 1-km-long fibre segment.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

2002 Mathematics Subject Classification: 35J15, 35J25, 35B05, 35B50

Relevância:

20.00% 20.00%

Publicador:

Resumo:

2000 Mathematics Subject Classification: 94A29, 94B70

Relevância:

20.00% 20.00%

Publicador:

Resumo:

ACM Computing Classification System (1998): G.1.1, G.1.2.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

This article shows the social importance of subsistence minimum in Georgia. The methodology of its calculation is also shown. We propose ways of improving the calculation of subsistence minimum in Georgia and how to extend it for other developing countries. The weights of food and non-food expenditures in the subsistence minimum baskets are essential in these calculations. Daily consumption value of the minimum food basket has been calculated too. The average consumer expenditures on food supply and the other expenditures to the share are considered in dynamics. Our methodology of the subsistence minimum calculation is applied for the case of Georgia. However, it can be used for similar purposes based on data from other developing countries, where social stability is achieved, and social inequalities are to be actualized. ACM Computing Classification System (1998): H.5.3, J.1, J.4, G.3.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

In the proof of Lemma 3.1 in [1] we need to show that we may take the two points p and q with p ≠ q such that p+q+(b-2)g21(C′)∼2(q1+… +qb-1) where q1,…,qb-1 are points of C′, but in the paper [1] we did not show that p ≠ q. Moreover, we hadn't been able to prove this using the method of our paper [1]. So we must add some more assumption to Lemma 3.1 and rewrite the statements of our paper after Lemma 3.1. The following is the correct version of Lemma 3.1 in [1] with its proof.