混沌数字签名算法与安全性分析

结合混沌系统与RSA数字签名技术的设计方法,提出了一种基于类Hénon混沌映射的数字签名方案.该方案用混沌Hash函数代替传统的Hash函数,这种混沌Hash函数具有不可逆性、防伪性、初值敏感性,而且充分利用了混沌系统对初始条件的敏感性和迭代过程的单向性,使得Hash结果的每一比特都与明文有着敏感和复杂的关系.这样的Hash函数在混乱和散布性质上更加安全,抵抗攻击的能力更强,有较高的抗碰撞能力.     

基于串核的音乐风格聚类

给出了一种新的映射音乐到R°空间的方法和基于串核的音乐风格聚类法.利用统计方法分析大量音乐的旋律轮廓线得到合适的编码模式,用它把旋律轮廓线编码为有限字母表(8个字母)的字符串.利用连续子串嵌入法把音乐串显式映射到高维R°空间,并用核表示这一映射.通过用基于核的山方法选择聚类的适合初始点,最后使用基于核的K-means方法聚类音乐数据集,比较了3个不同串核在5个音乐数据集上的聚类性能.     

面向大规模数据快速聚类K-means算法的研究

为进一步提高K-means算法对大规模数据聚类的效率,结合MapReduce计算模型,提出一种先利用Hash函数进行样本抽取,再利用Pam算法获取初始中心的并行聚类方法。通过Hash函数抽取的样本能充分反映数据的统计特性,使用Pam算法获取初始聚类中心,改善了传统聚类算法依赖初始中心的问题。实验结果表明该算法有效提高了聚类质量和执行效率,适用于对大规模数据的聚类分析。     

基于模糊聚类的侦察数据分析方法

利用模糊聚类方法对案件侦察数据进行了分析,解决了侦察数据自动聚类分析问题.重点探讨了侦察数据模型的建立和聚类过程,以及根据类密度均匀、类间有断裂层设计了一个隶属度函数,从而确立了数据对象的隶属关系,并给出了一个具体的模糊聚类算法.该方法能够对侦察数据进行合理分类,分类效果比较明显.并且,在真实的刑事案件侦破过程中得到了应用,应用效果良好.     

利用自组织特征映射神经网络进行可视化聚类

自组织特征映射作为一种神经网络方法，在数据挖掘、机器学习和模式分类中得到了广泛的应用。它将高维输人空间的数据映射到一个低维、规则的栅格上，从而可以利用可视化技术探测数据的固有特性。该文说明了自组织特征映射神经网络的工作原理和具体实现算法，同时利用一个算例展示了利用自组织特征映射进行聚类时的可视化特性，包括聚类过程的可视化和聚类结果的可视化，这也是自组织特征映射得到广泛应用的原因之一。     

基于自组织聚类的结构化P2P语义路由改进算法

结构化P2P网络是构建于物理网络拓扑之上的一层Overlay网络,两层之间的唯一联系是Hash散列函数,这种Hash关系使得节点的逻辑ID号与物理位置之间不存在任何联系.从分析Hash散列函数的性质入手,归纳出目的节点、传统(chord)语义路由中继节点序列、聚类邻居节点集三者之间的逻辑关联特性,并将其应用于所提出的基于自组织聚类的语义路由改进算法SCSRAA(self-organizing clustering semantic routing advarced algorithm)中,从而达到提高语义路由效率的研究目的.针对自组织模式下聚类节点仅存在局部视图的特性,详细讨论了聚类算法及节点获取其他节点物理位置信息的各种规则,给出了SCSRAA路由算法详尽的描述及理论分析.仿真实验表明,该算法具有较强的语义路由效率提升能力.     

基于核自适应的近邻传播聚类算法

近邻传播聚类(AP)方法是近年来出现的一种广受关注的聚类方法,在处理多类、大规模数据集时,能够在较短的时间得到较理想的结果,因此与传统方法相比具有很大的优势。但是对于一些聚类结构复杂的数据集,往往不能得到很好的聚类结果。通过分析数据的聚类特性,设计了一种可以根据数据结构自动调整参数的核函数,数据集在其映射得到的核空间中线性可分或几乎线性可分,对该核空间中的数据集进行近邻传播聚类,有效提高了AP聚类的精确度和速度。算法有效性分析以及仿真实验验证了所提算法在处理大规模复杂结构数据集上的性能优于原始AP算法。     

密度敏感模糊核最大熵聚类算法EI北大核心CSCD

提出一种密度敏感模糊核最大熵聚类算法.该算法首先通过核函数将原始非线性非高斯的数据集转化为核空间数据集,然后利用核函数的相似性抵消不属于该聚类的样本数据在聚类过程中对聚类中心求解的干扰,消除正则化系数对聚类结果的影响,进而抑制传统最大熵聚类算法的趋同性.最后通过引入相对密度项,解决因样本数据在特征空间的分布差异而导致的聚类中心求解偏差问题,从而提高聚类结果的准确性.实验部分,本文讨论了算法参数间的关系以及对聚类结果的影响.通过与传统模糊C均值聚类算法、核模糊C均值聚类算法、最大熵聚类算法、最大熵规范化权重核模糊C均值聚类算法以及其他两种改进最大熵聚类算法的聚类结果进行对比分析,结果表明本文提出的密度敏感模糊核最大熵聚类算法的聚类性能明显优于其他算法.     

