Results 51 to 60 of about 738 (105)

Cryptanalysis of the SASI Ultralightweight RFID Authentication Protocol with Modular Rotations

, 2008
In this work we present the first passive attack over the SASI lightweight authentication protocol with modular rotations. This can be used to fully recover the secret $ID$ of the RFID tag, which is the value the protocol is designed to conceal. The attack is described initially for recovering $\lfloor log_2(96) \rfloor=6$ bits of the secret value $ID$,
Hernandez-Castro, Julio C., Tapiador, Juan M. E., Peris-Lopez, Pedro, Quisquater, Jean-Jacques   +3 more
openaire   +2 more sources

A Unified Approach to Image Recognition and Cryptography via Flexible Weak Inverse Property Quasigroups

Journal of Function Spaces, Volume 2025, Issue 1, 2025.
Nonassociative algebra presents multiple options for comprehending and dealing with difficulties in graph theory, artificial intelligence, and cryptography. Its distinctive traits introduce genuine concepts and procedures not found in conventional associative algebra, yielding to new results from studies and breakthroughs in multiple disciplines ...
Mohammad Mazyad Hazzazi, Muhammad Nadeem, Muhammad Kamran, Muhammad Arshad, Samuel Asefa Fufa, Abdul Rauf Khan   +5 more
wiley   +1 more source

Evaluating cryptographic vulnerabilities created by quantum computing in industrial control systems

Journal of Critical Infrastructure Policy, Volume 5, Issue 2, Page 88-110, Fall/Winter 2024.
Abstract Quantum computing is expected to eventually be able to break the public‐key cryptography algorithms currently used throughout information technology (IT) infrastructure, undermining foundational tools used to maintain information security across the country's critical infrastructure.
Michael J. D. Vermeer, Chad Heitzenrater, Edward Parker, Alvin Moon, Domenique Lumpkin, Jalal Awan   +5 more
wiley   +1 more source

EP n P: An Accurate O ( n ) Solution to the P n P Problem [PDF]

, 2018
We propose a non-iterative solution to the PnP problem—the estimation of the pose of a calibrated camera from n 3D-to-2D point correspondences—whose computational complexity grows linearly with n.
Fua, Pascal, Lepetit, Vincent, Moreno-Noguer, Francesc   +2 more
core  

Design and implementation in an Altera's cyclone IV EP4CE6E22C8 FPGA board of a fast and robust cipher using combined 1D maps

IET Image Processing, Volume 18, Issue 7, Page 1823-1843, 29 May 2024.
A chaos‐based image encryption algorithm was coded. The algorithm was then implemented in an Altera RZ‐EasyFPGA board. Finally, the robustness tests were carried out using all the usual metrics. Abstract This paper proposes an image encryption algorithm based on combined 1D chaotic maps. First, a permutation technique was applied.
Alain Fanda Djomo, Alain Tiedeu, Janvier Fotsing   +2 more
wiley   +1 more source

Tensor decompositions for learning latent variable models [PDF]

, 2014
This work considers a computationally and statistically efficient parameter estimation method for a wide class of latent variable models---including Gaussian mixture models, hidden Markov models, and latent Dirichlet allocation---which exploits a certain
Anandkumar, Anima, Ge, Rong, Hsu, Daniel, Kakade, Sham M., Telgarsky, Matus   +4 more
core   +5 more sources

Bit‐Based Evaluation of Lightweight Block Ciphers SLIM, LBC‐IoT, and SLA by Mixed Integer Linear Programming

IET Information Security, Volume 2024, Issue 1, 2024.
Many lightweight block ciphers have been proposed for IoT devices that have limited resources. SLIM, LBC‐IoT, and SLA are lightweight block ciphers developed for IoT systems. The designer of SLIM presented a 7‐round differential distinguisher and an 11‐round linear trail using a heuristic method. We have comprehensively sought the longest distinguisher
Nobuyuki Sugio, Qichun Wang
wiley   +1 more source

Unveiling the Neutral Difference and Its Automated Search

IET Information Security, Volume 2024, Issue 1, 2024.
Given a differential characteristic and an existing plaintext pair that satisfies it (referred to as a right pair), generating additional right pairs at a reduced cost is an appealing prospect. The neutral bit technique, referred to as neutral differences throughout this paper, provides a solution to this challenge.
Guangqiu Lv, Chenhui Jin, Zhen Shi, Ting Cui, Qichun Wang   +4 more
wiley   +1 more source

A New (Related‐Key) Neural Distinguisher Using Two Differences for Differential Cryptanalysis

IET Information Security, Volume 2024, Issue 1, 2024.
At CRYPTO 2019, Gohr showed the significant advantages of neural distinguishers over traditional distinguishers in differential cryptanalysis. At fast software encryption (FSE) 2024, Bellini et al. provided a generic tool to automatically train the (related‐key) differential neural distinguishers for different block ciphers. In this paper, based on the
Gao Wang, Gaoli Wang, Siwei Sun, Qichun Wang   +3 more
wiley   +1 more source

Automatic Search of Differential Characteristics and Improved Differential Cryptanalysis for PRINCE, QARMA, and MANTIS

IET Information Security, Volume 2024, Issue 1, 2024.
Reflection structure has a significant advantage that realizing decryption and encryption results in minimum additional costs, and many block ciphers tend to adopt such structure to achieve the requirement of low overhead. PRINCE, MANTIS, QARMA, and PRINCEv2 are lightweight block ciphers with reflection feature proposed in recent years.
Yaxin Cui, Hong Xu, Lin Tan, Wenfeng Qi, Qichun Wang   +4 more
wiley   +1 more source