正规IC^(*)-密码超富足半群

给出了正规IC* 密码超富足半群的若干等价刻划 ,并通过完全 J*

An Improved Framework of Massive Superpoly Recovery in Cube Attacks Against NFSR-Based Stream Ciphers

A critical problem in the cube attack is how to recover superpolies efficiently.As the targeting number of rounds of an iterative stream cipher increases,the scale of its superpolies becomes larger and larger.Recently,to recover massive superpolies,the nested monomial prediction technique,the algorithm based on the divide-and-conquer strategy,and stretching cube attacks were proposed,which have been used to recover a superpoly with over ten million monomials for the NFSR-based stream ciphers such as Trivium and Grain-128AEAD.Nevertheless,when these methods are used to recover superpolies,many invalid calculations are performed,which makes recovering superpolies more difficult.This study finds an interesting observation that can be used to improve the above methods.Based on the observation,a new method is proposed to avoid a part of invalid calculations during the process of recovering superpolies.Then,the new method is applied to the nested monomial prediction technique and an improved superpoly recovery framework is presented.To verify the effectiveness of the proposed scheme,the improved framework is applied to 844-and 846-round Trivium and the exact ANFs of the superpolies is obtained with over one hundred million monomials,showing the improved superpoly recovery technique is powerful.Besides,extensive experiments on other scaled-down variants of NFSR-based stream ciphers show that the proposed scheme indeed could be more efficient on the superpoly recovery against NFSR-based stream ciphers.

Proxy signature scheme for ID-based original signers and certificate-based proxy signers

To realize delegation between different users in a mixed cryptosystem,a proxy signature scheme for ID-based original signers and certificated-based proxy signers（PSS-ID-CER）is defined.Using the bilinear properties of the pairings and the characters of key generations of certificate-based cryptosystems and ID-based cryptosystems,a construction for such a scheme is also presented.To prove the security of the proposed scheme,a general security model for this scheme under adaptive chosen-PKG,chosen-ID,chosen-delegation,chosen-ProxySigner-public-key,chosen-proxy-key and chosen-message attack is defined.The proposed scheme is provably secure under the random oracle model and the hardness assumption of computational Diffie-Hellman problem.

Universally Composable Three Party Password-based Key Exchange Protocol

Within the framework of universal composability,an appropriate ideal functionality that captures the basic security requirements of three party password-based key exchange was defined. An efficient real-word three party password-based key exchange protocol was also proposed.This protocol securely realizes the ideal functionality with respect to static party corruption.Thus it provides security guarantees under arbitrary composition with other protocols.

NEW ID-BASED GROUP SIGNATURE FROM PAIRINGS

We argue that traditional identity-based systems from pairings seem unsuitable for designing group signature schemes due to the problem of key escrow. In this paper we first propose new ID-based public key systems without trusted PKG (Private Key Generator) from bilinear pairings. In our new ID-based systems, if the dishonest PKG impersonates an honest user to communicate with others, the user can provide a proof of treachery of the PKG afterwards, which is similar to certificate-based systems. Therefore, our systems reach the Girault’s trusted level 3. We then propose a group signature scheme under the new ID-based systems, the security and performance of which rely on the new systems. The size of the group public key and the length of the signature are independent on the numbers of the group.

Certificateless Proxy Identity-Based Signcryption Scheme Without Bilinear Pairings

Signcryption, which was introduced by ZHEN~ is a cryptographic primitive that fulfils the functions of both digital signature and encryption and guarantees confidentiality, integrity and non-repudiation in a more effi- cient way. Certificateless signcryption and pro- xy signcryption in identity-based cryptography were proposed for different applications. Most of these schemes are constructed by bilinear pairings from elliptic curves. However, some schemes were recently presented without pai- rings. In this paper, we present a certificateless proxy identity-based signcryption scheme with- out bilinear pairings, which is efficient and secure.