一种基于模糊核聚类的谱聚类算法

谱聚类是对样本拉普拉斯矩阵的特征向量进行聚类,不局限于原始数据的分布形状,可收敛于全局最优解,但不能准确反映样本间的实际关系,而模糊核聚类可利用模糊数学理论确定样本间的模糊关系。为此,在调整相似度度量函数和距离度量函数的基础上,将模糊核聚类融合到谱聚类算法中,提出SC-KFCM算法,利用模糊划分改进谱聚类中的硬划分,根据特征向量间的相似性和关联程度建立模糊隶属关系并对样本进行聚类,从而弥补谱聚类中硬划分部分对聚类结果造成的影响。实验结果表明,SC-KFCM算法在不同分布特点及维数的数据集上均取得了较稳定的聚类结果和较高的聚类精度。     

基于整数耦合帐篷映射的单向Hash函数及其性能分析

提出一种基于整数耦合帐篷映射的单向Hash函数,并对其特性进行了分析.提出的算法采用双向耦合映像格子模型,用整数帐篷映射取代了传统的逻辑函数,具有较为理想的混淆与扩散特性.应用该算法,可将任意长度的明文序列单向散列为160比特Hash值.实验与分析结果表明,这种Hash函数具有很好的单向性、抗碰撞性,满足单向Hash函数的各项性能要求.该算法全部采用有限整数集内的简单位操作完成,便于软硬件实现,并且有高的执行效率.     

利用报文抽样和可逆的Bloom Filter实现长流识别

针对高速网络的发展和利用哈希技术在识别长流时难以还原主机信息的问题,提出了利用报文抽样和可逆的Bloom Filter识别长流的算法.采用带有部分主机信息的哈希函数,利用哈希串的重叠和数量上的一致性,能够很方便的还原出主机的信息.给每个哈希函数独立的存储空间,在很大程度上减少了哈希过程所带来的内部冲突.实验结果表明,这种算法可以精确地获得长流的标识与长度信息.     

Hash函数的安全性研究

Hash函数用于数据完整性和消息认证,需要满足特定的密码学需求,其中最重要的就是抗碰撞。生日攻击是通用的寻找碰撞的方法,可用于攻击任何类型的Hash函数。文章讨论了生日攻击的碰撞阈值,以及平衡度对于碰撞阈值的影响,并指出近似碰撞的碰撞阈值的度量。最后提出了在新的高安全度Hash函数的设计中应该考虑到的几个问题。     

Architecture for a hardware-based, TCP/IP content-processing system

The transmission control protocol is the workhorse protocol of the Internet. Most of the data passing through the Internet transits the network using TCP layered atop the Internet protocol (IP). Monitoring, capturing, filtering, and blocking traffic on high-speed Internet links requires the ability to directly process TCP packets in hardware. High-speed network intrusion detection and prevention systems guard against several types of threats. As the gap between network bandwidth and computing power widens, improved microelectronic architectures are needed to monitor and filter network traffic without limiting throughput. To address these issues, we've designed a hardware-based TCP/IP content-processing system that supports content scanning and flow blocking for millions of flows at gigabit line rates. The TCP splitter2 technology was previously developed to monitor TCP data streams, sending a consistent byte stream of data to a client application for every TCP data flow passing through the circuit. The content-scanning engine can scan the payload of packets for a set of regular expressions. The new TCP-based content-scanning engine integrates and extends the capabilities of the TCP splitter and the old content-scanning engine. IP packets travel to the TCP processing engine from the lower-layer-protocol wrappers. Hash tables are used to index memory that stores each flow's state.     

TCP流的宏观平衡性

TCP流显式的连接建立和关闭过程决定了完整的TCP流的不同类型TCP报文之间在数量关系间保持一种宏观平衡性，这种数量间的约束所表现出的宏观平衡性可以用来揭示网络流量行为规律，识别网络流量行为异常的存在，从而可以成为网络安全监测和网络管理的有效手段之一．文章定义了TCP流宏观平衡性的相关测度，根据TCP流的到达模型和流长模型建立了测量误差的模型，并以此导出了实际测量模型和判断正常与异常的临界点．通过实验和仿真对这些测度进行了分析，证明了这些测度和临界点的可用性．     

Hash functions and triangular mesh reconstruction

