Results 41 to 50 of about 11,160 (119)

Random Permutation Statistics and An Improved Slide-Determine Attack on KeeLoq [PDF]

open access: yes, 2011
KeeLoq is a lightweight block cipher which is extensively used in the automotive industry. Its periodic structure, and overall simplicity makes it vulnerable to many different attacks.
Bard, GV, Courtois, NT
core  

Ransomware Detection Using Sample Entropy and Graphical Models: A Methodology for Explainable Artificial Intelligence (XAI) in Cybersecurity

open access: yesApplied Stochastic Models in Business and Industry, Volume 41, Issue 6, November/December 2025.
ABSTRACT Malware detection poses a critical challenge for both society and Business and Industry (B&I), particularly given the necessity for secure digital transformation. Among various cybersecurity threats, ransomware has emerged as especially disruptive, capable of halting operations, interrupting business continuity, and causing significant ...
Danilo Bruschi   +3 more
wiley   +1 more source

Eliminating Variables in Boolean Equation Systems [PDF]

open access: yes, 2017
Systems of Boolean equations of low degree arise in a natural way when analyzing block ciphers. The cipher's round functions relate the secret key to auxiliary variables that are introduced by each successive round.
Fløystad, Gunnar   +3 more
core   +1 more source

Hardware Design for Secure Telemedicine Using A Novel Framework, A New 4D Memristive Chaotic Oscillator, and Dispatched Gray Code Scrambler

open access: yesEngineering Reports, Volume 7, Issue 10, October 2025.
This work presents a secure telemedicine cryptosystem based on a novel 4D memristive chaotic oscillator and a Dispatched Gray Code Scrambler (DGCS). Implemented on FPGA, the system ensures power‐efficient encryption, making it suitable for real‐time medical image transmission in IoT healthcare environments.
Fritz Nguemo Kemdoum   +3 more
wiley   +1 more source

Non-Symbolic Fragmentation [PDF]

open access: yes, 2002
This paper reports on the use of non-symbolic fragmentation of data for securing communications. Non-symbolic fragmentation, or NSF, relies on breaking up data into non-symbolic fragments, which are (usually irregularly-sized) chunks whose boundaries do ...
Ashman, Helen   +4 more
core  

ArtEM: Enhancing the Understanding of Integer and Modular Arithmetic Through Interactive Learning Software

open access: yesComputer Applications in Engineering Education, Volume 33, Issue 4, July 2025.
ABSTRACT Integer and modular arithmetic is a fundamental area of mathematics, with extensive applications in computer science, and is essential for cryptographic protocols, error correction, and algorithm efficiency. However, students often struggle to understand its abstract nature, especially when transitioning from theoretical knowledge to practical
Violeta Migallón   +2 more
wiley   +1 more source

Multidimensional Zero-Correlation Linear Cryptanalysis of the Block Cipher KASUMI [PDF]

open access: yes, 2014
The block cipher KASUMI is widely used for security in many synchronous wireless standards. It was proposed by ETSI SAGE for usage in 3GPP (3rd Generation Partnership Project) ciphering algorthms in 2001.
Chen, Shaozhen, Yi, Wentan
core  

Understanding market sentiment analysis: A survey

open access: yesJournal of Economic Surveys, Volume 39, Issue 3, Page 1125-1147, July 2025.
Abstract Market sentiment analysis (MSA) has evolved significantly over nearly four decades, growing in relevance and application in economics and finance. This paper extensively reviews MSA, encompassing methodologies ranging from lexicon‐based techniques to traditional Machine Learning (ML), Deep Learning (DL), and hybrid approaches.
Peyman Heydarian   +2 more
wiley   +1 more source

Enabling Secure Database as a Service using Fully Homomorphic Encryption: Challenges and Opportunities [PDF]

open access: yes, 2013
The database community, at least for the last decade, has been grappling with querying encrypted data, which would enable secure database as a service solutions.
Gunda, Manikanta   +2 more
core  

On non-abelian homomorphic public-key cryptosystems

open access: yes, 2002
An important problem of modern cryptography concerns secret public-key computations in algebraic structures. We construct homomorphic cryptosystems being (secret) epimorphisms f:G --> H, where G, H are (publically known) groups and H is finite.
Grigoriev, D., Ponomarenko, I.
core   +3 more sources

Home - About - Disclaimer - Privacy