Results 91 to 100 of about 39,607 (176)
Practical Preimage Attack on 5-Round Keccak[r=640, c=160]
IACR Transactions on Symmetric CryptologyInternal differential cryptanalysis has recently yielded a series of new results in the preimage cryptanalysis of round-reduced Keccak. While these existing attacks share a similar high-level framework, they differ in their technical details. This paper
Xiaoen Lin +6 more
doaj +1 more source
Novel hierarchical identity-based encryption scheme from lattice
Tongxin xuebao, 2017 Aiming at the high complexity in user’s private key extraction and large expansion ratio of trapdoor size in previous hierarchical identity-based encryption (HIBE) schemes,a new HIBE scheme was proposed.The implicit extension method to improve preimage ...
Qing YE +4 more
doaj +2 more sources
Topology and its Applications, 2002 Answering some questions posed by \textit{V. V. Tkachuk} [Proc. Am. Math. Soc. 126, 3437-3446 (1998; Zbl 0903.54004)] the authors show that quotient (resp. continuous) images of connected metric spaces are exactly connected sequential spaces (resp.
FEDELI, Alessandro, Le Donne A.
openaire +4 more sources
Novel identity-based fully homomorphic encryption scheme from lattice
Tongxin xuebao, 2017 The previous identity-based homomorphic encryption schemes from lattice was analyzed.That the high complexity in previous schemes was mainly caused by trapdoor generation and preimage sampling was pointed out.A new solution was proposed.A novel identity ...
Yong-li TANG +4 more
doaj +2 more sources
Practical Preimages for Maraca
, 2009 We show a practical preimage attack on the cryptographic hash function Maraca, which was submitted as a candidate to the NIST SHA-3 competition. Our attack has been verified experimentially.
Indesteege, Sebastiaan, Preneel, Bart
openaire +3 more sources
Computational Complexity of Some Problems on Generalized Cellular Automations
Безопасность информационных технологий, 2012 We prove that the preimage problem of a generalized cellular automation is NP-hard. The results of this work are important for supporting the security of the ciphers based on the cellular automations.
P. G. Klyucharev
doaj
Coalescence under Preimage Constraints
, 2019 The primary goal of this document is to record the asymptotic effects that preimage constraints impose upon the sizes of the iterated images of a random function. Specifically, given a subset $\mathcal{P}\subseteq \mathbb{Z}_{\geq 0}$ and a finite set $S$ of size $n$, choose a function uniformly from the set of functions $f:S\rightarrow S$ that satisfy
openaire +2 more sources
Properties of Neutrosophic κ- bi-ideals in near-subtraction semigroups [PDF]
Neutrosophic Sets and SystemsThis paper presents the concept of neutrosophic κ-bi-ideals within the framework of nearsubtraction semigroups and explores the associated findings. The concept of neutrosophic intersections is explored.
B. Elavarasan +3 more
doaj
Survey of Lightweight Hardware-Based Hash Functions for Security in Constrained IoT Devices
IEEE AccessLightweight cryptographic primitives are commonly used to secure communication in resource-constrained IoT devices such as RFID tags, sensors, actuators, wireless sensor networks, and edge gateways.
Mohsin Khan +3 more
doaj +1 more source
Rimcompactness and Similar Properties in Preimages
Rocky Mountain Journal of Mathematics, 1992 The following is proved. Theorem 1: Suppose \(f: X\to Y\) is rimcompact and, for \(y\in Y\), \(f^{-1}(y)\) is rimcompact and has 0-dimensional boundary in \(X\). If \(Y\) is rimcompact then \(X\) is rimcompact. --- Theorem 2: Suppose \(f: X\to Y\) is rimperfect and, for \(y\in Y\), \(f^{-1}(y)\) is a TDI space (i.e.
openaire +3 more sources