Some applications use data formats (e.g. STL file format), where a set of triangles is used to represent the surface of a 3D object and it is necessary to reconstruct the triangular mesh with adjacency information. It is a lengthy process for large data sets as the time complexity of this process is O(N log N), where N is number of triangles. Triangular mesh reconstruction is a general problem and relevant algorithms can be used in GIS and DTM systems as well as in CAD/CAM systems. Many algorithms rely on space subdivision techniques while hash functions offer a more effective solution to the reconstruction problem. Hash data structures are widely used throughout the field of computer science. The hash table can be used to speed up the process of triangular mesh reconstruction but the speed strongly depends on hash function properties. Nevertheless the design or selection of the hash function for data sets with unknown properties is a serious problem. This paper describes a new hash function, presents the properties obtained for large data sets, and discusses validity of the reconstructed surface. Experimental results proved theoretical considerations and advantages of hash function use for mesh reconstruction.     

On the Use of Hash Functions as Preprocessing Algorithms to Detect Defects on Repeating Definite Textures

Hash functions are one way functions and often used in cryptography to ensure the integrity of files by creating a binary signature specific to that file. In a similar way, a family of special hash functions can be developed and used to generate one dimensional signatures of an image. The resultant signatures can then be used to compare the image either to a golden template or, if the image consists of repeating definite patterns, then to the texture itself. While such hash functions are sensitive enough to detect small changes and defects in repeating texture, they are immune to changes in illumination and contrast. In this paper we discuss the generation of suitable hash functions for textured images, which are simple enough to fit into a very small FPGA, and provide several examples of their use.     

An IP Traceback Protocol using a Compressed Hash Table,a Sinkhole Router and Data Mining based on Network Forensics against Network Attacks

The Source Path Isolation Engine (SPIE) is based on a bloom filter. The SPIE is designed to improve the memory efficiency by storing in a bloom filter the information on packets that are passing through routers, but the bloom filter must be initialized periodically because of its limited memory. Thus, there is a problem that the SPIE cannot trace back the attack packets that passed through the routers earlier. To address this problem, this paper proposes an IP Traceback Protocol (ITP) that uses a Compressed Hash Table, a Sinkhole Router and Data Mining based on network forensics against network attacks. The ITP embeds in routers the Compressed Hash Table Module (CHTM), which compresses the contents of a Hash Table and also stores the result in a database. This protocol can trace an attack back not only in real time using a hash table but also periodically using a Compressed Hash Table (CHT). Moreover, the ITP detects a replay attack by attaching time-stamps to the messages and verifies its integrity by hashing it. This protocol also strengthens the attack packet filtering function of routers for the System Manager to update the attack list in the routers periodically and improves the Attack Detection Rate using the association rule among the attack packets with an Apriori algorithm.     

Hardware implementation analysis of SHA-256 and SHA-512 algorithms on FPGAs

Hash functions are common and important cryptographic primitives, which are very critical for data integrity assurance and data origin authentication security services. Field programmable gate arrays (FPGAs) being reconfigurable, flexible and physically secure are a natural choice for implementation of hash functions in a broad range of applications with different area-performance requirements. In this paper, we explore alternative architectures for the implementation of hash algorithms of the secure hash standards SHA-256 and SHA-512 on FPGAs and study their area-performance trade-offs. As several 64-bit adders are needed in SHA-512 hash value computation, new architectures proposed in this paper implement modulo-64 addition as modulo-32, modulo-16 and modulo-8 additions with a view to reduce the chip area. Hash function SHA-512 is implemented in different FPGA families of ALTERA to compare their performance metrics such as area, memory, latency, clocking frequency and throughput to guide a designer to select the most suitable FPGA for an application. In addition, a common architecture is designed for implementing SHA-256 and SHA-512 algorithms.     

基于收发平衡判定的TCP流量回放方法

基于真实网络流量的互动式回放测试是当前针对防火墙、IPS等串接型安全设备进行测评的最新方法.文中在分析现有基于状态判定的TCP流量互动式回放方法基础之上,引入收发平衡机制,提出了一种基于收发平衡和状态判定相结合的新的TCP流量回放方法.通过在发送TCP数据包前优先进行收发平衡判定将数据包发送出去,提出的方法能够有效减少TCP流量在发送过程中的状态判定开销,提高回放性能.对引入收发平衡机制前后的TCP流量回放方法的差异进行了分析比较.从单个TCP会话特性、并发会话流量特性、网络传输延迟与丢包等角度分析验证了影响引入收发平衡机制后的算法有效性的因素.实际流量实验表明,文中所提方法在回放TCP流量时性能有显著提升,适用于在更大规模的流量环境下对防火墙、IPS等串接型网络安全设备进行测评.     

一种优化的多播报文认证机制

提出了一种有效的多播报文认证机制，该机制结合了Hash树和Hash链两种方法的特点。在发送一组多播报文时，首先将其划分为大小相等的多个子组，子组的大小由预计抵御的突发丢包发生次数确定。然后为每个子组内的报文建立一棵Hash树，并将每棵Hash树的树根附加于之前的若干个报文中，从而构成了Hash链。该文使用了两种丢包模型对这种机制的性能进行了分析和模拟，其结果表明该机制在达到相同校验率的情况下，可以降低通信开销。