Wyniki wyszukiwania - BazTech

Ograniczanie wyników

Znaleziono wyników: 2

Liczba wyników na stronie

Wyniki wyszukiwania

Sortuj według:

Ogranicz wyniki do:

Nonnegativity, stability analysis of linear discrete-time positive descriptor systems: an optimization approach

Yang H., Zhou M., Zhao M., Pan P.

Bulletin of the Polish Academy of Sciences. Technical Sciences

2018

Vol. 66, nr 1

1--7

This paper discusses an efficient approach to the analysis of positivity and stability of linear discrete-time positive descriptor system. Irs main objective is to convert the necessary and sufficient condition of characterizing positivity and stability of positive descriptor systems into an optimization problem, then propose a method to numerically check the positivity and stability of the positive linear discrete-time systems. Comparing with the other methods now available, the approach presented in this paper is less theoretical and easier to implement. Examples are provided in order to validate results.

Chameleon Hash Functions and One-Time Signature Schemes from Inner Automorphism Groups

Pan P., Wang L., Yang Y., Gan Y., Wang L., Xu C.

Fundamenta Informaticae

2013

Vol. 126, nr 1

103--119

In this paper, we build a family of chameleon hash functions and strongly unforgeable one-time signature schemes based on the intractability assumption of the discrete logarithm problem (DLP) over inner automorphism groups. Since the DLP assumption over inner automorphism groups does not admit sub-exponential attacks, thus the sizes of the working parameters used in our constructions are shorten significantly. This leads to remarkable gains for our proposals both in running time and in storage space. In addition, as far as we know, this is the first time to build CHF and OTS based on noncommutative groups.