0
votes
1answer
67 views

Should I add randomness at the end before AES?

Seen AES, changing a character drastically affects the ecrypted text. I want to make it harder to decrypt AES I send. So, it seems this can be done by adding some special code and some random bytes ...
0
votes
1answer
21 views

private-key can't be traced (GPG)?

I am very new to cryptography. I was reading about GPG/PGP Basics, and I have a doubt: As per my understanding, Everyone knows the algorithm (GPG) with which I generated my key pair. And If I give my ...
0
votes
1answer
21 views

Is a KDF needed when using X25519 for ECDH and XChaCha20-Poly1305 for AEAD?

Is a KDF needed when using X25519 for ECDH and XChaCha20-Poly1305 or XSalsa20-Poly1305 for authenticated encryption? My hypothesis is "no" because the key from X25519 is less than 256 bits long; ...
0
votes
1answer
88 views

New Improved Probabilistic version of RSA

On the 2nd page of "New probabilistic public-key encryption based on the RSA cryptosystem" by Roman'kov (PDF), at last it says Alice can find "f" of order "l" with least probability of (1-1/l). I ...
0
votes
1answer
40 views

Security of AES CTR with multiple messages containing the same known plain text

I have this scenario: The same plain text (that is part of an unkown bigger message) is being ecrypted multiple times using AES 128 CTR with a random key, the key is being transfered encrypted using ...
0
votes
1answer
38 views

DROWN Attack - Which is the SSLv2 vulnerability exploited?

In order to get the session key used in TLS communication, an attacker must capture X TLS handshakes based on RSA key encryption, and switch to a server supporting SSLv2 protocol, and sharing the same ...
0
votes
1answer
55 views

Symmetric cipher speed (AES vs Camellia vs Twofish)

If I have understand correct, Twofish is more secure (harder to break) than AES and Camellia, but Twofish is slower than AES and Camellia. But how can I mesure the speed difference between AES vs ...
0
votes
1answer
55 views

Is AES-CTR or ChaCha20 vulnerable to a time-memory trade off?

Is AES-CTR or ChaCha20 vulnerable to a time-memory trade-off attack? According to this paper it seems to be, which would put AES-CTR at a clearly breakable $2^{64}$ security level (for AES-128-CTR). ...
0
votes
1answer
34 views

Subscript R notation for the finite fields

I'm trying to understand the notation used in the literature for Pairing-based cryptography. I know (and I hope I've understood it well) from Wikipedia that $\mathbb{Z}_p$ is the finite field of ...
0
votes
1answer
81 views

One-time pad using RSA and Diffie-Hellman functions

