Export Citations
Save this search
Please login to be able to save your searches and receive alerts for new content matching your search criteria.
- research-articleSeptember 2024
Specifying cycles of minimal length for commonly used linear layers in block ciphers
Journal of Information Security and Applications (JISA), Volume 84, Issue Chttps://doi.org/10.1016/j.jisa.2024.103824AbstractNonlinear invariant attack applied to lightweight block ciphers relies on the existence of a nonlinear invariant g : F 2 n → F 2 for the round function. Whereas invariants of the entire S-box layer have been studied in terms of the corresponding ...
- research-articleJuly 2024
Configurable in-memory computing architecture based on dual-port SRAM
- Yue Zhao,
- Yunlong Liu,
- Jian Zheng,
- Zhongzhen Tong,
- Xin Wang,
- Runru Yu,
- Xiulong Wu,
- Yongliang Zhou,
- Chunyu Peng,
- Wenjuan Lu,
- Qiang Zhao,
- Zhiting Lin
Microelectronics Journal (MICROJ), Volume 147, Issue Chttps://doi.org/10.1016/j.mejo.2024.106163AbstractIn the emerging field of in-memory computing (IMC), this study proposes a dual-port static random access memory (SRAM) IMC architecture with the distinct capability of realizing XOR encryption (XORE), thus serving as a potential solution for the ...
- research-articleJuly 2024
Multi-bit per cycle true random number generator based on XOR-XNOR ring oscillator unit
Microelectronics Journal (MICROJ), Volume 146, Issue Chttps://doi.org/10.1016/j.mejo.2024.106142AbstractTo achieve a fast and resource-efficient entropy source, we present a novel oscillator unit, called XOR-XNOR ring oscillator (XXRO) which consists of an XOR gate and an XNOR gate. The XXRO unit has an internal feedback loop that allows the ...
- ArticleSeptember 2023
QuasiNet: A Neural Network with Trainable Product Layers
Artificial Neural Networks and Machine Learning – ICANN 2023Pages 399–410https://doi.org/10.1007/978-3-031-44192-9_32AbstractClassical neural networks achieve only limited convergence in hard problems such as XOR or parity when the number of hidden neurons is small. With the motivation to improve the success rate of neural networks in these problems, we propose a new ...
- research-articleSeptember 2023
A quantum-based building block for designing a nanoscale full adder circuit with power analysis
Integration, the VLSI Journal (INTG), Volume 92, Issue CPages 77–82https://doi.org/10.1016/j.vlsi.2023.05.004AbstractQuantum-dot cellular automata (QCA) concentrates charges using the Coulomb interaction. Despite the nanometric scale and the extremely high projected working frequency, the need for transmission is eliminated, resulting in very low ...
Highlights- Designing adder circuits using the XOR and majority gate with easy access to inputs and outputs.
-
- research-articleJune 2023
Highly secured and quickest image encryption algorithm based on trigonometric chaotic map and S-box
Soft Computing - A Fusion of Foundations, Methodologies and Applications (SOFC), Volume 27, Issue 16Pages 11111–11123https://doi.org/10.1007/s00500-023-08493-2AbstractThe purpose of this research is to develop a highly secured non-breakable fastest cryptosystem. A significant number of image encryption plans have been proposed during the past years. By far, most such plans arrive at a high-security level; be ...
- research-articleMay 2023
Towards rigorous understanding of neural networks via semantics-preserving transformations
International Journal on Software Tools for Technology Transfer (STTT) (STTT), Volume 25, Issue 3Pages 301–327https://doi.org/10.1007/s10009-023-00700-7AbstractIn this paper, we present an algebraic approach to the precise and global verification and explanation of Rectifier Neural Networks, a subclass of Piece-wise Linear Neural Networks (PLNNs), i.e., networks that semantically represent piece-wise ...
- articleApril 2023
One-Factor Cancellable Fingerprint Template Protection Based on Index Self-Encoding
Journal of Database Management (JDBM), Volume 34, Issue 3Pages 1–18https://doi.org/10.4018/JDM.321546The existing one-factor cancellable biometrics algorithms generally require random sequences to reorder the biometrics, which reduces the discrimination of the transformed biometrics. Some algorithms hide and transmit the random sequence by XORing the ...
- research-articleApril 2023
A hybrid NEQR image encryption cryptosystem using two-dimensional quantum walks and quantum coding
Signal Processing (SIGN), Volume 205, Issue Chttps://doi.org/10.1016/j.sigpro.2022.108890Highlights- Based on the quantum principle, a two-dimensional quantum walk model is designed with an infinite range of values.
Quantum mechanisms can provide strong security in image processing against the disadvantages of pseudorandom and periodic of traditional chaotic systems. Based on its uncertainty and measurement collapse principle, this study proposes ...
- ArticleDecember 2022
Evaluating the Security of Merkle-Damgård Hash Functions and Combiners in Quantum Settings
Network and System SecurityPages 687–711https://doi.org/10.1007/978-3-031-23020-2_39AbstractIn this work, we evaluate the security of Merkle-Damgård (MD) hash functions and their combiners (XOR and concatenation combiners) in quantum settings. Two main quantum scenarios are considered, including the scenario where a substantial amount of ...
- research-articleDecember 2022
A novel perfect contrast XOR-based visual cryptography scheme for multiple secrets
Multimedia Tools and Applications (MTAA), Volume 81, Issue 30Pages 43125–43143https://doi.org/10.1007/s11042-022-13187-2AbstractVisual cryptography scheme (VCS) is a kind of secret sharing scheme that only relies on human visual system (HVS) without complicated calculation. In this paper, a novel visual cryptography scheme for multiple secrets is proposed which hides n − 1 ...
- research-articleNovember 2022
Trading information complexity for error II: The case of a large error and the external information complexity
Information and Computation (ICOM), Volume 289, Issue PAhttps://doi.org/10.1016/j.ic.2022.104952AbstractTwo problems are studied. (1) How much external or internal information cost is required to compute a Boolean-valued function with an error at most 1 / 2 − ξ for small ξ > 0? A lower bound Ω ( ξ 2 ) and an upper bound O ( ξ ) are ...
- research-articleOctober 2022
An efficient verifiable (t,n)-threshold secret image sharing scheme with ultralight shares
Multimedia Tools and Applications (MTAA), Volume 81, Issue 24Pages 34969–34999https://doi.org/10.1007/s11042-021-10523-wAbstractA secret sharing scheme partitions a secret into a set of shares and distributes them among the eligible participants, with each participant receiving one share of the secret. The sharing technique allows any qualified subset of participants to ...
- research-articleSeptember 2022
A pseudo-random bit generator based on chaotic maps enhanced with a bit-XOR operation
Journal of Information Security and Applications (JISA), Volume 69, Issue Chttps://doi.org/10.1016/j.jisa.2022.103299AbstractOwing to their applications in cryptography, pseudo-random number generators and Pseudo-Random Bit Generators (PRBG) have played an important role in the computer age and their importance is expected to grow exponentially in the coming ...
Highlights- XOR operation based enhancement for simple chaotic maps is proposed.
- The XOR ...
- research-articleAugust 2022
Novel Fault-Tolerant Processing in Memory Cell in Ternary Quantum-Dot Cellular Automata
Journal of Electronic Testing: Theory and Applications (JELT), Volume 38, Issue 4Pages 419–444https://doi.org/10.1007/s10836-022-06018-7AbstractProcessing-in-memory (PIM) is a computational architecture in which the processing unit and memory are integrated into a single unit. Different technologies and methods can be used to implement PIM, but a more optimal design for PIM can be ...
- research-articleMay 2022
4D Hyperchaotic map and DNA encoding combined image encryption for secure communication
Multimedia Tools and Applications (MTAA), Volume 81, Issue 11Pages 15859–15878https://doi.org/10.1007/s11042-022-12598-5AbstractThe usage of digital health data such as documents, images and videos has increased drastically in recent years, making them more prone to sophisticated cyber threats. Here arises a great requirement of information security since this digital data ...
- research-articleApril 2022
A novel protocol for efficient authentication in cloud-based IoT devices
Multimedia Tools and Applications (MTAA), Volume 81, Issue 10Pages 13823–13843https://doi.org/10.1007/s11042-022-11927-yAbstractThe Internet of Things (IoT) has emerged as one of the most revolutionary technological innovations with the proliferation of applications within almost all fields of the human race. A cloud environment is the main component of IoT infrastructure ...
- research-articleJanuary 2022
Lightweight encryption for short-range wireless biometric authentication systems in Industry 4.0
Integrated Computer-Aided Engineering (ICAE), Volume 29, Issue 2Pages 153–173https://doi.org/10.3233/ICA-210673Most recent solutions for users’ authentication in Industry 4.0 scenarios are based on unique biological characteristics that are captured from users and recognized using artificial intelligence and machine learning technologies. These biometric ...
- research-articleNovember 2021
A verifiable multi-secret image sharing scheme using XOR operation and hash function
Multimedia Tools and Applications (MTAA), Volume 80, Issue 28-29Pages 35051–35080https://doi.org/10.1007/s11042-020-09174-0AbstractIn a secret image sharing (SIS) scheme, a dealer (the data owner or a trusted third-party) encodes a secret image into some share images and distributes them among some participants such that each participant receives exactly one share. Most of ...
- research-articleJuly 2021
PTHash: Revisiting FCH Minimal Perfect Hashing
SIGIR '21: Proceedings of the 44th International ACM SIGIR Conference on Research and Development in Information RetrievalPages 1339–1348https://doi.org/10.1145/3404835.3462849Given a set S of n distinct keys, a function f that bijectively maps the keys of S into the range (0,...,n-1) is called a minimal perfect hash function for S. Algorithms that find such functions when n is large and retain constant evaluation time are of ...