1
vote
1answer
28 views

Some terms related to secret sharing: Optimality, What does it mean?

In any secret sharing scheme we have to develop step by step. After constructing such scheme we need to reduce share size. Why? e.g. Robust secret sharing scheme is modified Shamir secret sharing ...
2
votes
0answers
37 views

Is the ring learning with errors problem still hard if the errors are drawn from some subspace?

Let $R=\mathbb{Z}_p[x]/x^n+1$ be the ring used in normal RLWE, which is linear space over $\mathbb{Z}_p$ with dimension of $n$, let $S$ be a linear subspace of $R$ which described by linear ...
6
votes
0answers
56 views

Name of an archaic type of RSA padding (0BBBBBBB…)

In some legacy code, I encountered RSA signature padding in the following format (hexadecimal): 0B BB BB BB BB BB BB ... BB BB <hash> Is there a name for ...
2
votes
1answer
64 views

Why is Diffie-Hellman used instead of just RSA in key-exchange (TLS, IKE)?

Why should a key exchange protocol (such as in TLS or IKE) use Diffie Hellman? Why not just use RSA? For example: Alice picks a random session key, signs it, encrypts it with Bob's public key, and ...
1
vote
0answers
42 views

How can I obtain the raw decimal value of an RSA key's modulus?

So maybe I'm thinking about this too hard, or maybe I'm missing a piece of information. We'll use Google for this example. Say I wanted to obtain the modulus of Google's current public key. Well I ...
8
votes
3answers
626 views

Advantages/disadvantages of using symmetric encryption function as hash function?

Next to the traditional MD5 and SHA-1, other hashing algorithms exist based on symmetric encryption algorithms. An example is the Matyas–Meyer–Oseas construction. What are the advantages/...
4
votes
2answers
41 views

Why is synthetic IV (SIV) mode considered deterministic authenticated encryption (DAE)?

I was just going over my (old) notes from Coursera's Cryptography I course, and I was puzzled by the description of SIV as providing deterministic authenticated encryption (DAE). The general SIV ...
3
votes
1answer
56 views

identifying presence of encryption of zero in additive homomorphic encryption

Lets say the server has corpus of ciphertext contains $enc(a),enc(b),enc(c), \dotsc enc(x)$. The encryption function is an additive homomorphic scheme (like Paillier). The server knows only the public ...
2
votes
1answer
81 views

Calculating Polynomial Inverse with extended euclid in java

I'm trying to understand the NTRU-PKCS and therefor I wanted to code a naive Version of it. Now my Problem: I tried to calculate the inverse of a Polynomial with an extended Version of euclids ...
3
votes
1answer
67 views

Using Pollard's lambda in a key-recovery attack on DH

I've become interested in writing an exploit for the OpenSSL vulnerability here (CVE-2016-0701). Running through the bullets describing the attack, I can follow up to the last bullet point. Reviewing ...
2
votes
0answers
11 views

Can you extract the encryption key of a computer with full disk encryption via malware? [migrated]

I recently discovered the subject of cold boot attacks which are able to extract the encryption key of the ram memory after the computer has shut down. and from what I understand is that law ...
1
vote
0answers
30 views

What is the right tool to MPC linear equations system

