4
votes
2answers
631 views

Understanding elliptic curve encryption

I'm having a hard time understanding the elliptic curve encryption. One thing thing I don't understand is listing all the points on the curve mod p. Suppose I have the following elliptic curve: $y^2 = ...
1
vote
1answer
30 views

How AES treat string input to encrypt data and what will happen if the cipher key is less than that expected?

The official docs of AES have several example of how hexadecimal or byte input can be encrypted. I have some problem about the input text and cipher key. My question is: How can encrypt string input ...
0
votes
0answers
7 views

Encryption algorithms larger than 256 Bit for Big Data encryption?

I'm somewhat new to encryption. So, Why is 256 Bit the max I see on encryption programs for Big data. Can more powerful encryption algorithms be used practically?
0
votes
0answers
8 views

One time pad ciphers in emails

In order to achieve very high security for privacy, would it be smart to use one time pad ciphers in emails? The distribution of the keyword would pose no problems since I would distribute it to other ...
3
votes
2answers
175 views

What are the practical implications of ciphertext distinguishability?

Commonly there are four ways to "break" a secrecy-focused cryptosystem: Recover the secret key Recover the message Distinguish an encryption from random noise Distinguish the encryption of two ...
0
votes
1answer
17 views

ElGamal in $Z^*_{p^n}$

If $p$ is an odd prime and $n$ natural,it is known that the group $Z^*_{p^n}$ is cyclic.Explain why the selection-choice of the group $Z^*_{{3^{1000}}}$ for the construction of a cryptosystem ElGamal ...
3
votes
0answers
139 views

Has anyone heard of matrix-based “Roman Doll” encryption techniques?

I've been told that prime-number factoring is based on a "roman-doll" sequence of matrices, where a seed matrix of height Y and width X exists consisting of all zeros except for a single 1 at row Y ...
-2
votes
0answers
20 views

What is stream cipher? Where are we using stream ciphers? [on hold]

What are the characteristics of stream ciphers? In what kind of applications we are using stream ciphers? Please mention some practical usage of stream ciphers.
2
votes
2answers
30 views

What is the advantage of AEAD ciphers?

What is the advantage of AEAD ciphers? Why is the TLS working group pushing for them? I thought modern cipher suites require SHA256 for authentication. What advantage is there to including Poly1305?
2
votes
2answers
52 views

Can we solve the Hidden Number Problem in $GF(2^n)$?

Is it possible to solve the Hidden Number Problem in extension fields? In particular in $GF(2^n)$? Let's suppose an attacker knows some least/most significant bits of $r_i = a_i \times k$ in a given ...
2
votes
2answers
72 views

Present an attack for the combination of OTP and textbook RSA

Let $N=p \times q$ where $p$ and $q$ are two primes. Compute $\Phi (N) = (p-1)(q-1)$. Choose $e$ s.t. $1 < e < \Phi(N)$ and $gcd(e,\Phi(N))=1$. Compute $d = e^{-1}(mod \ \Phi(N))$. ...
1
vote
2answers
34 views

Let $F$ be a PRF, is the following $G(x)=F_{0…0}(x)∥F_{0…1}(x)|| … ||F_{1…1}(x)$ a PRG?

$F$ is a PRF with $n$ bit key, input, and output length. I know the answer is "NO it isn't!", but I can't understand why. Is that because on any input $x$, the keys for every $F$ in the concatenation ...
2
votes
3answers
81 views

Attack on Double Encryption Scheme

In this protocol: A → B : { <[A, {K}pk(B)]> }pk(B) B → A : { <[B, {K}pk(A)]> }pk(A) I'd like to determine why this is insecure. How can the attacker learn the key K if A and B are both ...
0
votes
0answers
14 views

Cryptanalysis on two time pad ciphers? [duplicate]

One time pad ciphers are unbreakable if the message is encrypted correctly and if only used once. However if used more than once, it becomes decipherable. How come? Also, would it be smart to use one ...
-2
votes
0answers
15 views

where could I find info on number based ciphers specifically? [on hold]

I am trying to decode some conversations in a game and would like any help that could be offered. The Conversations are a string of Numbers and spaces without punctuation. Since I know almost ...
2
votes
1answer
201 views

Is $G$ a secure PRG?

