Results 61 to 70 of about 69,698 (279)

Quantum Resistant Random Linear Code Based Public Key Encryption Scheme RLCE [PDF]

open access: yes, 2015
Lattice based encryption schemes and linear code based encryption schemes have received extensive attention in recent years since they have been considered as post-quantum candidate encryption schemes.
Wang, Yongge
core   +2 more sources

Feasibility of the interlock protocol against man-in-the-middle attacks on quantum cryptography

open access: yes, 2005
If an eavesdropper succeeds in compromising the quantum as well as the classical channels and mimics the receiver "Bob" for the sender "Alice" and vice versa, one defence strategy is the successive, temporally interlocked partial transmission of the ...
Svozil, Karl
core   +2 more sources

Isogeny-based post-quantum key exchange protocols [PDF]

open access: yes, 2020
The goal of this project is to understand and analyze the supersingular isogeny Diffie Hellman (SIDH), a post-quantum key exchange protocol which security lies on the isogeny-finding problem between supersingular elliptic curves.
Sorinas Capdevila, Ernest
core  

Protein pyrophosphorylation by inositol pyrophosphates — detection, function, and regulation

open access: yesFEBS Letters, EarlyView.
Protein pyrophosphorylation is an unusual signaling mechanism that was discovered two decades ago. It can be driven by inositol pyrophosphate messengers and influences various cellular processes. Herein, we summarize the research progress and challenges of this field, covering pathways found to be regulated by this posttranslational modification as ...
Sarah Lampe   +3 more
wiley   +1 more source

An upstream open reading frame regulates expression of the mitochondrial protein Slm35 and mitophagy flux

open access: yesFEBS Letters, EarlyView.
This study reveals how the mitochondrial protein Slm35 is regulated in Saccharomyces cerevisiae. The authors identify stress‐responsive DNA elements and two upstream open reading frames (uORFs) in the 5′ untranslated region of SLM35. One uORF restricts translation, and its mutation increases Slm35 protein levels and mitophagy.
Hernán Romo‐Casanueva   +5 more
wiley   +1 more source

Reproducible families of codes and cryptographic applications

open access: yesJournal of Mathematical Cryptology, 2021
Structured linear block codes such as cyclic, quasi-cyclic and quasi-dyadic codes have gained an increasing role in recent years both in the context of error control and in that of code-based cryptography.
Santini Paolo   +2 more
doaj   +1 more source

In situ molecular organization and heterogeneity of the Legionella Dot/Icm T4SS

open access: yesFEBS Letters, EarlyView.
We present a nearly complete in situ model of the Legionella Dot/Icm type IV secretion system, revealing its central secretion channel and identifying new components. Using cryo‐electron tomography with AI‐based modeling, our work highlights the structure, variability, and mechanism of this complex nanomachine, advancing understanding of bacterial ...
Przemysław Dutka   +11 more
wiley   +1 more source

Cell wall target fragment discovery using a low‐cost, minimal fragment library

open access: yesFEBS Letters, EarlyView.
LoCoFrag100 is a fragment library made up of 100 different compounds. Similarity between the fragments is minimized and 10 different fragments are mixed into a single cocktail, which is soaked to protein crystals. These crystals are analysed by X‐ray crystallography, revealing the binding modes of the bound fragment ligands.
Kaizhou Yan   +5 more
wiley   +1 more source

Code Based Cryptography and Steganography [PDF]

open access: yes, 2013
For a long time, coding theory was only concerned by message integrity (how to protect against errors a message sent via some noisely channel). Nowadays, coding theory plays an important role in the area of cryptography and steganography. The aim of this paper is to show how algebraic coding theory offers ways to define secure cryptographic primitives ...
openaire   +1 more source

Polynomial Structures in Code-Based Cryptography [PDF]

open access: yes, 2013
In this article we discus a probability problem applied in the code based cryptography. It is related to the shape of the polynomials with exactly t different roots. We will show that the structure is very dense and the probability that this type of polynomials has at least one coefficient equal to zero is extremelly low.
Vlad Dragoi   +3 more
openaire   +1 more source

Home - About - Disclaimer - Privacy