Search results for "Cipher"
showing 10 items of 18 documents
The search for novel targets in Alzheimer's disease—The 90s redux
2021
Alzheimer's disease (AD) is a complex disease of the brain. Despite over 100 years of basic and clinical research, significantly intensified in the last three decades, the exact cause of this neurodegeneration is still an enigma. Based on neuroanatomical, experimental, and clinical findings, a series of hypotheses on AD pathogenesis have evolved. Among them, the "amyloid cascade hypothesis" has been most prominent. Clinical efforts targeting the biochemistry of amyloid β-protein (Aβ) as causal therapy have all failed so far, which may mean that the pathogenic mechanism of AD is less straightforward than initially thought. While there was good scientific reason to support this hypothesis bef…
High-Throughput Mapping of 2′-O-Me Residues in RNA Using Next-Generation Sequencing (Illumina RiboMethSeq Protocol)
2017
Detection of RNA modifications in native RNAs is a tedious and laborious task, since the global level of these residues is low and most of the suitable physico-chemical methods require purification of the RNA of interest almost to homogeneity. To overcome these limitations, methods based on RT-driven primer extension have been developed and successfully used, sometimes in combination with a specific chemical treatment. Nowadays, some of these approaches have been coupled to high-throughput sequencing technologies, allowing the access to transcriptome-wide data. RNA 2'-O-methylation is one of the ubiquitous nucleotide modifications found in many RNA types from bacteria, archaea, and eukarya.…
Kasiski's Test: Couldn't the Repetitions be by Accident?
2006
Abstract In searching for repetitions in a periodic polyalphabetic ciphertext, we usually find several true (causal) repetitions that give information about the period. But we also find some accidental repetitions at distances unrelated to the period which may mislead the cryptanalyst. A simple formula shows that these accidents are rather unlikely.
Attacks Against the WAP WTLS Protocol
1999
The WAP WTLS protocol was designed to provide privacy, data integrity, and authentication for wireless terminals. The protocol is currently being fielded, and it is expected that the protocol will be contained in millions of devices in a few years.
A Note on Keys and Keystreams of Chacha20 for Multi-key Channels
2018
In this paper we analyze the keystreams generated by the Chacha20 stream cipher. We also compare these to the ones generated by its predecessor, the RC4 stream cipher. Due to the proposed multi-key channels in the upcoming TLS 1.3 standard we analyze the behavior of the keystream in the boundary case where there is a single bit difference between two keys used for the initiation of the stream cipher algorithms. The goal is to check whether a single bit change in the key has any predictable influence on the bits of the keystream output.
Risultati di uno studio randomizzato singolo cieco placebo versus Diallil-Tiosulfinato, Nuciferina e Diosgenina in pazienti responders a Tadalafil 5 …
2015
The aim of the study is to evaluate the efficacy of Diallil-Tiosulphinate, Nuciepherine and Diosgenin in the treatment of erectile dysfunction. In our study were selected 120 men affected by erectile dysfunction. They were filled in a self-administered questionnaire International Index of Sexual Medicine. 74 of them reported a moderate erectile dysfunction and 46 reported a severe ED. All patients were treated with Tadalafil 5 mg once a day for 90 days. They were re-evaluated with the same questionnaire after three months of therapy. In 75% of the patients there was an improvement of IIEF-5 score. Only the 90 patients responders to Tadalafil once a day were randomized and divided into two g…
A Generalization of Girod’s Bidirectional Decoding Method to Codes with a Finite Deciphering Delay
2012
In this paper we generalize an encoding method due to Girod (cf. [6]) using prefix codes, that allows a bidirectional decoding of the encoded messages. In particular we generalize it to any finite alphabet A, to any operation defined on A, to any code with finite deciphering delay and to any key x ∈ A+ , on a length depending on the deciphering delay. We moreover define, as in [4], a deterministic transducer for such generalized method. We prove that, fixed a code X ∈ A* with finite deciphering delay and a key x ∈ A *, the transducers associated to different operations are isomorphic as unlabelled graphs. We also prove that, for a fixed code X with finite deciphering delay, transducers asso…
An Efficient and Secure Multidimensional Data Aggregation for Fog-Computing-Based Smart Grid
2021
International audience; The secure multidimensional data aggregation (MDA) has been widely investigated in smart grid for smart cities. However, previous proposals use heavy computation operations either to encrypt or to decrypt the multidimensional data. Moreover, previous fault-tolerant mechanisms lead to an important computation cost, and also a high communication cost when considering a separate identification phase. In this article, we propose an efficient and secure MDA scheme, named ESMA. Unlike existing schemes, the multidimensional data in ESMA are structured and encrypted into a single Paillier ciphertext and thereafter, the data are efficiently decrypted. For privacy preserving, …
Widening of the genetic and clinical spectrum of Lamb-Shaffer syndrome, a neurodevelopmental disorder due to SOX5 haploinsufficiency
2020
International audience; PURPOSE: Lamb-Shaffer syndrome (LAMSHF) is a neurodevelopmental disorder described in just over two dozen patients with heterozygous genetic alterations involving SOX5, a gene encoding a transcription factor regulating cell fate and differentiation in neurogenesis and other discrete developmental processes. The genetic alterations described so far are mainly microdeletions. The present study was aimed at increasing our understanding of LAMSHF, its clinical and genetic spectrum, and the pathophysiological mechanisms involved.METHODS: Clinical and genetic data were collected through GeneMatcher and clinical or genetic networks for 41 novel patients harboring various ty…
CODING PARTITIONS OF REGULAR SETS
2009
A coding partition of a set of words partitions this set into classes such that whenever a sequence, of minimal length, has two distinct factorizations, the words of these factorizations belong to the same class. The canonical coding partition is the finest coding partition that partitions the set of words in at most one unambiguous class and other classes that localize the ambiguities in the factorizations of finite sequences. We prove that the canonical coding partition of a regular set contains a finite number of regular classes and we give an algorithm for computing this partition. From this we derive a canonical decomposition of a regular monoid into a free product of finitely many re…