Given two parties who have private inputes Player 1 - $X_1,...X_n$ Player 2 - $Y_1,...Y_n$ We want to compute a solution to a linear system equation: $f_1(X_1,...X_n,...Y_1,...Y_n) +h_1(X_1,......
5
votes
2answers
92 views

Zero-knowledge proof system which is not proof of knowledge?

I have learned that a zero-knowledge (ZK) proof system can be constructed by making use of the three-color problem. In this particular case, the proof system also happens to be proof of knowledge (POK)...
0
votes
1answer
18 views

linear cryptanalysis: how are the subkey bits removed from the linear approximation?

I'm currently reading the tutorial on linear/differential crypta here: https://www.engr.mun.ca/~howard/PAPERS/ldc_tutorial.pdf End of page 14/Beginning of page 15: all the bits from the subkeys are ...
2
votes
1answer
60 views

How to prove a lemma that is based on phi-hiding assumption?

Assume that the $\phi$-hiding assumption is true, i.e. that for a composite number $m$, a PPT adversary A cannot distinguish between a prime $p_0$ that divides $\phi(m)$ and another prime $p_1$ that ...
2
votes
1answer
33 views

How to select a good scale for letter frequency in a text?

I needed to use a scale in a code to determine which sentence in a file has been encrypted by a single-character key. The scale that i currently used is: +2 for every occurrence of a vowel or a ...
2
votes
1answer
87 views

Is this a proper key-exchange implementation?

I've been trying to implement Diffie Hellman key exchange so far from my own understandings (I know I could just stick with SSL/TLS, but I want to understand it in depth more), so I created this basic ...
1
vote
3answers
64 views

Is PGP's way of maintaining email security optimal? [duplicate]

I read a book called "computer networking: A top-down approach". It talked about how PGP creates an email message between Alice and Bob to maintain confidentiality, integrity, and authenticity. Let me ...
2
votes
1answer
82 views

Reversing a known encryption algorithm (4-byte repeating key XOR)

I've been practicing for an upcoming CTF competition, and I've finally reached the cryptography stage. I'm a complete newbie in this field (my knowledge is essentially that bcrypt is awesome and md5 ...
1
vote
1answer
33 views

How can I determine key length for message encrypted by many-time-pad?

For message $ m $ and key $ k $ I get encrypted message $ c $ ($ m \oplus k = c $) where $ length(k) < length(m) $. Additionally I know that message $ m $ is English text. Instead of using pure ...
2
votes
2answers
57 views

Security (CPA?,CCA?) in Authenticated identity-based encryption

When I read authenticated identity-based encryption by Ben Lynn, encryption works to send data from user A to user B where: $$a=e(d_{A},B)$$ $$s=H_{3}(Msg,K)$$ $$C=<s,\gamma \oplus H_{2}(a,s),H_{4(...
0
votes
0answers
44 views

How to encrypt huge data using RSA? [duplicate]

Is there any way to encrypt the huge amount of data using RSA? I was supposed it is possible but when I read some articles what I saw is that, this is bad practice or they say can only encrypt bit ...
1
vote
1answer
26 views

Which one is correct probability formula for the same master secret value in identity-based encryption

Assume two servers $(n=2)$ use the same domain curve parameters and same hash function $H:\{0,1\}^{*} \rightarrow G_{1}$ . Then the hash value for the same identity falls in same result and let it be ...
2
votes
0answers
25 views

Why SSH does not use a certificate authority in the same way as SSL [closed]

SSL requires the use of a trusted third party -- the certificate authority to verify a public key presented by a server to a client. SSH on the other hand relies on the client having the server's ...
3
votes
1answer
52 views

How to verify a sever's ECDSA fingerprint during SSH

I have read somewhere that Servers which have SSH access for users in the public can have their public key posted publicly (e.g., on a website), so that people who access such a server using SSH can ...
0
votes
1answer
47 views

Using Shor's algorithm to solve the discrete logarithm problem

I have read about Shor's algorithm and my understanding is that it can be used to factor large numbers efficiently. Can Shor's algorithm, though, be used to solve this problem: Find the number $e$ ...
3
votes
1answer
66 views

How can I create pre-determined encrypted results?

I want my encryption results to be the lyrics to Star Spangled Banner. The original text I'm encrypting would be, for instance, the menu to a local pizza place. I know what I want my passphrase to be. ...
7
votes
2answers
364 views

Can Shor's algorithm compromise RSA when both the public and private key are secret?

If RSA is to create a public private key pair and encryption is performed on plain test P to create cipher text C, given P and C could Shor's algorithm be used to find either of the public and private ...
0
votes
0answers
4 views

encryption used by onepass [migrated]

I use a password storage application on my mac called 1password ( see here: https://1password.com/). I was wondering if it encrypts the data it stores in my computer and decrypts it using a key made ...
-1
votes
0answers
37 views

Problem of revealing master secret key of others in identity-based encryption (ECDLP)

Please help me to consider the case where Server B tries to get the same master secret key of Server A. Server B ask private key for IDA from Server A. Then Server B extracts private key for same ...
0
votes
0answers
70 views

RSA PlainText without Knowing Private Key

I couldn't solve this problem for three days... In RSA, [n = 13, 19] [e = 3] c1 = m^3 = 83 mod 247 [e=5] c2 = m^5 = 97 mod 247 then, use ...
0
votes
0answers
27 views

correlation between the timing data produced by different keys with similar inputs in AES

Is there or can there be any correlation between the timing data produced by different keys with similar inputs in AES? If yes, what type of correlation?
1
vote
0answers
20 views

How share size is reduced in robust secret sharing?

THIS IS ROBUST SECRET SHARING SCHEME The dealer $\mathcal{D}$ wants to share a secret among the participants $\{P_1, P_2, \ldots, P_n\}$, where at most $t$ participants are malicious and $t<n/2$. ...
0
votes
0answers
67 views

Compute Modulo exponentiation with prime powers

The problem is to find x such that $$x = M^d \mod p^2$$, where M and d are large numbers, and p is a large prime. Ideally we only want to compute $M^d\mod p$ and then use the result to further ...
5
votes
1answer
67 views

Equality checking using additive homomorphic encryption

Given two ciphertexts $c_1 = enc(p_1)$ and $c_2= enc(p_2)$ using any additive homomorphic encryption scheme (or specifically Paillier). Can we find out whether the underlying plaintexts $p_1,p_2$ ...
1
vote
0answers
37 views

Truly Random Values [duplicate]

I am trying to build a one-time pad encryption software and I am thinking about simply using /dev/random to generate keys. My question is: Is it ...
0
votes
0answers
30 views

Has this forum been compromised by the NSA BULLRUN programme? [migrated]

Today, this site shows 24 thousand users in Cryptography. It runs in parallel with and is associated with StackOverflow boasting 6 million users. This site then clearly creates some leverage and ...
0
votes
1answer
21 views

Hash system to generate same (specified) hash from multiple datasets?

I have a hashed value $X$ and need to ensure that any of the data sets $D_1...D_n$ can be concatenated with a correctional value $C_1...C_n$ and passed into a hashing algorithm to result in the value ...
0
votes
1answer
57 views

How hard is it to generate a simultaneous MD5 and SHA1 collision?

I was recently reading that MD5 is "broken" because it's pretty easy to generate collisions (like 2^(L/2)). And the SHA1 (theoretically) fares no better. The ...
1
vote
0answers
38 views

Countering Cryptographic Attacks

By reading Camellia Design and Analysis document following is my understanding about few cryptographic attacks from designer point of view. Differential and Linear Crypt-analysis. Number of Active ...
3
votes
1answer
34 views

How does the key size in supersingular isogeny schemes relate to their security level?

I'm looking at the De Feo, Jao, and Plût 2014 paper: Towards quantum-resistant cryptosystems from supersingular elliptic curve isogenies. My understanding of section 3.2 Key Exchange, is that Alice'...
1
vote
2answers
34 views

What are KDF parameters in OpenSSL command-line utility for `enc`?

I refer to https://www.openssl.org/docs/manmaster/apps/enc.html and see that the only parameter for key derivation which I can set explicitly (not considering the obvious ...
1
vote
0answers
84 views

How to generate 1000 prime number of 1024-bit with much less time?

I am generating thousand prime number of 1024 bit each. But it takes lots of time. My procedure is as follows. Generate prime number using ...
1
vote
2answers
55 views

AES encryption for pairwise identifiers

I'd like to map a random ID of 16 bytes (sourceID) to another random ID of 16 bytes (targetID). The operation should: only be reversible by me be deterministic There are about 1 million source ...

15 30 50 per page