Genetic evidence of a strong functional constraint of neurotrypsin during primate evolution

Neurotrypsin is one of the extra-cellular serine proteases that are predominantly expressed in the brain and involved in neuronal development and function. Mutations in humans are associated with autosomal recessive non-syndromic mental retardation (MR). We studied the molecular evolution of neurotrypsin by sequencing the coding region of neurotrypsin in 11 representative non-human primate species covering great apes, lesser apes, Old World monkeys and New World monkeys. Our results demonstrated a strong functional constraint of neurotrypsin that was caused by strong purifying selection during primate evolution, an implication of an essential functional role of neurotrypsin in primate cognition. Further analysis indicated that the purifying selection was in fact acting on the SRCR domains of neurotrypsin, which mediate the binding activity of neurotrypsin to cell surface or extracellular proteins. In addition, by comparing primates with three other mammalian orders, we demonstrated that the absence of the first copy of the SRCR domain (exon 2 and 3) in mouse and rat was due to the deletion of this segment in the murine lineage. Copyright (C) 2005 S. Karger AG, Basel.

Practical Evaluation of Security against Generalized Interpolation Attack

Interpolation attack was presented by Jakobsen and Knudsen at FSE'97. Interpolation attack is effective against ciphers that have a certain algebraic structure like the PURE cipher which is a prototype cipher, but it is difficult to apply the attack to real-world ciphers. This difficulty is due to the difficulty of deriving a low degree polynomial relation between ciphertexts and plaintexts. In other words, it is difficult to evaluate the security against interpolation attack. This paper generalizes the interpolation attack. The generalization makes easier to evaluate the security against interpolation attack. We call the generalized interpolation attack linear sum attack. We present an algorithm that evaluates the security of byte-oriented ciphers against linear sum attack. Moreover, we show the relationship between linear sum attack and higher order differential attack. In addition, we show the security of CRYPTON, E2, and RIJNDAEL against linear sum attack using the algorithm.

an improved smart card based password authentication scheme with provable security

Password authentication has been adopted as one of the most commonly used solutions in network environment to protect resources from unauthorized access. Recently, Lee–Kim–Yoo [S.W. Lee, H.S. Kim, K.Y. Yoo, Improvement of Chien et al.'s remote user authentication scheme using smart cards, Computer Standards & Interfaces 27 (2) (2005) 181–183] and Lee-Chiu [N.Y. Lee, Y.C. Chiu, Improved remote authentication scheme with smart card, Computer Standards & Interfaces 27 (2) (2005) 177–180] respectively proposed a smart card based password authentication scheme. We show that these two schemes are both subject to forgery attacks provided that the information stored in the smart card is disclosed by the adversary. We also propose an improved scheme with formal security proof.

a constraint solver and its application to path feasibility analysis

Many testing methods are based on program paths. A well-known problem with them is that some paths are infeasible. To decide the feasibility of paths, we may solve a set of constraints. In this paper, we describe constraint-based tools that can be used for this purpose. They accept constraints expressed in a natural form, which may involve variables of different types such as integers, Booleans, reals and fixed-size arrays. The constraint solver is an extension of a Boolean satisfiability checker and it makes use of a linear programming package. The solving algorithm is described, and examples are given to illustrate the use of the tools. For many paths in the testing literature, their feasibility can be decided in a reasonable amount of time.

cryptanalysis of the end-to-end security protocol for mobile communications with end-user identification/authentication

IEEE Computer Society