THE 2-ERROR LINEAR COMPLEXITY OF 2~n-PERIODIC BINARY SEQUENCES WITH LINEAR COMPLEXITY 2~n-1

Linear complexity and k-error linear complexity of the stream cipher are two important standards to scale the randomicity of keystreams. For the 2n -periodicperiodic binary sequence with linear complexity 2n 1and k = 2,3,the number of sequences with given k-error linear complexity and the expected k-error linear complexity are provided. Moreover,the proportion of the sequences whose k-error linear complexity is bigger than the expected value is analyzed.

p53 codon 72 polymorphism and liver cancer susceptibility: A meta-analysis of epidemiologic studies

AIM:To evaluate the association between p53 codon 72 polymorphism and liver cancer risk by means of meta-analysis. METHODS:Two investigators independently searched the Medline,Embase and Chinese Biomedicine databases.Summary odds ratios and 95%CI for p53 codon 72 polymorphism and liver cancer were calculated in fixedeffects model(Mantel-Haenszel method)and randomeffects model(DerSimonian and Laird method)when appropriate. RESULTS:This meta-analysis included 1115 liver cancer cases and 1778 controls.The combined results based on all studies showed that there was a statistically significant link between Pro/Pro genotype and liver cancer,but not between Arg/Arg or Pro/Arg genotype and liver cancer.When stratifying for race,similar results were obtained,i.e.patients with liver cancer had a significantly higher frequency of Pro/Pro genotype than non-cancer patients among Asians.After stratifying thevarious studies by control source,gender,family history of liver cancer and chronic hepatitis virus infection,we found that(1)patients among hospital-based studies had a significantly higher frequency of Pro/Pro and a significantly lower frequency of Arg/Arg genotype than individuals without cancer;(2)female patients with liver cancer had a significantly lower frequency of Arg/Arg and a higher frequency of Pro/Arg+Pro/Pro genotypes than female individuals without cancer;(3)subgroup analyses for family history of liver cancer did not reveal any significant association between p53 codon 72 polymorphism and liver cancer development;and(4) patients with negative hepatitis virus infection had a significantly higher frequency of Pro/Pro and a significantly lower frequency of Arg/Arg genotype than individuals without cancer. CONCLUSION:This meta-analysis suggests that the p53 codon 72 polymorphism may be associated with liver cancer among Asians.

Automatic Search of Impossible Differentials and Zero-Correlation Linear Hulls for ARX Ciphers

In lightweight cryptographic primitives, round functions with only simple operations XOR, modular addition and rotation are widely used nowadays. This kind of ciphers is called ARX ciphers. For ARX ciphers, impossible differential cryptanalysis and zero-correlation linear cryptanalysis are among the most powerful attacks, and the key problems for these two attacks are discovering more and longer impossible differentials(IDs) and zero-correlation linear hulls(ZCLHs). However, finding new IDs and ZCLHs for ARX ciphers has been a manual work for a long time, which has been an obstacle in improving these two attacks. This paper proposes an automatic search method to improve the efficiency of finding new IDs and ZCLHs for ARX ciphers. In order to prove the efficiency of this new tool, we take HIGHT, LEA, SPECK three typical ARX algorithms as examples to explore their longer and new impossible differentials and zero-correlation linear hulls. To the best of our knowledge, this is the first application of automatic search method for ARX ciphers on finding new IDs and ZCLHs. For HIGHT, we find more 17 round IDs and multiple 17 round ZCLHs. This is the first discovery of 17 round ZCLHs for HIGHT. For LEA, we find extra four 10 round IDs and several 9 round ZCLHs. In the specification of LEA, the designers just identified three 10 round IDs and one 7round ZCLH. For SPECK, we find thousands of 6 round IDs and forty-four 6 round ZCLHs. Neither IDs nor ZCLHs of SPECK has been proposed before. The successful application of our new tool shows great potential in improving the impossible differential cryptanalysis and zero-correlation linear cryptanalysis on ARX ciphers..

An Improved Strategy for Efficient Expression and Purification of Soluble HIV-1 Tat Protein in E.coli

