Cryptanalysis of 4-Pass HAVAL

HAVAL is a cryptographic hash function proposed by Zheng et al. Rompay et al and Wang et al found collisions of full 3-Pass HAVAL. In this paper, we study the security of 4-Pass HAVAL. We find collisions of full versions of 4-Pass HAVAL. The attack is similar to the two-block attack of MD5 proposed by Wang et al. The computational complexity of the attack is about 2^30-2^32 for the first block and 2^27-2^29 for the second block. We use this attack to find 256bit collisions of 4-Pass HAVAL in 3-4 hour on a common PC

Template Attacks Based on the Multivariate Joint Distribution

For template attacks, it is ideal if templates can be built for each (data,key) pair. However, it requires a lot of power traces and computation. In this paper, firstly, the properties of the UMJD(unisource multivariate joint distribution) are studied, and then a template attack based on the UMJD is presented. For power traces with much noise, the experiments show that its attack effect is much better than that of the CPA(correlation power analysis) based template attacks and that of the SOST(sum of square wise pair t-differences) based template attacks. Secondly, the problem to build a template for each (data,key) pair can be reduced to build templates for an MMJD (multisource multivariate joint distribution). An MMJD can be divided into several UMJDs. Based on the analysis, we give a template attack that does not require large amounts of computations, and neither a large number of power traces for profiling, but with its attack effect equivalent to that of the template attack which aims to build a template for each (data,key) pair. Third, from the process of the UMJD based template attacks, using the POI (points of interest) of all variables together as the POI of the template attack is an extension to the existing conclusion on the optimal number of POI. Lastly, the UMJD can also be applied in the SOST method to obtain better quality of POI

On the coefficients of the polynomial in the number field sieve

Polynomial selection is very important in number field sieve. If the yield of a pair of polynomials is closely correlated with the coefficients of the polynomials, we can select polynomials by checking the coefficients first. This can speed up the selection of good polynomials. In this paper, we aim to study the correlation between the polynomial coefficients and the yield of the polynomials. By theoretical analysis and experiments, we find that a polynomial with the ending coefficient containing more small primes is usually better in yield than the one whose ending coefficient contains less. One advantage of the ending coefficient over the leading coefficient is that the ending coefficient is bigger and can contain more small primes in root optimizing stage. Using the complete discrimination system, we also analyze the condition on coefficients to obtain more real roots

Two Efficient and Regulatory Confidential Transaction Schemes

With the development of Bitcoin, Ethereum and other projects, blockchain has been widely concerned with its outstanding characteristics such as non-centralization, collective maintenance, openness and transparency. Blockchain has been widely used in finance, logistics, copyright and other fields. However, as transactions are stored in plaintext in the blockchain for public verification, the privacy of users is not well guaranteed such that many financial applications can not be adopted widely. How to securely and economically protect the privacy of transactions is worth further research. In this paper, we have proposed two efficient and regulatory confidential transaction schemes using homomorphic encryption and zero-knowledge proof. ERCO, the first scheme, turns the standard ElGamal algorithm to be additively homomorphic and expands it into four ciphertexts such that $(m,r)$ in the transaction can be decrypted. Its security can be reduced to DDH assumption and the transaction size is less. PailGamal, the second scheme, is based on the combination of Paillier and ElGamal algorithms. Its security can be reduced to DDH assumption and it empowers regulators greater powers to obtain transaction-related specific content. In contrast to other ElGamal-based schemes, PailGamal makes any token amount directly decrypted without calculating a discrete logarithm problem. As any $(m,r)$ in transactions can be decrypted directly, game theory is applied to further reduce transaction size

Comparative genomics reveals adaptive evolution of Asian tapeworm in switching to a new intermediate host

Taenia saginata, Taenia solium and Taenia asiatica (beef, pork and Asian tapeworms, respectively) are parasitic flatworms of major public health and food safety importance. Among them, T. asiatica is a newly recognized species that split from T. saginata via an intermediate host switch ∼1.14 Myr ago. Here we report the 169- and 168-Mb draft genomes of T. saginata and T. asiatica. Comparative analysis reveals that high rates of gene duplications and functional diversifications might have partially driven the divergence between T. asiatica and T. saginata. We observe accelerated evolutionary rates, adaptive evolutions in homeostasis regulation, tegument maintenance and lipid uptakes, and differential/specialized gene family expansions in T. asiatica that may favour its hepatotropism in the new intermediate host. We also identify potential targets for developing diagnostic or intervention tools against human tapeworms. These data provide new insights into the evolution of Taenia parasites, particularly the recent speciation of T. asiatica

Polycomb group proteins EZH2 and EED directly regulate androgen receptor in advanced prostate cancer

Peer Reviewedhttps://deepblue.lib.umich.edu/bitstream/2027.42/149265/1/ijc32118.pdfhttps://deepblue.lib.umich.edu/bitstream/2027.42/149265/2/ijc32118_am.pd

A novel DNA sequence periodicity decodes nucleosome positioning

There have been two types of well-characterized DNA sequence periodicities; both are found to be associated with important molecular mechanisms. One is a 3-nt periodicity corresponding to codon triplets, the other is a 10.5-nt periodicity related to the structure of DNA helixes. In the process of analyzing the genome and transcriptome of Trichomonas vaginalis, we observed a 120.9-nt periodicity along DNA sequences. Different from the 3- and 10.5-nt periodicities, this novel periodicity originates near the 5′-end of transcripts, extends along the direction of transcription, and weakens gradually along transcripts. As a result, codon usage as well as amino acid composition is constrained by this periodicity. Similar periodicities were also identified in other organisms, but with variable length associated with the length of nucleosome units. We validated this association experimentally in T. vaginalis, and demonstrated that the periodicity manifests nucleotide variations between linker-DNA and wrapping-DNA along nucleosome array. We conclude that this novel DNA sequence periodicity is a signature of nucleosome organization suggesting that nucleosomes are well-positioned with regularity, especially near the 5′-end of transcripts

A Journey into the City. Migrant Workers' Relation with the Urban Space and Struggle for Existence in Xu Zechen's Early Jingpiao Fiction

In contemporary China, rural-urban migrants constitute a new urban subject with entirely new identity-related issues. This study aims at demonstrating how literature can be a valid field in investigating such evolving subjectivities, through an analysis of Xu Zechen’s early novellas depicting migrants’ vicissitudes in Beijing. Combining a close reading of the texts and a review of the main social problems characterising rural-urban migration in China, this paper focuses on the representation of the identity crisis within the migrant self in Xu’s stories, taking into account the network of meanings employed by the writer to signify the objective and subjective tension between the city and the countryside