Results 21 to 30 of about 31,711 (108)
Interpretable security analysis of cancellable biometrics using constrained-optimized similarity-based attack [PDF]
arXiv, 2020 In cancellable biometrics (CB) schemes, template security is achieved by applying, mainly non-linear, transformations to the biometric template. The transformation is designed to preserve the template distance/similarity in the transformed domain. Despite its effectiveness, the security issues attributed to similarity preservation property of CB are ...
arxiv
International Consensus Statement on Allergy and Rhinology: Sinonasal Tumors
International Forum of Allergy &Rhinology, Volume 14, Issue 2, Page 149-608, February 2024.Abstract Background Sinonasal neoplasms, whether benign and malignant, pose a significant challenge to clinicians and represent a model area for multidisciplinary collaboration in order to optimize patient care. The International Consensus Statement on Allergy and Rhinology: Sinonasal Tumors (ICSNT) aims to summarize the best available evidence and ...
Edward C. Kuan +158 more
wiley +1 more source
Preimages under the Queuesort algorithm [PDF]
arXiv, 2021 Following the footprints of what have been done with the algorithm Stacksort, we investigate the preimages of the map associated with a slightly less well known algorithm, called Queuesort. After having described an equivalent version of Queuesort, we provide a recursive description of the set of all preimages of a given permutation, which can be also ...
arxiv
Phase diagram and topological expansion in the complex quartic random matrix model
Communications on Pure and Applied Mathematics, Volume 77, Issue 2, Page 1405-1485, February 2024.Abstract We use the Riemann–Hilbert approach, together with string and Toda equations, to study the topological expansion in the quartic random matrix model. The coefficients of the topological expansion are generating functions for the numbers Nj(g)$\mathcal {N}_j(g)$ of 4‐valent connected graphs with j vertices on a compact Riemann surface of genus g.
Pavel Bleher +2 more
wiley +1 more source
Computing Individual Discrete Logarithms Faster in GF$(p^n)$ with the NFS-DL Algorithm [PDF]
, 2015 The Number Field Sieve (NFS) algorithm is the best known method to compute discrete logarithms (DL) in finite fields $\mathbb{F}\_{p^n}$, with $p$ medium to large and $n \geq 1$ small. This algorithm comprises four steps: polynomial selection, relation collection, linear algebra and finally, individual logarithm computation.
arxiv +1 more source
Deciding Irreducibility/Indecomposability of Feedback Shift Registers Is NP‐Hard
IET Information Security, Volume 2024, Issue 1, 2024.Feedback shift registers (FSRs) are used as a fundamental component in electronics and confidential communication. A FSR f is said to be reducible if all the output sequences of another FSR g can also be generated by f and the FSR g costs less memory than f.
Lin Wang, Guowen Xu
wiley +1 more source
The Parallel Reversible Pebbling Game: Analyzing the Post-Quantum Security of iMHFs [PDF]
arXiv, 2021 The classical (parallel) black pebbling game is a useful abstraction which allows us to analyze the resources (space, space-time, cumulative space) necessary to evaluate a function $f$ with a static data-dependency graph $G$. Of particular interest in the field of cryptography are data-independent memory-hard functions $f_{G,H}$ which are defined by a ...
arxiv
Improved AB‐CPREs with Revocability and HRA Security under LWE
IET Information Security, Volume 2024, Issue 1, 2024.Attribute‐based conditional proxy re‐encryption protocols (AB‐CPREs) enable a delegator to delegate his decryption rights via different policies and grant the data owner greater flexibility in allocating their encrypted private data stored in the cloud.
Yang Wang, Mingqiang Wang, Jiwei Tian
wiley +1 more source
Superposition Attacks on Pseudorandom Schemes Based on Two or Less Permutations
IET Information Security, Volume 2024, Issue 1, 2024.We study quantum superposition attacks against permutation‐based pseudorandom cryptographic schemes. We first extend Kuwakado and Morii’s attack against the Even–Mansour cipher and exhibit key recovery attacks against a large class of pseudorandom schemes based on a single call to an n‐bit permutation, with polynomial O(n) (or O(n2), if the concrete ...
Shaoxuan Zhang +3 more
wiley +1 more source
Lattice‐Based CP‐ABE for Optimal Broadcast Encryption With Polynomial‐Depth Circuits
IET Information Security, Volume 2024, Issue 1, 2024.Most current broadcast encryption with optimal parameters is limited to Nick’s class 1 (NC1) circuits and does not support polynomial‐depth circuits (P‐depth circuits), making it difficult to provide flexible access control in broadcast channels among vast user groups.
Shaohua Ma +4 more
wiley +1 more source