Results 41 to 50 of about 723,432 (288)

The (related-key) impossible boomerang attack and its application to the AES block cipher [PDF]

open access: yes, 2010
The Advanced Encryption Standard (AES) is a 128-bit block cipher with a user key of 128, 192 or 256 bits, released by NIST in 2001 as the next-generation data encryption standard for use in the USA. It was adopted as an ISO international standard in 2005.
Jiqiang Lu
core   +1 more source

Gibbs flow for approximate transport with applications to Bayesian computation [PDF]

open access: yes, 2020
Let $\pi_{0}$ and $\pi_{1}$ be two distributions on the Borel space $(\mathbb{R}^{d},\mathcal{B}(\mathbb{R}^{d}))$. Any measurable function $T:\mathbb{R}^{d}\rightarrow\mathbb{R}^{d}$ such that $Y=T(X)\sim\pi_{1}$ if $X\sim\pi_{0}$ is called a transport ...
Doucet, Arnaud   +2 more
core   +1 more source

New Insights on Impossible Differential Cryptanalysis [PDF]

open access: yes, 2012
Since its introduction, impossible differential cryptanalysis has been applied to many ciphers. Besides the specific application of the technique in various instances, there are some very basic results which apply to generic structures of ciphers, e.g., the well known 5-round impossible differential of Feistel ciphers with bijective round functions.
Charles Bouillaguet   +3 more
openaire   +1 more source

Infrared laser sampling of low volumes combined with shotgun lipidomics reveals lipid markers in palatine tonsil carcinoma

open access: yesMolecular Oncology, EarlyView.
Nanosecond infrared laser (NIRL) low‐volume sampling combined with shotgun lipidomics uncovers distinct lipidome alterations in oropharyngeal squamous cell carcinoma (OPSCC) of the palatine tonsil. Several lipid species consistently differentiate tumor from healthy tissue, highlighting their potential as diagnostic markers.
Leonard Kerkhoff   +11 more
wiley   +1 more source

Impossible differential distinguisher analysis of GRANULE and MANTRA algorithm

open access: yesTongxin xuebao, 2020
The lightweight block cipher algorithms called GRANULE and MANTRA have a simple structure,fast encryption speed,and they can be easy implemented in software and hardware.Two algorithms are especially suitable for resource-constrained environments.To ...
Xiaonian WU   +3 more
doaj   +2 more sources

Generalised impossible differentials ofadvanced encryption standard

open access: yesElectronics Letters, 2001
A class of generalised four-round impossible differentials of the advanced encryption standard is presented and shown to be the best that can be obtained with the miss-in-the-middle technique.
Phan, R.C.W., Siddiqi, M.U.
openaire   +2 more sources

Chameleon sequences reveal structural effects in proteins representing micelle‐like distribution of hydrophobicity

open access: yesFEBS Open Bio, EarlyView.
Amino acids sequence of two different proteins with the same sequence (chameleon sequence—black boxes) represent in 3D structure of the proteins different secondary structures: HHHH—helical and BBB—Beta‐structural. The chains folded in water environment adopt different III‐order structures in which the chameleon fragments appear to adopt similar status
Irena Roterman   +4 more
wiley   +1 more source

Finding Impossible Differentials in ARX Ciphers under Weak Keys

open access: yesIACR Transactions on Symmetric Cryptology
Impossible differential cryptanalysis is very important in the field of symmetric ciphers. Currently, there are many automatic search approaches to find impossible differentials.
Qing Ling   +6 more
doaj   +1 more source

Cryptanalysis of Reduced round SKINNY Block Cipher

open access: yesIACR Transactions on Symmetric Cryptology, 2018
SKINNY is a family of lightweight tweakable block ciphers designed to have the smallest hardware footprint. In this paper, we present zero-correlation linear approximations and the related-tweakey impossible differential characteristics for different ...
Sadegh Sadeghi   +2 more
doaj   +1 more source

Differentially Private Release and Learning of Threshold Functions

open access: yes, 2015
We prove new upper and lower bounds on the sample complexity of $(\epsilon, \delta)$ differentially private algorithms for releasing approximate answers to threshold functions.
Bun, Mark   +3 more
core   +1 more source

Home - About - Disclaimer - Privacy