Molecular cloning, promoter analysis and induced expression of the complement component C9 gene in the grass carp Ctenopharyngodon idella

Complement-mediated killing of pathogens through lytic pathway is an important effector mechanism of innate immune response. C9 is the ninth member of complement components, creating the membrane attack complex (MAC). In the present study, a putative cDNA sequence encoding the 650 amino acids of C9 and its genomic organization were identified in grass carp Ctenopharyngodon idella. The deduced amino acid sequence of grass carp C9 (gcC9) showed 48% and 38.5% identity to Japanese flounder and human C9, respectively. Domain search revealed that gcC9 contains a LDL receptor domain, an EGF precursor domain, a MACPF domain and two TSP domain located in the N-terminal and C-terminal, respectively. Phylogenetic analysis demonstrated that gcC9 is clustered in a same clade with Japanese flounder, pufferfish and rainbow trout C9. The gcC9 gene consists of 11 exons with 10 introns, spacing over approximately 7 kb of genomic sequence. Analysis of gcC9 promoter region revealed the presence of a TATA box and some putative transcription factor such as C/EBP, HSF, NF-AT, CHOP-C, HNF-3B, GATA-2, IK-2, EVI- 1, AP-1, CP2 and OCT-1 binding sites. The first intron region contains C/EBPb, HFH-1 and Oct-1 binding sites. RT-PCR and Western blotting analysis demonstrated that the mRNA and protein of gcC9 gene have similar expression patterns, being constitutively expressed in all organs examined of healthy fish, with the highest level in hepatopancreas. By real-time quantitative RT-PCR analysis, gcC9 transcripts were significantly up-regulated in head kidney, spleen, hepatopancreas and down-regulated in intestine from inactivated fish bacterial pathogen Flavobacterium columnare-stimulated fish, demonstrating the role of C9 in immune response. (c) 2007 Elsevier B.V. All rights reserved.

Enlarging regions of stable running with segmented legs

In human and animal running spring-like leg behavior is found, and similar concepts have been demonstrated by various robotic systems in the past. In general, a spring-mass model provides self-stabilizing characteristics against external perturbations originated in leg-ground interactions and motor control. Although most of these systems made use of linear spring-like legs. The question addressed in this paper is the influence of leg segmentation (i.e. the use of rotational joint and two limb-segments) to the self-stability of running, as it appears to be a common design principle in nature. This paper shows that, with the leg segmentation, the system is able to perform self-stable running behavior in significantly broader ranges of running speed and control parameters (e.g. control of angle of attack at touchdown, and adjustment of spring stiffness) by exploiting a nonlinear relationship between leg force and leg compression. The concept is investigated by using a two-segment leg model and a robotic platform, which demonstrate the plausibility in the real world. ©2008 IEEE.

On a Certain Algebraic Property of Block Ciphers

This is a study on a certain group theoretic property of the set of encryption functions of a block cipher. We have shown how to construct a subset which has this property in a given symmetric group by a computer algebra software GAP4.2 (Groups, Algorithms, and Programming, Version 4.2). These observations on group structures of block ciphers suggest us that we may be able to set a trapdoor based on meet-in-the-middle attack on block ciphers.

impossible differential cryptanalysis of reduced-round aria and camellia

This paper studies the security of the block ciphers ARIA and Camellia against impossible differential cryptanalysis. Our work improves the best impossible differential cryptanalysis of ARIA and Camellia known so far. The designers of ARIA expected no impossible differentials exist for 4-round ARIA. However, we found some nontrivial 4-round impossible differentials, which may lead to a possible attack on 6-round ARIA. Moreover, we found some nontrivial 8-round impossible differentials for Camellia, whereas only 7-round impossible differentials were previously known. By using the 8-round impossible differentials, we presented an attack on 12-round Camellia without FL/FL 1 layers.

基于椭圆曲线的零知识证明方法对Kerberos系统的改进

Kerberos是一个成熟的产品,广泛应用于金融、邮电、保险等行业.但仍存在一些隐患,例如:重放攻击、密码猜测、会话中选择明文攻击等等.该文针对Kerberos系统登录时可能遭到密码猜测,即所谓的离线字典攻击(Off line Dictionary Attack)的问题,提出一种基于椭圆曲线的零知识证明方法对系统进行改进,并给出相应的协议.

基于攻击能力增长的网络安全分析模型

