English
Related papers

Related papers: Enhancing the security of caesar cipher substituti…

200 papers

We will define a new type of cipher that doesn't use neither an easy to calcualate and hard to invert matematical function like RSA nor a classical mono or polyalphabetic cipher.

Cryptography and Security · Computer Science 2012-02-17 Fabio F. G. Buono

Tamper-resilient cryptography studies how to protect data against adversaries who can physically manipulate codewords before they are decoded. The notion of tamper detection codes formalizes this goal, requiring that any unauthorized…

Quantum Physics · Physics 2025-09-17 Anne Broadbent , Upendra Kapshikar , Denis Rochette

Credential theft and remote attacks are the most serious threats to user authentication mechanisms. The crux of these problems is that we cannot control such behaviors. However, if a password does not contain user secrets, stealing it is…

Cryptography and Security · Computer Science 2024-06-03 Suyun Borjigin

Functional encryption is a powerful cryptographic primitive that enables fine-grained access to encrypted data and underlies numerous applications. Although the ideal security notion for FE (simulation security) has been shown to be…

Cryptography and Security · Computer Science 2026-01-27 Mohammed Barhoush , Arthur Mehta , Anne Müller , Louis Salvail

Many modern asymmetric encryption methods rely on prime numbers, as they have distinctive properties. For instance, the security of RSA cryptosystem relies on the computational difficulty of factoring a large composite number in its prime…

Cryptography and Security · Computer Science 2026-05-19 Anas A. Abudaqa , Nujud Alyami , Mostefa Kara , Farid Binbeshr , Muhammad Imam , Amjad Abuhassan

Homomorphic encryption has been an area of study in classical computing for decades. The fundamental goal of homomorphic encryption is to enable (untrusted) Oscar to perform a computation for Alice without Oscar knowing the input to the…

Quantum Physics · Physics 2020-09-02 Daniel O'Malley , John K. Golden

The conditional disclosure of secrets (CDS) setting is among the most basic primitives studied in information-theoretic cryptography. Motivated by a connection to non-local quantum computation and position-based cryptography, CDS with…

Quantum Physics · Physics 2026-04-01 Uma Girish , Alex May , Leo Orshansky , Chris Waddell

The essential insight of quantum error correction was that quantum information can be protected by suitably encoding this quantum information across multiple independently erred quantum systems. Recently it was realized that, since the most…

Quantum Physics · Physics 2007-05-23 Dave Bacon , Andrea Casaccino

A During last two decades, there has been a prolific growth in the chaos based image encryption algorithms. Up to an extent these algorithms have been able to provide an alternative to exchange large media files (images and videos) over the…

Cryptography and Security · Computer Science 2020-03-18 Vinod Patidar , N. K. Pareek , G. Purohit

Advanced Encryption Standard (AES) algorithm is considered as a secured algorithm. Still, some security issues lie in the S-Box and the key used. In this paper, we have tried to give focus on the security of the key used. Here, the proposed…

Cryptography and Security · Computer Science 2013-07-12 Chittaranjan Pradhan , Ajay Kumar Bisoi

Warnings have been raised about the steady diminution of privacy. More and more personal information, such as that contained electronic mail, is moving to cloud computing servers where it might be machine-searched and indexed. FauxCrypt is…

Cryptography and Security · Computer Science 2018-02-14 Devlin M. Gualtieri

Encryption and Decryption is the process of sending a message in a ciphered way that appears meaningless and could be deciphered using a key for security purposes to avoid data breaches. This paper expands on the previous work on…

Cryptography and Security · Computer Science 2026-01-16 Mithil Bavishi , Anuj Bohra , Kushal Vadodaria , Abhinav Bohra , Neha Katre , Ramchandra Mangrulkar , Vinaya Sawant

Secure multi-party computation provides a wide array of protocols for mutually distrustful parties be able to securely evaluate functions of private inputs. Within recent years, many such protocols have been proposed representing a plethora…

Cryptography and Security · Computer Science 2023-11-16 Kenneth Goss

Secure key distribution among two remote parties is impossible when both are classical, unless some unproven (and arguably unrealistic) computation-complexity assumptions are made, such as the difficulty of factorizing large numbers. On the…

Quantum Physics · Physics 2011-11-01 Michel Boyer , Ran Gelles , Dan Kenigsberg , Tal Mor

A probabilistic version of the Bernstein-Vazirani problem (which is a generalization of the original Bernstein-Vazirani problem) and a quantum algorithm to solve it are proposed. The problem involves finding one or more secret keys from a…

Quantum Physics · Physics 2025-06-09 Alok Shukla , Prakash Vedula

We propose a public key encryption cryptosystem based on solutions of linear equation systems with predefinition of input parameters through shared secret computation for factorizable substitutions. The existence of multiple equivalent…

Cryptography and Security · Computer Science 2025-07-14 Gennady Khalimov , Yevgen Kotukh

A novel original procedure of encryption/decryption based on the polyadic algebraic structures and on signal processing methods is proposed. First, we use signals with integer amplitudes to send information. Then we use polyadic techniques…

Cryptography and Security · Computer Science 2025-11-14 Steven Duplij , Qiang Guo

Crowdsourcing human-solving or online typing attacks are destructive problems. However, studies into these topics have been limited. In this paper, we focus on this kind of attacks whereby all the CAPTCHAs can be simply broken because of…

Cryptography and Security · Computer Science 2019-04-30 Jianyi Zhang , Xiali Hei , Zhiqiang Wang

Ciphers are a powerful tool for encrypting communication. There are many different cipher types, which makes it computationally expensive to solve a cipher using brute force. In this paper, we frame the decryption task as a classification…

Computation and Language · Computer Science 2023-06-16 Brendan Artley , Greg Mehdiyev

In this paper we investigate the use of quantum information to share classical secrets. While every quantum secret sharing scheme is a quantum error correcting code, the converse is not true. Motivated by this we sought to find quantum…

Quantum Physics · Physics 2011-04-07 Pradeep Kiran Sarvepalli , Andreas Klappenecker