Efficient digital certificate verification in wireless public key infrastructure using enhanced certificate revocation list

ABSTRACT

Public key cryptography is widely used for secure data transfer in various applications. The Public key infrastructure provides a foundation that supports public key cryptography, and it is required to deliver the public keys to existing systems or users securely. The public key is exchanged digitally in the form of digital certificates having a certain period of validity. Circumstances may arise under which the validity of the certificates should be ceased, and they need to be revoked. The fast growth of e-commerce demands verification and data transfers to be done in minimum time to maintain high efficiency of communication. In this paper, a new method of developing certificate revocation lists is proposed. The formal model of enhanced PKI for mobile commerce security is put forward. The performance of NTRU is compared with the RSA algorithm and the ElGamal algorithm. The paper also sets forth a comparative analysis of the proposed method with other existing techniques. The results show that the proposed technology has the upper hand over the current methods.     

基于平衡因子的AVL树设计实现

平衡二叉树又称AVL树,得名于它的发明者G．M．Adelson—Velsky和E．M．Landis。作为一种常用的数据结构,许多教科书都详细描述了实现的算法,但是基本都是根据不同树形LL、RR、LR、RL给出相应逻辑,而且都是直接给出结论。而文中则以平衡因子为出发点,揭示了不同树形的一致性算法,第一次以数学公式推演,论证了AVL插入和删除操作在不同树形情况下,哪个节点开始失去平衡,怎么平衡以及哪个节点平衡结束,并给出算法的完整实现代码,使AVL的实现一致、简单、易懂。     

基于STL文件的曲面网格重建算法

利用STL文件的数据相关性以及平衡二叉(AVL)树的数据搜索效率仅与树的高度相关的特性,提出一种高效的三角形曲面网格模型重建算法。该算法可以解决STL文件存在大量的冗余、使用效率不高等问题。实验结果证明,与基于AVL树的顶点快速聚合算法相比,该算法的重建效率更高。     

An efficient algorithm for estimating rotation distance between two binary trees

There are a number of ways of measuring the difference in shape between two rooted binary trees with the same number of leaves. Pallo (Computer Journal, 9, 171–175, 1986) introduced a left weight sequence, which is a sequence of positive integers, to characterize the structure of a binary tree. By applying the AVL tree transformation on binary trees, we develop an algorithm for the efficient transformation of the left weight sequences between two binary trees.     

分布式内存数据库在变电站自动化系统中应用

变电站自动化系统需要使用内存数据库对实时数据进行存取。提出采用稳定、高性能的分布式内存数据库SH_MemDB,该数据库基于构造平衡二叉排序(AVL)树建立索引结构以加快各种操作的速度和确保紧密的数据结构。介绍了内存数据库记录分配所采用的动态、静态分配相结合的方法。对于每个二维表对象系统创建了内存缓冲池链表,每个缓冲池中含有2个队列,用于分配和回收内存数据。二维表对象通过提供的应用编程接口(API)创建,并可通过结构化查询语言(SQL)操作记录。为保证多个进程可以共享实时数据库的资源,系统中以二维表为单位进行加锁操作。SH_MemDB可以通过以服务方式或守护者进程方式单独运行,并给出了SQL方式和使用API对内存数据库操作的代码。介绍了SH_MemDB服务方式的应用实例。     

发动机关键配气相位角的分析与优化

发动机的四个配气相位角中,排气提前角和进气晚关角最为重要。运用AVL BOOST软件建立了某款汽油发动机的数值仿真模型,根据台架实验数据对模型进行了标定。保持原气门重叠角和升程不变,按每5°CA的间隔分别对排气提前角和进气晚关角进行改变,研究不同排气提前角和进气晚关角对发动机不同转速扭矩和功率的影响规律,确定最佳的排气提前角和进气晚关角。经过优化发动机的最大扭矩提高了5.39N·M,最大功率提高了2.82kW。     

甲醇喷油器结构参数对液力响应的正交试验研究

甲醇喷油器作为高压共轨喷射系统的核心部件,其性能优劣对甲醇发动机的各项特性有重要影响。通过对甲醇喷油器主要结构进行数学建模,得出影响液力响应的结构参数。利用AVL Hydsim软件对甲醇喷油器建立了仿真计算模型,结果表明:进油孔孔径、柱塞直径、针阀直径、柱塞弹簧预紧力是影响喷油器液力响应的4个关键因素。由此,选择合理范围的结构参数进行正交试验,得出各个参数对喷油器液力响应各个阶段的影响程度,其中进油孔孔径对液力响应4个动态指标影响均极为显著,由此优选出最佳参数。优化方案对提高液力响应有明显的效果。     

端口扫描的异常检测

一般的端口扫描检测,定义扫描是T秒内来自同一个IP地址的X个连接。这个检测规则带有很大的局限性。由此提出了一种基于概率统计的异常检测方法,它能有效地检测到缓慢扫描和分布式扫描。     

An evaluation of self-adjusting binary search tree techniques

Much has been said in praise of self-adjusting data structures, particularly self-adjusting binary search trees. Self-adjusting trees are most suited to skewed key-access distributions as the techniques attempt to place the most commonly accessed keys near the root of the tree. Theoretical bounds on worst-case and amortized performance (i.e. performance over a sequence of operations) have been derived which compare well with those for optimal binary search trees. In this paper, we compare the performance of three different techniques for self-adjusting trees with that of AVL and random binary search trees. Comparisons are made for various tree sizes, levels of key-access-frequency skewness and ratios of insertions and deletions to searches. The results show that, because of the high cost of maintaining self-adjusting trees, in almost all cases the AVL tree outperforms all the self-adjusting trees and in many cases even a random binary search tree has better performance, in terms of CPU time, than any of the self-adjusting trees. Self-adjusting trees seem to perform best in a highly dynamic environment, contrary to intuition.     

Query costs in HB(1) trees versus 2–3 trees

Query costs in random AVL trees are compared to those in random 2–3 trees. Both data structures are assumed to reside in main storage. Costs are calculated in terms of the number of node visits and key comparisons required to find a match or no match for a given key. The comparison is based upon theoretical concepts and implementation dependent considerations; e.g., data and instruction fetch. It is shown that if the cost of a key comparison is greater than or equal to the cost of a node access, then AVL trees are more advantageous.