Is the following function a secure PRG? Given $F$ is a secure PRG and $k$ is choosen random from key space $K$. $$G(x) = F(k,x) \oplus F(k,x \oplus 1^s)$$ My solution is $x \oplus 1^s = x'$ ...
0
votes
0answers
21 views

How to verify perfect secrecy of a cryptosystem? [on hold]

I’m playing with a self-made encryption algorithm: “a new approach to data encryption” by Suhail Yazji (video available at youtube.com/watch?v=h1kABn5dfXc). How can I prove my algorithm to be ...
1
vote
0answers
27 views

Prove that certain amount of data was stored

I'm looking for a way to prove that a certain amount of data was stored, through some easily verifiable piece of information. Similarly to how proof-of-work can prove through a hash that a certain ...
1
vote
1answer
44 views

Knowing that $G(s)$ is a PRG, is the following construction $G'(s) = G(s||0)$ a PRG?

I know there already is a very similar question. However, I can't understand why $G'(s)$ is not a PRG. If $G(s)$ is a PRG, then why $G(s||0)$ can't also be a PRG? How can the distribution over ...
1
vote
0answers
51 views

ElGamal signatures systems

Let $p$ prime number $q/p-1$ prime and $g\in (Z/pZ)^*$ element of order $q$.Also $a\in \{1,...,q-1\}$ the private key and $y\equiv g^a\pmod p$ the correspoding public key.For each of the following ...
8
votes
2answers
938 views

Why should I use Authenticated Encryption instead of just encryption?

There are various different modes of operation for block cipher use, some of which provide "encryption" and some of which provide authenticated encryption. Why should I use an authenticated ...
6
votes
4answers
364 views

Is there a proof for showing any cryptogram is crackable?

I commonly hear statements along the lines of "all cryptograms are crackable - it's only a matter of time". Is there a proof to show that any cryptogram is "crackable"? The proof may be of a more ...
7
votes
4answers
4k views

Simply put, what does perfect secrecy means?

I would like to ask for a clear (but maybe not so deep) explanation of what the term "perfect secrecy" means. As far as I have researched and understood, it has to do with probabilities of assuming ...
0
votes
0answers
28 views

getting different wrong decryption points on elliptic curve [on hold]

i am working on image encryption using elliptic curve cryptography, and i am using MATLAB and -- pair{KG, Pm+KPb} is for encryption and to decrypt it subtract Y*(KG)from Pm+KPb ie. Pm+KPb-Y*(KG), ...
1
vote
1answer
30 views

For $p=23$, $g=2$, $q=11$ you are given the signature $(18,3)$ in the message $m=2$. Construct a signature in the message $m'=3$