Although the endogenous function of Tat has been elucidated in the past twenty years, the study of its exogenous activity has been hampered due to the difficulty of large scale preparation of the active Tat protein. To express the full-length Tat protein in E.coli, the tat gene was cloned from an HIV infected patient by overlapping PCR. Rare codon usage analysis showed that rare E.coli codons, especially consecutive rare codons for Arg, account for 14% (14 of 101) rare E.coli codons in the tat gene. The expression of the HIV-1 tat gene was verified to be very poor in strain BL21 (DE3) due to the abundance of rare codons; however, tat gene expression was found to be very efficient in the host strain of Rosetta-gami B (DE3), which was supplemented with six rare tRNAs for Arg, Leu, Ile and Pro. Subsequent purification revealed that the proteins are soluble and unusually, the tagged Tat can form dimers independent of cystine disulfide bonds. The purity, integrity and molecular weight of the Tat protein were demonstrated by MALDI-TOF mass spectrometry. Reporter gene activating assay was further confirmed by investigating the transactivation activity of the recombinant Tat protein. Our improved strategy for efficient high level expression and purification of soluble Tat protein has paved the way to fully investigate its exogenous function.

Measuring-Basis Encrypted Quantum Key Distribution with Four-State Systems

A measuring-basis encrypted quantum key distribution scheme is proposed by using twelve nonorthogohal states in a four-state system and the measuring-basis encryption technique. In this scheme, two bits of classical information can be encoded on one four-state particle and the transmitted particles can be fully used.

A NEW THRESHOLD MULTI-PROXY MULTI-SIGNATURE SCHEME

This paper proposes a threshold mult-proxy multi-signature scheme with share verification. In the scheme, a subset of original signers allows a designated group of proxy signers to sign on behalf of the original group. A message m has to be signed by a subset of proxy signers who can represent the proxy group. Then, the proxy signature is sent to the verifier group. A subset of verifiers in the verifier group can also represent the group to authenticate the proxy signature. In other words, some threshold values will be given to indicate the number of persons to represent a group to authorize the signing capability or to sign a message or to verify the proxy signature.

Password-Authenticated Multiple Key Exchange Protocol for Mobile Applications

To achieve privacy and authentication sinmltaneously in mobile applications, various Three-party Password-authenticated key exchange （3PAKE） protocols have been proposed. However, some of these protocols are vulnerable to conventional attacks or have low efficiency so that they cannot be applied to mobile applications. In this paper, we proposed a password-authenticated multiple key exchange protocol for mobile applications using elliptic curve cryptosystem. The proposed protocol can achieve efficiency, reliability, flexibility and scalability at the same time. Compared with related works, the proposed protocol is more suitable and practical for mobile applications.

Molecular Characterization of Avian-like H1N1 Swine Influenza A Viruses Isolated in Eastern China, 2011

Currently, three predominant subtypes of influenza virus are prevalent in pig populations worldwide： H1N1, H3N2, and H1N2. European avian-Hke H1N1 viruses, which were initially detected in European pig populations in 1979, have been circulating in pigs in eastern China since 2007. In this study, six influenza A viruses were isolated from 60 swine lung samples collected from January to April 2011 in eastern China. Based on whole genome sequencing, molecular characteristics of two isolates were determined. Phylogenetic analysis showed the eight genes of the two isolates were closely related to those of the avian-like H1N1 viruses circulating in pig populations, especially similar to those found in China. Four potential glycosylation sites were observed at positions 13, 26, 198, 277 in the HA1 proteins of the two isolates. Due to the presence of a stop codon at codon 12, the isolates contained truncated PB1-F2 proteins. In this study, the isolates contained 591Q, 627E and 701N in the polymerase subunit PB2, which had been shown to be determinants of virulence and host adaptation. The isolates also had a D rather than E at position 92 of the NS1, a marker of mammalian adaptation. Both isolates contained the GPKV motif at the PDZ ligand domain of the 3＇ end of the NS1, a characteristic marker of the European avian-like swine viruses since about 1999, which is distinct from those of avian, human and classical swine viruses. The M2 proteins of the isolates have the mutation （S31N）, a characteristic marker of the European avian-like swine viruses since about 1987, which may confer resistance to amantadine and rimantadine antivirals. Our findings further emphasize the importance of surveillance on the genetic diversity of influenza A viruses in pigs, and raise more concerns about the occurrence of cross-species transmission events.

