Learn More
Neuronal dendritic spines are a key component of brain circuitry, implicated in many mechanisms for plasticity and long-term stability of synaptic communication. They can undergo rapid actin-based activity-dependent shape fluctuations, an intriguing biophysical property that is believed to alter synaptic transmission. Yet, because of their small size(More)
Bilayers composed of phosphatidylcholine (PC), sphingomyelin (SM), and cholesterol (CHOL) are commonly used as systems to model the raft-lipid domain structure believed to compartmentalize particular cell membrane proteins. In this work, micropipette aspiration of giant unilamellar vesicles was used to test the elasticities, water permeabilities, and(More)
Complex rheology of airway smooth muscle cells and its dynamic response during contractile stimulation involves many molecular processes, foremost of which are actomyosin cross-bridge cycling and actin polymerization. With an atomic force microscope, we tracked the spatial and temporal variations of the viscoelastic properties of cultured airway smooth(More)
We describe the use of explicit isogenies to translate instances of the Discrete Logarithm Problem from Jacobians of hyper-elliptic genus 3 curves to Jacobians of non-hyperelliptic genus 3 curves, where they are vulnerable to faster index calculus attacks. We provide explicit formulae for isogenies with kernel isomorphic to (Z/2Z) 3 (over an algebraic(More)
Distortion maps are a useful tool for pairing based cryptography. Compared with elliptic curves, the case of hyperelliptic curves of genus g > 1 is more complicated since the full torsion subgroup has rank 2g. In this paper we prove that distortion maps always exist for supersingular curves of genus g > 1 and we give several examples in genus 2.
We present an accelerated Schoof-type point-counting algorithm for curves of genus 2 equipped with an efficiently computable real multiplication endomorphism. Our new algorithm reduces the complexity of genus 2 point counting over a finite field Fq of large characteristic from O(log 8 q) to O(log 5 q). Using our algorithm we compute a 256-bit prime-order(More)
Déchène has proposed generalized Jacobians as a source of groups for public-key cryptosystems based on the hardness of the Discrete Logarithm Problem (DLP). Her specific proposal gives rise to a group isomorphic to the semidirect product of an elliptic curve and a multiplicative group of a finite field. We explain why her proposal has no advantages over(More)