Presence of casein immunoreactive epitopes in molluscs, fish and frog.

The presence of a group of peptides derived from milk proteins (caseins) was examined by immunocytochemistry in various tissues from invertebrates and lower vertebrates. Phagocytic hemocytes from different species of molluscs, and cells located in the intestine wall or in related glands of invertebrates and lower vertebrates showed immunoreactivity to antibodies to whole casein and related fragments. Several functional tests (cell migration, inhibition test, phagocytosis) using these peptides were performed on the mollusc hemocytes. Only ovine caseinoglycopeptide was able to increase the phagocytic activity of the hemocytes towards bacteria

Potentialtöpfe und kurzperiodische Übergitter: GaInAs(P)InP-Heterostrukturen für Feldeffekttransistoren und elektrooptische Modulatoren

Abstract. We describe a new variant of the well known Baby-Step Giant-Step algorithm in the case of some discrete logarithms with a special structure. More precisely, we focus on discrete logarithms equal to products in groups of unknown order. As an example of application, we show that this new algorithm enables to cryptanalyse a variant of the GPS scheme proposed by Girault and Lefranc at CHES 2004 conference in which the private key is equal to the product of two sub-private keys of low Hamming weight. We also describe a second attack based on a known variant of the Baby-Step Giant-Step algorithm using the low Hamming weight of the sub-private keys. Key words: Baby-Step Giant-Step algorithm, discrete logarithm, GPS scheme, binary trees, low Hamming weight.

Tightly-secure signatures from lossy identification schemes

In this paper we present three digital signature schemes with tight security reductions. Our first signature scheme is a particularly efficient version of the short exponent discrete log based scheme of Girault et al. (J. of Cryptology 2006). Our scheme has a tight reduction to the decisional Short Discrete Logarithm problem, while still maintaining the non-tight reduction to the computational version of the problem upon which the original scheme of Girault et al. is based. The second signature scheme we construct is a modification of the scheme of Lyubashevsky (Asiacrypt 2009) that is based on the worst-case hardness of the shortest vector problem in ideal lattices. And the third scheme is a very simple signature scheme that is based directly on the hardness of the Subset Sum problem. We also present a general transformation that converts, what we term lossy identification schemes, into signature schemes with tight security reductions. We believe that this greatly simplifies the task of constructing and proving the security of such signature schemes