Quantum Secure Communication Using a Class of Three-Particle W State

A theoretical scheme of quantum secure communication using a class of three-particle W states is proposed. In the scheme,two communicators may communicate after they test the security of the quantum channel.The receiver can obtain the secret message determinately if the quantum channel is safe.The present scheme can be realized without using teleportation.

Key Management Using Certificate-Based Cryptosystem in Ad Hoc Networks

This paper proposed a distributed key management approach by using the recently developed concepts of certificate-based cryptosystem and threshold secret sharing schemes. Without any assumption of prefixed trust relationship between nodes, the ad hoc network works in a self-organizing way to provide the key generation and key management services using threshold secret sharing schemes, which effectively solves the problem of single point of failure. The proposed approach combines the best aspects of identity-based key management approaches (implicit certification) and traditional public key infrastructure approaches (no key escrow).

A NEW PUBLIC-KEY ENCRYPTION SCHEME BASED ON LUCAS SEQUENCE

Investigated the properties of LUCas sequence(LUC), the paper proposed a new variant of (probabilistic) public-key encryption scheme. Security analysis of the proposed encryption schemes shows that its one-wayness is equivalent to partial LUC discrete logarithm problem in ZN, and for the proposed probabilistic encryption scheme, its semantic security is equivalent to decisional LUC Diffie-Hellman problem in ZN. At last, the efficiency of the proposed schemes is briefly analyzed.

A NEW GROUP-ORIENTED PUBLICLY VERIABLETHRESHOLD SIGNCRYPTION SCHEME

Through cryptanalysis of the improved scheme of a generalized group-oriented threshold signcryption schemes,it is found that the improved scheme can effectively resist conspiracy attack and forgery attack,but does not have semantic security and public verification function,and sends threshold signcryption by the secret secure channel,which increases the communication costs and potential safety hazards of the system.A new group-oriented publicly verifiable threshold signcryption scheme is proposed on the basis of the improved scheme,the new scheme overcomes the drawbacks of the improved scheme,which not only provides with semantic security and public verification function,but also can send threshold signcryption by the public channel.

ID-based Key-insulated Authenticated Key Agreement Protocol

The basic idea behind an ID-based cryptosystem is that end user's public key can be determined by his identity information.Comparing with the traditional certificate-based cryptography,identity-based cryptography can eliminate much of the overhead associated with the deployment and management of certificate.However,exposure of private keys can be the most devastating attack on a public key based cryptosystem since such that all security guarantees are lost.In this paper,an ID-based authenticated key agreement protocol was presented.For solving the problem of key exposure of the basic scheme,the technique of key insulation was applied and a key insulated version is developed.

An Improved Group Space-Time Block Code Through Constellation Rotation

A new improved group space-time block code (G-STBC) based on constellation rotation for four transmit antennas was proposed. In comparison with the traditional G-STBC coding scheme, the proposed space-time code has longer code length and adopts proper rotation-based symbols, which can increase the minimum distance of space-time codes and thereby improve code gain and achieve full diversity performance. The simulation results verify that the proposed group space-time code can achieve better bit error performance than both the traditional group space-time code and other quasi-orthogonal space-time codes. Compared with Ma’s full diversity full rate (FDFR) codes, the proposed space-time code also can achieve the same excellent error performance. Furthermore, the design of the new space-time code gives another new and simple method to construct space-time codes with full diversity and high rate in case that it is not easy to design the traditional FDFR space-time codes.