English
Related papers

Related papers: A New Efficient Asymmetric Cryptosystem Based on t…

200 papers

Integer factorization is one of the vital algorithms discussed as a part of analysis of any black-box cipher suites where the cipher algorithm is based on number theory. The origin of the problem is from Discrete Logarithmic Problem which…

Distributed, Parallel, and Cluster Computing · Computer Science 2013-05-21 Anjan K. Koundinya , Harish G. , Srinath N. K. , Raghavendra G. E. , Pramod Y. V. , Sandeep R. , Punith Kumar G

Quantum computing is a winsome field that concerns with the behaviour and nature of energy at the quantum level to improve the efficiency of computations. In recent years, quantum computation is receiving much attention for its capability…

Quantum Physics · Physics 2020-05-26 Amandeep Singh Bhatia , Ajay Kumar

We present novel homomorphic encryption schemes for integer arithmetic, intended for use in secure single-party computation in the cloud. These schemes are capable of securely computing only low degree polynomials homomorphically, but this…

Cryptography and Security · Computer Science 2017-02-27 James Dyer , Martin Dyer , Jie Xu

From a long time ago, beside encryption of data and making it secure, compression packing it was also important that could make transmission of data faster. In the past years need for improvement of encryption and compression for a fast and…

Cryptography and Security · Computer Science 2018-12-19 Saber Malekzadeh

Multi-recipient cryptographic schemes provide secure communication, between one sender and multiple recipients, in a multi-party group. Providing secure multi-party communication is very challenging, especially in dynamic networks. Existing…

Cryptography and Security · Computer Science 2020-02-18 Ahmad Mansour , Khalid M. Malik , Niko Kaso

An `obfuscation' for encrypted computing is quantified exactly here, leading to an argument that security against polynomial-time attacks has been achieved for user data via the deliberately `chaotic' compilation required for security…

Cryptography and Security · Computer Science 2019-04-30 Peter T. Breuer

A novel cryptography method based on the Lorenz's attractor chaotic system is presented. The proposed algorithm is secure and fast, making it practical for general use. We introduce the chaotic operation mode, which provides an interaction…

Cryptography and Security · Computer Science 2012-01-17 Anderson Gonçalves Marco , Alexandre Souto Martinez , Odemir Martinez Bruno

This paper presents a new encryption scheme called Compact Coding that encodes information in time, phase, and intensity domains, simultaneously. While these approaches have previously been used one at a time, the proposed scheme brings to…

Quantum Physics · Physics 2016-07-13 Rasha El Hajj , Pramode Verma , Kam Wai Clifford Chan

In this paper will be presented new approach to entropy coding: family of generalizations of standard numeral systems which are optimal for encoding sequence of equiprobable symbols, into asymmetric numeral systems - optimal for freely…

Information Theory · Computer Science 2009-05-21 Jarek Duda

With the emergence of 5G, Internet of Things (IoT) has become a center of attraction for almost all industries due to its wide range of applications from various domains. The explosive growth of industrial control processes and the…

Cryptography and Security · Computer Science 2020-06-25 Vishal A. Thakor , M. A. Razzaque , Muhammad R. A. Khandaker

Recently, several practical attacks raised serious concerns over the security of searchable encryption. The attacks have brought emphasis on forward privacy, which is the key concept behind solutions to the adaptive leakage-exploiting…

Cryptography and Security · Computer Science 2017-10-03 Xiangfu Song , Changyu Dong , Dandan Yuan , Qiuliang Xu , Minghao Zhao

Nowadays, using cryptographic systems play an effective role in security and safety technologies. One of the most applied kind of cryptography is Symmetric Cryptography and its applications. New aspects of symmetric Cryptography…

Cryptography and Security · Computer Science 2009-12-08 Amin Daneshmand Malayeri , Jalal Abdollahi

Performing smart computations in a context of cloud computing and big data is highly appreciated today. Fully homomorphic encryption (FHE) is a smart category of encryption schemes that allows working with the data in its encrypted form. It…

Cryptography and Security · Computer Science 2018-04-20 Ahmed El-Yahyaoui , Mohamed Dafir Ech-Chrif El Kettani

This article describes a post-quantum multirecipient symmetric cryptosystem whose security is based on the hardness of the LWE problem. In this scheme a single sender encrypts multiple messages for multiple recipients generating a single…

Cryptography and Security · Computer Science 2025-06-09 Saikat Gope , Srinivasan Krishnaswamy , Chayan Bhawal

Security of information has become a major issue during the last decades. New algorithms based on chaotic maps were suggested for protection of different types of multimedia data, especially digital images and videos in this period.…

Chaotic Dynamics · Physics 2010-10-22 Sohrab Behnia , Afshin Akhshani , Amir Akhavan , Hadi Mahmodi

We propose a new homomorphic encryption scheme based on the hardness of decoding under independent random noise from certain affine families of codes. Unlike in previous lattice-based homomorphic encryption schemes, where the message is…

Cryptography and Security · Computer Science 2011-11-21 Andrej Bogdanov , Chin Ho Lee

A key technique for controlling numerical stability in sparse direct solvers is threshold partial pivoting. When selecting a pivot, the entire candidate pivot column below the diagonal must be up-to-date and must be scanned. If the…

Numerical Analysis · Mathematics 2013-05-13 Jonathan Hogg , Jennifer Scott

We live in a data-driven era that involves the generation, collection and processing of a massive amount of data. This data often contains valuable intellectual property and sensitive user information that must be safeguarded. There is a…

Cryptography and Security · Computer Science 2023-06-13 Nivedita Shrivastava , Smruti R. Sarangi

Recently, an image encryption scheme based on chaotic standard and logistic maps was proposed. This paper studies the security of the scheme and shows that it can be broken with only one chosen-plaintext. Some other security defects of the…

Cryptography and Security · Computer Science 2009-07-07 Chengqing Li , Shujun Li , Kwok-Tung Lo

Integer factorization is a famous computational problem unknown whether being solvable in the polynomial time. With the rise of deep neural networks, it is interesting whether they can facilitate faster factorization. We present an approach…

Machine Learning · Computer Science 2023-09-12 Karlis Freivalds , Emils Ozolins , Guntis Barzdins