Crocin attenuates acute hypobaric hypoxia-induced cognitive deficits of rats.

This study investigated whether crocin exerted neuroprotective effects against acute hypobaric hypoxia at high altitude in vivo and determined the underlying mechanisms. Male Sprague-Dawley rats were randomly assigned to a normoxic group，a hypoxic group, and three crocin groups at three different doses. The rats were transferred from 50m to 4200m for 3 days after treatment with crocin for 3 days. The learning and memory of the rat were evaluated with the Morris water maze test. Transmission electron microscope (TEM) was used to analyze the changes in the ultrastructure of hippocampal neurons. Peroxisome proliferator-activated receptor-γ co-activator 1α (PGC-1α) and sirtuin-1 (SIRT1) levels were determined using immunohistochemical staining and western blotting. The escape latency of the crocin group was shorter than that of the hypoxic group, while the frequency of the rats reaching the platform was significantly higher in the crocin group. The structures of nerve cells and mitochondria were destroyed in the hypoxic group, but were repaired in the crocin groups. The expressions of PGC-1α and SIRT1 were decreased in the hypoxic group, but were increased in the crocin group. All the effects improved by crocin were dose-dependent. Crocin attenuates acute hypobaric hypoxia-induced cognitive deficits in rats, accompanied by repairing the structures of hippocampal neurons and improving PGC-1α and SIRT1 levels.

Fast parallel molecular algorithms for DNA-based computation: solving the elliptic curve discrete logarithm problem over GF2.

Elliptic curve cryptographic algorithms convert input data to unrecognizable encryption and the unrecognizable data back again into its original decrypted form. The security of this form of encryption hinges on the enormous difficulty that is required to solve the elliptic curve discrete logarithm problem (ECDLP), especially over GF(2(n)), n in Z+. This paper describes an effective method to find solutions to the ECDLP by means of a molecular computer. We propose that this research accomplishment would represent a breakthrough for applied biological computation and this paper demonstrates that in principle this is possible. Three DNA-based algorithms: a parallel adder, a parallel multiplier, and a parallel inverse over GF(2(n)) are described. The biological operation time of all of these algorithms is polynomial with respect to n. Considering this analysis, cryptography using a public key might be less secure. In this respect, a principal contribution of this paper is to provide enhanced evidence of the potential of molecular computing to tackle such ambitious computations.