网络脆弱性分析是近年来国内外研究的热点问题之一．基于攻击能力增长的网络安全性分析模型以攻击者的能力增长为主导，参考网络环境配置，模拟黑客攻击自动生成攻击图．使用攻击能力增长表示攻击者的最终目标使得攻击图的表示更为准确．最小攻击代价分析第1次考虑了相似攻击对攻击代价的影响，以便对各条路径的攻击代价进行计算；最小环境改变分析考虑入侵检测的因素对最可能的攻击路径进行分析，对于入侵检测系统的处理更加科学合理；两种分析都为改善网络配置提供了依据．与已有成果相比，模型提出的算法和方法更为实际可行．

SERPENT和SAFER密码算法的能量攻击

SERPENT和SAFER是AES的两个候选算法 ,本文使用能量攻击方法对它们进行了深入分析 ,结果表明 :对于 2 5 6、192和 12 8比特密钥的SERPENT算法 ,能量攻击平均需分别进行 2 159、2 119和 2 79次试验 .虽然所需的试验次数实际没法达到 ,但是此攻击方法大大地降低了SERPENT的密钥规模 ,并且发现对于能量攻击 ,SERPENT有许多弱密钥 .经过深入分析和穷尽搜索可知 :能量攻击可以获取SAFER的种子密钥 .文中还给出了两种抵抗能量攻击的SER PENT的改进密钥方案以及设计密钥方案时需注意的问题 .

对于5轮Camellia密码的Square攻击

中国计算机学会

一种基于分组密码的hash函数

提出了一个基于分组密码的hash函数体制,它的rate小于1但却具有更高的效率,同时,这个hash函数可以使用不安全的压缩函数进行构造,降低了对压缩函数安全性的要求.首先,在黑盒子模型下对这个新的体制的安全性进行了证明,然后给出了能够用于构造该体制的使用分组密码构造的压缩函数,最后通过实验对比发现,新hash函数的速度比rate为1的hash函数快得多.实验结果表明,除了rate以外,密钥编排也是影响基于分组密码hash函数效率的重要因素,甚至比rate影响更大.该体制只有两个密钥,不需要进行大量的密钥扩展运算,大大提高了基于分组密码hash函数的效率,而且该体制可以使用现有的分组密码来构造.

SMS4密码算法的差分故障攻击

SMS4是用于WAPI的分组密码算法,是国内官方公布的第一个商用密码算法.由于公布时间不长,关于它的安全性研究尚没有公开结果发表.该文研究SMS4密码算法对差分故障攻击的安全性.攻击采用面向字节的随机故障模型,并且结合了差分分析技术.该攻击方法理论上仅需要32个错误密文就可以完全恢复出SMS4的128比特种子密钥.因为实际中故障发生的字节位置是不可能完全平均的,所以实际攻击所需错误密文数将略大于理论值;文中的实验结果也验证了这一事实,恢复SMS4的128bit种子密钥平均大约需要47个错误密文.文章结果显示SMS4对差分故障攻击是脆弱的.为了避免这类攻击,建议用户对加密设备进行保护,阻止攻击者对其进行故障诱导.

对DES的Rectangle攻击和Boomerang攻击

作为加密标准，DES（data encryption standard）算法虽然已被AES（advanced encryption standard）算法所取代，但其仍有着不可忽视的重要作用．在一些领域，尤其是金融领域，DES和Triple DES仍被广泛使用着．而近年来又提出了一些新的密码分析方法，其中，Rectangle攻击和Boomerang攻击已被证明是非常强大而有效的．因此，有必要重新评估DES算法抵抗这些新分析方法的能力．研究了DES算法针对Rectangle攻击和Boomerang攻击的安全性．利用DES各轮最优差分路径及其概率，分别得到了对12轮DES的Rectangle攻击和对11轮DES的Boomerang攻击．攻击结果分别为：利用Rectangle攻击可以攻击到12轮DES，数据复杂度为2~(62)。个选择明文，时间复杂度为2~(42)次12轮加密；利用Boomerang攻击可以攻击到11轮DES，数据复杂度为2~(58)个适应性选择明密文，时间复杂度为2~(38)次11轮加密．由于使用的都是DES各轮的最优差分路径，所以可以相信，该结果是Rectangle攻击和Boomerang攻击对DES所能达到的最好结果．

对一个基于细胞自动机的分组密码变形的分析

Subhayan Sen等人提出了一个基于细胞自动机的分组密码系统(cellular automata based cryptosystem,简称CAC),但并没有给出CAC的某些构造模块的细节描述,从应用角度考虑,将其中的一个模块固定得到CAC的变形--SMCAC(samemajor-CACAC).对SMCAC进行密码分析,结果表明,CAC的这种变形在选择明文攻击下是极不安全的.对SMCAC进行分析的意义在于,知道CAC的具体设计细节以后,借鉴对SMCAC的分析,有可能对CAC密码系统本身的安全性造成威胁.