Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 237,042,334 papers from all fields of science
Search
Sign In
Create Free Account
Ciphertext expansion
In cryptography, the term ciphertext expansion refers to the length increase of a message when it is encrypted. Many modern cryptosystems cause some…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
6 relations
Ciphertext
Cryptography
Data compression
Encryption
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2020
2020
Anonymous IBE From Quadratic Residue With Fast Encryption
Xiaopeng Zhao
,
Z. Cao
,
Xiaolei Dong
,
Jinwen Zheng
IACR Cryptology ePrint Archive
2020
Corpus ID: 219711134
. We develop two variants of Cocks’ identity-based encryption. One variant has faster encryption which is as efficient as RSA…
Expand
2019
2019
Key Encapsulation Mechanism From Modular Multivariate Linear Equations
M. Ariffin
,
Abderrahmane Nitaj
,
Yanbin Pan
,
N. A. Abu
IACR Cryptology ePrint Archive
2019
Corpus ID: 60442719
In this article we discuss the modular pentavariate and hexavariate linear equations and its usefulness for asymmetric…
Expand
2019
2019
A New Encryption Scheme Based On Subset Identifying Problem
M. Ariffin
IACR Cryptology ePrint Archive
2019
Corpus ID: 208878796
In this article we put forward an encryption mechanism that dwells on the problem of identifying the correct subset of primes…
Expand
2016
2016
AEZ v 4 . 1 : Authenticated Encryption by Enciphering
U. Barbara
2016
Corpus ID: 16033262
AEZ encrypts by appending to the plaintext a fixed authentication block and then enciphering the resulting string with an…
Expand
2016
2016
Can there be efficient and natural FHE schemes ? ?
Kristian Gjøsteen
,
M. Strand
2016
Corpus ID: 1386577
In 1978, Rivest, Adleman and Dertouzos asked for algebraic systems for which useful privacy homomorphisms exist. To date, the…
Expand
2016
2016
Fully homomorphic encryption must be fat or ugly?
Kristian Gjøsteen
,
M. Strand
IACR Cryptology ePrint Archive
2016
Corpus ID: 18937039
In 1978, Rivest, Adleman and Dertouzos asked for algebraic systems for which useful privacy homomorphisms exist. To date, the…
Expand
2016
2016
BITMIX: A hardware accelerated randomized symmetric encryption method
Sándor Lukács
,
Adrian Colesa
,
G. Sebestyen
International Conference on Automation, Quality…
2016
Corpus ID: 7576508
We propose a probabilistic symmetric encryption method that heavily relies on true-random numbers, both to XOR the plaintext with…
Expand
2013
2013
Chosen Ciphertext Secure (CCS): Stateful Symmetric Key CCA Encryption with Minimal Ciphertext Expansion
J. Trostle
IACR Cryptology ePrint Archive
2013
Corpus ID: 16175329
In some wireless environments, minimizing the size of messages is paramount due to the resulting significant energy savings. We…
Expand