Ergodic Hyperbolic Attractors of Endomorphisms

Let μ be an SRB-measure on an Axiom A attractor Δ of a C ²-endomorphism (M, f). As is known, μ-almost every x ϵ Δ is positively regular and the Lyapunov exponents of (f, T f) at x are constants λ⁽ⁱ⁾(f, μ), 1 ≤ i ≤ s. In this paper, we prove that Lebesgue-almost every x in a small neighborhood of Δ is positively regular and the Lyapunov exponents of (f, T f) at x are the constants λ⁽ⁱ⁾(f, μ), 1 ≤ i ≤ s. This result is then generalized to nonuniformly completely hyperbolic attractors of endomorphisms. The generic property of SRB-measures is also proved. 2000 Mathematics Subject Classification. 37D20, 37D25, 37C40. This work was supported by the 973 Funds of China for Nonlinear Science, the NSFC 10271008, and the Doctoral Program Foundation of the Ministry of Education.     

Fast Multiplication on Elliptic Curves over Small Fields of Characteristic Two

We discuss new algorithms for multiplying points on elliptic curves defined over small finite fields of characteristic two. This algorithm is an extension of previous results by Koblitz, Meier, and Staffelbach. Experimental results show that the new methods can give a running time improvement of up to 50 % compared with the ordinary binary algorithm for multiplication. Finally, we present a table of elliptic curves, which are well suited for elliptic curve public key cryptosystems, and for which the new algorithm can be used. Received 14 January 1997 and revised 4 September 1997     

Minimization of states in automata theory based on finite lattice-ordered monoids

In this study, we consider a concept of complete L-fuzzy matrix, define complete lattice-valued finite automata (CLFAs) and study their properties. The definitions of statewise equivalence relations and automata equivalence relations of a CLFA are given, two algorithms are aimed at the minimization of states of a CLFA.     

Modelling concurrency with comtraces and generalized comtraces

Comtraces (combined traces) are extensions of Mazurkiewicz traces that can model the “not later than” relationship. In this paper, we first introduce the novel notion of generalized comtraces, extensions of comtraces that can additionally model the “non-simultaneously” relationship. Then we study some basic algebraic properties and canonical representations of comtraces and generalized comtraces. Finally we analyze the relationship between generalized comtraces and generalized stratified order structures. The major technical contribution of this paper is a proof showing that generalized comtraces can be represented by generalized stratified order structures.     

Monoid-labeled transition systems

Given a -complete (semi)lattice , we consider -labeled transition systems as coalgebras of a functor ⁽⁻⁾, associating with a set X the set ^X of all -fuzzy subsets. We describe simulations and bisimulations of -coalgebras to show that L⁽⁻⁾ weakly preserves nonempty kernel pairs iff it weakly preserves nonempty pullbacks iff L is join infinitely distributive (JID).Exchanging for a commutative monoid , we consider the functor ⁽⁻⁾_ω which associates with a set X all finite multisets containing elements of X with multiplicities m M. The corresponding functor weakly preserves nonempty pullbacks along injectives iff 0 is the only invertible element of , and it preserves nonempty kernel pairs iff is refinable, in the sense that two sum representations of the same value, r₁ + … + r_m = c₁ + … + c_n, have a common refinement matrix (m_{(i, j)}) whose k-th row sums to r_k and whose l-th column sums to c_l for any 1≤ k ≤ m and 1 ≤ l ≤ n.     

格值树自动机与格值上下文无关树文法的等价性

本文将模糊树自动机和模糊上下文无关树文法的概念推广到格半群上。证明了在接受语言和生成语言的意义下,树自动机和上下文无关树文法是等价的。同时给出了构造正规形式的等价文法的方法。     

定常约束力学系统的相空间上的联络

提出动力学流关于切丛上联络的一种协变性，求出定常约束力学系统的联络，其测地线方程为系统的运动方程，该联络由系统的动力学函数和约束确定且当动力学流为二阶齐次时约化为通常的动力学联络。     

Two fast algorithms for computing point scalar multiplications on elliptic curves

The key operation in Elliptic Curve Cryptosystems(ECC) is point scalar multiplication. Making use of Frobenius endomorphism, Mfiller and Smart proposed two efficient algorithms for point scalar multiplications over even or odd finite fields respectively. This paper reduces thec orresponding multiplier by modulo τ^k-1 … τ 1 and improves the above algorithms. Implementation of our Algorithm 1 in Maple for a given elliptic curve shows that it is at least as twice fast as binary method. By setting up a precomputation table, Algorithm 2, an improved version of Algorithm 1, is proposed. Since the time for the precomputation table can be considered free, Algorithm 2 is about (3/2) log2 q - 1 times faster than binary method for an elliptic curve over Fq.     

椭圆曲线密码标量乘的φ-NAFw分解

对于GF（p）上的椭圆曲线的标量乘计算,Ciet通过引入特征多项式为φ2＋2=0的自同态φ,提出一种整数k的φ-NAF分解。对φ-NAF分解使用窗口技术得到k的φ-NAFw分解,通过一定量的存储可以获取更快的计算速度。对该分解的长度和Hamming密度进行较为准确的估计。     

关于一类图的自同态谱的研究

对一个图而言,有各种不同的自同态。德国数学家Knauer于1990年在文献[1]中首次提出了自同态谱和自同态型的概念,目的是通过图的各种不同的自同态来研究图的代数结构。文献[2]运用自同态型对树进行了刻画,而文献[3]3对直径为3围长为6的2-部图作了讨论,井得到了这类图的自同态型。本文将给出奇圈及其补图的自同态谱和自同态型。