English
Related papers

Related papers: A CCA secure cryptosystem using matrices over grou…

200 papers

Threats targeting cyberspace are becoming more prominent and intelligent day by day. This inherently leads to a dire demand for continuous security validation and testing. Using this paper, we aim to provide a holistic and precise security…

Cryptography and Security · Computer Science 2021-08-17 Hardik Manocha , Akash Srivastava , Chetan Verma , Ratan Gupta , Bhavya Bansal

Quantum computing is emerging as a significant threat to information protected by widely used cryptographic systems. Cryptographic methods, once deemed secure for decades, are now at risk of being compromised, posing a massive threat to the…

In Ciphertext Policy Attribute based Encryption scheme, the encryptor can fix the policy, who can decrypt the encrypted message. The policy can be formed with the help of attributes. In CP-ABE, access policy is sent along with the…

Cryptography and Security · Computer Science 2010-11-03 A. Balu , K. Kuppusamy

The discrete logarithm problem is one of the backbones in public key cryptography. In this paper we study the discrete logarithm problem in the group of circulant matrices over a finite field. This gives rise to secure and fast public key…

Cryptography and Security · Computer Science 2009-09-21 Ayan Mahalanobis

This paper reports a detailed cryptanalysis of a recently proposed encryption scheme based on the logistic map. Some problems are emphasized concerning the key space definition and the implementation of the cryptosystem using floating-point…

Chaotic Dynamics · Physics 2009-11-13 David Arroyo , Rhouma Rhouma , Gonzalo Alvarez , Shujun Li , Veronica Fernandez

A position-multiplexing based cryptosystem is proposed to enhance the information security with an ultra-broadband illumination. The simplified optical encryption system only contains one diffuser acting as the random phase mask (RPM).…

Optics · Physics 2021-09-17 Dongliang Tang , Sujit Kumar Sahoo , Cuong Dang

In this note, we describe a probabilistic attack on public key cryptosystems based on the word/conjugacy problems for finitely presented groups of the type proposed recently by Anshel, Anshel and Goldfeld. In such a scheme, one makes use of…

Cryptography and Security · Computer Science 2007-05-23 James Hughes , Allen Tannenbaum

We analyse the security of some variants of the CFS code-based digital signature scheme. We show how the adoption of some code-based hash-functions to improve the efficiency of CFS leads to the ability of an attacker to produce a forgery…

Cryptography and Security · Computer Science 2024-02-07 Giuseppe D'Alconzo , Alessio Meneghetti , Paolo Piasenti

In recent years, a growing number of cryptosystems based on chaos have been proposed, many of them fundamentally flawed by a lack of robustness and security. This paper describes the security weaknesses of a recently proposed cryptographic…

Chaotic Dynamics · Physics 2007-10-30 Gonzalo Alvarez , Shujun Li

In this short note, we develop a novel idea of a bilinear cryptosystem using the discrete logarithm problem in matrices. These matrices come from a linear representation of a finite $p$-group of class 2. We discuss an example at the end.

Cryptography and Security · Computer Science 2017-11-23 Ayan Mahalanobis , Pralhad Shinde

We consider the problem of designing secure and private codes for distributed matrix-matrix multiplication. A master server owns two private matrices and hires worker nodes to help compute their product. The matrices should remain…

Information Theory · Computer Science 2022-02-15 Christoph Hofmeister , Rawad Bitar , Marvin Xhemrishi , Antonia Wachter-Zeh

Anamorphic encryption serves as a vital tool for covert communication, maintaining secrecy even during post-compromise scenarios. Particularly in the receiver-anamorphic setting, a user can shield hidden messages even when coerced into…

Cryptography and Security · Computer Science 2026-04-10 Shujun Wang , Jianting Ning , Qinyi Li , Leo Yu Zhang

We had recently shown that every positive integer can be represented uniquely using a recurrence sequence, when certain restrictions on the digit strings are satisfied. We present the details of how such representations can be used to build…

Number Theory · Mathematics 2015-03-17 Nathan Hamlin , Bala Krishnamoorthy , William Webb

Substitution boxes with thorough cryptographic strengths are essential for the development of strong encryption systems. They are the only portions capable of inducing nonlinearity in symmetric encryption systems. Bijective substitution…

Cryptography and Security · Computer Science 2016-07-19 Musheer Ahmad , Hamed D AlSharari

As cloud computing gains traction, data owners are outsourcing their data to cloud service providers (CSPs) for Database Service (DBaaS), bringing in a deviation of data ownership and usage, and intensifying privacy concerns, especially…

Cryptography and Security · Computer Science 2024-04-11 Hui Li , Jingwen Shi , Qi Tian , Zheng Li , Yan Fu , Bingqing Shen , Yaofeng Tu

We present a new attack against cryptosystems based on the rank metric. Our attack allows us to cryptanalyze two variants of the GPT cryptosystem which were designed to resist the attack of Overbeck.

Cryptography and Security · Computer Science 2016-01-05 Anna-Lena Horlemann-Trautmann , Kyle Marshall , Joachim Rosenthal

Cybersecurity is a big challenge as hackers are always trying to find new methods to attack and exploit system vulnerabilities. Cybersecurity threats and risks have increased in recent years, due to the increasing number of devices and…

Cryptography and Security · Computer Science 2024-07-30 Ihab Mohamed , Hesham A. Hefny , Nagy R. Darwish

The modernization of power grid infrastructures necessitates the incorporation of decision support systems to effectively mitigate cybersecurity threats. This paper presents a comprehensive framework based on integrating Attack-Defense…

Cryptography and Security · Computer Science 2025-01-13 Omer Sen , Yanico Aust , Martin Neumuller , Immanuel Hacker , Andreas Ulbig

We propose a novel digital signature cryptosystem that exploits the concept of the brute-force problem. To ensure the security of the cryptosystem, we employed several mechanisms: sharing a common secret for factorable permutations,…

Cryptography and Security · Computer Science 2026-01-13 Gennady Khalimov , Yevgen Kotukh

Post-quantum cryptography has gained attention due to the need for secure cryptographic systems in the face of quantum computing. Code-based and lattice-based cryptography are two prominent approaches, both heavily studied within the NIST…

Cryptography and Security · Computer Science 2024-10-16 Anna-Lena Horlemann , Karan Khathuria , Marc Newman , Amin Sakzad , Carlos Vela Cabello
‹ Prev 1 8 9 10 Next ›