Key processing with control vectors

A method is presented for controlling cryptographic key usage based on control vectors. Each cryptographic key has an associated control vector that defines the permitted uses of the key within the cryptographic system. At key generation, the control vector is cryptographically coupled to the key by way of a special encryption process. Each encrypted key and control vector are stored and distributed within the cryptographic system as a single token. Decryption of a key requires respecification of the control vector. As part of the decryption process, the cryptographic hardware verifies that the requested use of the key is authorized by the control vector. This article focuses mainly on the use of control vectors in cryptosystems based on the Data Encryption Algorithm.     

On the development of high-throughput and area-efficient multi-mode cryptographic hash designs in FPGAs

In this paper, area-efficient and high-throughput multi-mode architectures for the SHA-1 and SHA-2 hash families are proposed and implemented in several FPGA technologies. Additionally a systematic flow for designing multi-mode architectures (implementing more than one function) of these families is introduced. Compared to the corresponding architectures that are produced by a commercial synthesis tool, the proposed ones are better in terms of both area (at least 40%) and throughput/area (from 32% up to 175%). Finally, the proposed architectures outperform similar existing ones in terms of throughput and throughput/area, from 4.2× up to 279.4× and from 1.2× up to 5.5×, respectively.     

字符串匹配算法在DNA序列比对中的应用

高通量测序技术的飞速发展让生物信息领域迎来了大数据时代。新技术在提供海量生物遗传信息的同时,也给分析这些数据带来了新的挑战。DNA序列比对是信息分析流程中的关键步骤,为后续的变异检测提供序列比对信息。2015“深圳杯”数学建模夏令营B题以DNA序列比对为研究课题,希望参赛学生给出序列快速比对的最佳方案。本文简要点评了各参赛队伍的解答情况,然后介绍了现有DNA序列比对软件中用到的算法和数据结构。     

网络处理器中FBI单元的设计及其Verilog HDL实现

FBI(Fast Bus Interface)单元是实现网络处理器外部接口与网络处理器内部总线高速数据传输的关键。通过深入研究FBI单元,阐述了它的结构及其功能,运用Verilog HDL语言设计了一个FBI接口,在Model- sim SE PLUS 6．0上进行仿真,实现了整体模块的功能。     

互联网环境下电子图书共享机制设计

互联网环境下信息资源共享机制研究正处于方兴未艾的阶段,网络上电子图书馆的出现从很大程度促进了图书资源的共享,但单靠一个组织或公司来收集提供电子图书共事服务,无论从图书数量还是服务能力来看,都是远远不够的.只有充分的利用互联网上众多PC上的电子图书资源和服务资源,才有可能实现电子图书资源真正意义上的全面共享.现提出一种基于层次且结构拓扑的互联网环境下电子图书共享机制来管理和组织这些分散的PC资源,使之相互协同组织其上的电子图书资源并提供电子图书发现服务.     

WINDOWS 95/NT下加密和数字签名的开发与应用

首先介绍了WINDOWS的对称加密、非对称加密、数字签名及验证功能,然后给出了几个应用实例。     

The Full Cost of Cryptanalytic Attacks

An open question about the asymptotic cost of connecting many processors to a large memory using three dimensions for wiring is answered, and this result is used to find the full cost of several cryptanalytic attacks. In many cases this full cost is higher than the accepted complexity of a given algorithm based on the number of processor steps. The full costs of several cryptanalytic attacks are determined, including Shanks method for computing discrete logarithms in cyclic groups of prime order n, which requires n^1/2+o(1) processor steps, but, when all factors are taken into account, has full cost n^2/3+o(1). Other attacks analyzed are factoring with the number field sieve, generic attacks on block ciphers, attacks on double and triple encryption, and finding hash collisions. In many cases parallel collision search gives a significant asymptotic advantage over well-known generic attacks.     

高性能安全路由器中快速路由查找算法的研究与实现

设计快速的路由查找算法是提高路由器整体性能的关键之一.文章在一种基于RAM快速路由查找算法的基础上,根据高性能安全路由器的设计要求,进一步融入Hash链式表以及Trie树查找算法的设计思想,提出了一种可配置的路由查找算法.通过动态配置算法中的评价函数系数,该算法可以适用于多种网络应用环境.     

基于时空混沌系统的单向Hash函数构造

提出了一种基于时空混沌系统的Hash函数构造方法.以线性变换后的消息数作为一组初值来驱动单向耦合映像格子的时空混沌系统，产生时空混沌序列，取其空间最后一组混沌序列的适当项，线性映射为Hash值要求的128bit值.研究结果表明，这种基于时空混沌系统的Hash函数具有很好的单向性、弱碰撞性、初值敏感性，较基于低维混沌映射的Hash函数具有更强的保密性能，且实现简单. 关键词： 时空混沌 Hash函数 单向耦合映像格子     

一种2-安全码的改进追踪算法

完全安全码是不存在的，这已经从理论上得到证明。也就是说，任何安全码在某一种情况下，对叛逆者的追踪必定失败。有一种追踪效率很高的2-安全码，当然它在某种特殊情况下也无法实现对叛逆者的追踪。文中改进了该算法，使得追踪效率更高。而且通过Hash函数实现在这种特殊情况下对叛逆者的追踪，因此，可以实现对每个盗版码字的追踪。