Suppose that Alice and Bob use an encryption algorithm based on a one-way function $F$ (Eve knows it), and $r$, a secret key shared between Alice and Bob (Eve doesn't know it). Key is computed as: $K ...
0
votes
1answer
73 views

Clifford Cocks Interview: “Raising numbers to a power with the product as modulus”

Disclaimer: I'm new to cryptography Background: Clifford Cocks, the former GCHQ mathemetician and crytologist, gave an interview where he said: "My thinking was that you need something that is ...
0
votes
1answer
37 views

Can I open a file in plaintext (already decrypt) but the cipher doesn't change?

I want to create an app that encrypts a file and saves it to the Dropbox. Thus, I open and edit this file, I want the file is already decrypted, but the encrypted file that stored in Dropbox still in ...
0
votes
2answers
81 views

Can two files/strings have the same SHA-256 value?

I was wondering whether, theoretically, 2 files can have the same SHA-256 value. Since there are only $16^{256}$ or $2^{1024}$ SHA256 sums, all 1024-bit files (with $2^{1024}$ different combinations) ...
0
votes
1answer
107 views

Is regular CTR mode vulnerable to any attacks?

Regular plain CTR mode, is it vulnerable to any attack? I plan to write a program to encrypt a drive with ctr mode. Would this be wise? Would AES be better? When I look at this diagram, it looks ...
0
votes
1answer
47 views

Encryption using two keys

Suppose we have two secret keys K1 and K2, I'd like to ask if there is any encryption scheme that allows us to derive another key K12 from K1, and K2 and for a message x, EK12(x) = EK1(EK2(x)). EK(x) ...
0
votes
1answer
30 views

SSL Traffic Inspection

Is the firewall decrypted my session? There is an error "Certificate Not Trusted" (Server Certificate changed to Firewall Cyberoam Certificate). Which public Key I got? Is Main server Public Key or ...
0
votes
1answer
50 views

Is sharing the RSA public key secure?

I am trying to understand how RSA public key cryptography works. I have the following questions: Are any attacks / compromises possible if a server sends its public key $(n,e)$ in the clear to a ...
0
votes
1answer
41 views

Collusion Attack CP-ABE

Suppose that there are Alice with attributes $A$ and $C$ and Bob with attributes $B$ and $D$. I have a ciphertext with this policy: $A\ \operatorname{AND}\ B$. Why don't users collude ? If Alice ...
0
votes
1answer
44 views

Decrypting messages crypted with one time pad (used more than once)

I have a stream cipher with a key (that is unknown to me) that is used more than once. Messages are ciphered in this way: ciphered_message = message XOR key ...
0
votes
1answer
37 views

Key sizes for RSA over elliptic curves

I know that it is possible to define RSA over elliptic curves just as DSA and Diffie-Hellman have been. I know that it doesn't offer much of a speed advantage, but does it at least reduce the size of ...
0
votes
1answer
45 views

Does absence of second pre-image resistance infer absence of pre-image resistance?

Talking about hash functions, I know the hierarchy is as follows: Pre-image resistance Second pre-image resistance Collision resistance Where each property implies the one before it so 2nd ...
0
votes
2answers
125 views

How can prime factor of $q-1$ divide prime $q$?

In this paper - "A Subexponential Algorithm for the Discrete Logarithm Problem", author mentions (page 56), For each $p_l^{e_l} | q$ proceed.... $p_l^{e_l}$ is one of the prime factors of ...
0
votes
2answers
33 views

Can we share an n-bit string by using shamir's secret sharing n times?

For Shamir's Secret Sharing, with a secret of size $n$, instead of having a finite field of order $n$, can we just use Shamir's Secret Sharing $n$ times, once for each bit, using a field of order 2? ...
0
votes
1answer
42 views

Difference between single-pass and two-pass MACs

I am having trouble understanding where the count of "passes" come in. What constitutes a pass in the context of message authentication codes? How are single-pass MACs achieved?
0
votes
2answers
114 views

What is the typical block size in RSA?

If the input text is divided into a fixed block size for encryption and decryption, what could be the typical block size for RSA algorithm for different size of input like 8 MB, 16 MB, 126 MB and 256 ...
0
votes
1answer
47 views

Breaking the Rabin Signature system with chosen message attack

I heard that we can break the Rabin Signature system using chosen-message attack. I can't find a message to ask for its signature in order to spoof my message M. Any suggestions?
0
votes
1answer
51 views

Can OTP be made practical by using stretched hash algorithms? [duplicate]

One of the main reasons for not using OTP in everydays life is that it is highly impractical - for encrypting 4GB of files we need a 4GB key that needs to be exchanged secure. I've had an idea on how ...
0
votes
2answers
38 views

Is part of an output of secure PRNG also cryptographically secure?

Lets say I generate 192 bits using some secure PRNG. If I now take first 128 bits is it equivalent of generating 128 bits in the first place? P.S. More practical application for me is that I need a ...
0
votes
1answer
69 views

Secure blinding factor switching at malicious server-side (Switching in One Time pad)

Suppose all the values and operations are defined over a finite field $\mathbb{F}_p$ where $p$ is a large prime number. Assume all values are non-zero. Here $(z)^{-1}$ denotes multiplicative inverse ...
0
votes
1answer
75 views

What is the complexity to break second preimage resistance?

In the context an of hash functions we have three required properties. Preimage resistance Second preimage resistance Collision resistance. The bounds for Pre image collision is $O(2^{n-1})$, the ...
0
votes
1answer
89 views

SHA1 collisions and the impact for ECDSA signatures

What will it mean for ECDSA using SHA1 when we have practical attacks breaking the collision resistance property of SHA1? [UPDATE] Added a bit more details to be clear. If $(r,s)$ is the ECDSA ...
0
votes
2answers
98 views

RSA algorithm private key extraction

Decrypting messages can be done by using the following formula: $$M = C^d \mod n$$ Where $M$ is the decrypted message, $C$ is the encrypted message and $d$ is the private key Theoretically ...
0
votes
2answers
65 views

RSA numerical questions

Let $n$ be the modular arithmetic, $p$ and $q$ the two large primes such that $n=p*q$ and $e$ the public exponent. Here they are two "simple" numerical questions: If $p = 13$ and $q = 17$, what is ...
0
votes
1answer
105 views

Is this a good communication scheme?

I'm writing a wrapper for a chat program to allow for end-to-end encryption. I'm using Python and PyCrypto to accomplish this. I'd like to use a well known library to do this, but to my knowledge, ...
0
votes
1answer
61 views

Encryption Oracle Avoidance

I have a case where it may be possible for an adversary to deduce the plaintext inputs that went into creating a AES-128-GCM encrypted message (there is good IV diversity across the encrypted ...
0
votes
3answers
60 views

Defining Symmetric vs Asymmetric cryptosystems

I'm writing a project on the advantages and disadvantages of symmetric vs asymmetric cryptosystems. At the moment I am trying to define both systems using mathematical notation. Under the heading ...
0
votes
1answer
121 views

Combining a block cipher with a (pseudo) OTP

One of the drawbacks of OTP is that it can require an inconveniently long key. Besides that, it doesn’t provide data authentication. Therefore, I have been working on an algorithm idea, which I hope ...
0
votes
1answer
237 views

Help with RSA-2048 crypto ransom virus [closed]

The RSA-2048 Crypto Ransom Virus has devastated me, I tried the backup method, the previous version, the Shadow Explorer, it deleted all my restore points, Its took out 5 HDs and my USB pen that ...
0
votes
1answer
63 views

What are requirements of the audio input to be encrypted using AES?

I want to inquire that what are requirements of the audio input to be encrypted using AES. Is encrypting a mp3 file different from encrypting an aac file? Thanks!
0
votes
1answer
55 views

help understanding part of Wiener's attack on RSA w/ small d

In this paper, the author writes: Now $k\phi(N) = ed - 1 < ed$. Since $e < \phi(N)$, we see that $k <d < \frac{1}{3}N^{\frac{1}{4}}$. Hence, we obtain: $\mid \frac{e}{N} - ...
0
votes
1answer
173 views

Backdoorable hash function in password database

I want to use a (preferably established) hash function that is backdoorable in a password database. I want to do so because I need password escrow (being able to get the cleartext back. I want to ...
0
votes
1answer
162 views

Probability of guessing random 128-bit AES key [closed]

Consider the following five events: Correctly guessing a random 128-bit AES key on the first try Winning a lottery with 1 million contestants Winning a lottery with 1 million contestants 5 times in ...
0
votes
1answer
85 views

How can one protect against a Man In The Middle attack during key exchange without using certificates?

Besides using a certificate to defend against a man in the middle attack during a key exchange, what methods can be used?
0
votes
1answer
52 views

XTS-AES key management

XTS-AES uses two keys $(k_1, k_2)$, which are obtained from a concatenated key $k$. Does this key $k$ remain same for the whole disk or changes per sector?
0
votes
2answers
190 views

Secure Key exchange using javacard applet

I am working on a javacard applet project where i need... Secure communication between two applets let say there is applet A and applet B. Let say both applet has their own RSA key pairs. Now I ...
0
votes
1answer
77 views

Why does TLS 1.2 use GCM with additional SHA hash? [duplicate]

I am studying the cipher suites provided by TLS 1.2 and found an interesting question. TLS 1.2 adopts GCM for encryption and SHA256 or SHA384 for hash (e.g. TLS_RSA_WITH_AES_128_GCM_SHA256). But, GCM ...
0
votes
1answer
287 views

Is there a correct way to generate a symmetric key?

Looking in some cryptographic algorithms, I've realized that: The way the plain text is encrypted/decrypted is always specified, but what about the key? Every paper I've seen describing the algorithm ...
0
votes
3answers
108 views

Perfect hash function

Is a perfect hash function always bijective ? In Wiki "In mathematical terms, it is a total injective function" but it does not mean, that it is bijective.
0
votes
2answers
124 views

Need some understanding on RSA public key exponent

I am new in cryptography domain and try to build some understanding on RSA key pair generation. My doubt is on RSA public key exponent value . Can exponent be any value (prime or non prime numbers)? ...
0
votes
1answer
273 views

Encryption Algorithms in Verilog code

Can we implement Encryption Algorithms like RC4,AES and DES in Verilog? if no what are the limitations?

15 30 50 per page