Alice uses an ElGamal signature in group $(Z/pZ)^{*}$ without using hash function. To sign the message $m \in (Z/pZ)^*$ calculates the signature $(r,s)$ as follows: choose random $k \in \{0, 1, ...
0
votes
1answer
63 views

Point addition in NaCl/libsodium (Curve25519)

In NaCl and libsodium, the crypto_scalarmult function implements the operation $Q = kP$ (scalar/point multiplication). There doesn't seem to be a function for point ...
5
votes
1answer
112 views
+50

What if the p and q used in keys generation of Pailler cryptosystem are composite?

I've seen a few implementations of Paillier cryptosystem that uses probable primes to choose $p$ and $q$. Assuming that a keypair is generated with $p$ and $q$ that are coprime and that $pq$ is ...
-2
votes
0answers
13 views

What is the definition of “the correlation” and “the difference propagation probability”? [on hold]

Non linearity has two properties: 1. the correlation 2. the difference propagation probability what is the definition of each concept?
-1
votes
0answers
30 views

parallel shifters [closed]

suppose there is two registers each of size 8 bit and the inputs to these register are in parallel so can we combine this 2 register so that new combined register will have input 16 bits and all are ...
-1
votes
0answers
19 views
4
votes
2answers
249 views

AES-CTR with ephemeral keys vs IV

Let's say that we have a key exchange of some sort, which leaves A and B sharing the long-term secret $S$. Then, A and B want to use AES-CTR for the communication, which leaves us with several ...
4
votes
0answers
61 views

Attacks on elliptic-curve based cryptosystems through solving the Decisional Diffie-Hellman Problem with the Weil Pairing

Are there any examples of practical attacks on cryptosystems set over elliptic curves which utilize the easiness of DDH for certain choices of curves $E(\textbf{F}_q)$, and as such their lack of ...
0
votes
0answers
16 views

Light weight crypto library implementations [migrated]

Are there any open source crypto libraries that can be used in embedded systems or in other memory constrained places like a boot rom? I am looking for libraries that I can compile only the algorithms ...
0
votes
0answers
26 views

Basic cryptography [on hold]

{First of all I'd like to apologise about my English} I'm interested in most popular cryptography encodements, but ones, where the substitution cipher is known (for example Caesar's code), not created ...
3
votes
2answers
180 views

PGP String to Key specifiers

I've been reading through the PGP Standard and here I'm a little confused. This section is discussing converting string data to a session key. I'm confused about the paragraph in bold. First off, what ...
13
votes
6answers
2k views

Why should I make my cipher public?

As I understand it, the less people know about the internals of my protocol or cipher, the more secure the protocol is. However Kerckhoffs's principle states that A cryptosystem should be secure ...
3
votes
0answers
64 views

Example: pre-image resistance to second pre-image resistance

It is possible to convert a pre-image resistant function $f:\{0,1\}^{n}\rightarrow \{0,1\}^{n}$ to a second-preimage resistant function? I am thinking to use a pseudo-random generator and construct ...
1
vote
0answers
26 views

What consequences do the plaintext space size has on the performances in the BGV scheme?

In the BGV paper [1], the authors say in §5.4 that you can have $\mathbb{Z}_p$ as plaintext size with a large $p$. What is the impact of the size of $p$ on the ciphertext size and computational work ...
0
votes
0answers
28 views

Help me find out what type of encryption this is. [on hold]

Alright this may not be an easy one. May not be something anyone knows. What I do know already (and I have made a password recovery tool from what I have learned) The password is translated into a ...
0
votes
0answers
20 views
2
votes
2answers
94 views

Is there any such thing as “proof of location”?

I'm looking for a way for someone to prove to me their geographical location without a trusted third-party. Imagine wanting to prove to someone you're actually physically in a specific place. I'd ...
5
votes
2answers
170 views

Why calculate pi to estimate randomness?

Why do testing suites calculate pi using the Monte Carlo method to determine if a series of numbers are random? As far as I can tell, the Monte Carlo method can be used to estimate pi itself (as a ...
0
votes
0answers
64 views

I don't know whattype of cipher this is [on hold]

I am trying to solve the following sipher Nosdhiibotidcylhrdeovedljuetre I have no experience with ciphers but substitution didn't seem to work, and since its a long string without breaks process of ...
2
votes
1answer
118 views

In HMQV, can one use multiple identities with one public key?

The HMQV protocol has 2 "identity" fields $\hat{A}, \hat{B}$ that are used in the dual signature - and it tries to guarantee that any properly-generated session key is only shared by a single $(A, B, ...
1
vote
0answers
50 views

Library to find an addition chain for a large number? [on hold]

I need a short addition chain for a number $n>2^{100}$ in order to implement a fast exponentiation. The memory footprint is not important. Finding an optimal chain for a large number $n$ is ...
2
votes
0answers
54 views

Words having weight near to minimum distance

I am studying the NP-Problem of the codes Syndrome Decoding. The formulation is show below. Input: a binary matrix $H$ of dimension $r \times n$ and a bit string $S$ of length $r$. Property: there ...
5
votes
2answers
217 views

Is standardizing a modified AES a good idea?

"Recently" the Ukraine standardized a new block cipher Kalyna, which according to the abstract of"A New Encryption Standard of Ukraine: The Kalyna Block Cipher" by Oliynykov et al. (warning: the paper ...
3
votes
2answers
138 views

Signature and hash function properties

I understand the need for the hash function to be collision resistant and second pre-image resistant. For what reason, exactly, does a hash function need to be pre-image resistant? If this property ...
1
vote
1answer
64 views

Is Paillier cryptosystem commutative?

Is Paillier cryptosystem commutative? If not, how can we construct an oblivious decryption protocol based on Paillier?
-2
votes
1answer
32 views

In which step does AES use the key to encrypt data?

AES has the following steps in encryption: SubBytes, ShiftRows, MixColumns, and AddRoundKey and the following steps in decryption: InvSubBytes, InvShiftRows, InvMixColumns, and Inverse of AddRoundKey. ...

15 30 50 per page