3
votes
0answers
28 views

Computational Randomized Encoding in the hybrid proof

A computational randomized encoding scheme $(\textrm{RE.Encode}, \textrm{RE.Decode})$ works as follows: $\textrm{RE.Encode}(1^\lambda, C, x, r)$: takes as input the security parameter $\lambda$ in ...
4
votes
1answer
78 views

How does one practically calculate the non-linearity of a multi-output boolean function like the AES s-box?

I am working on multi-output boolean function i.e. a function that takes an $n$-bit input and gives an $m$-bit output for all possible inputs (i.e. $2^n$ inputs). To be more exact: I am trying to do ...
-2
votes
0answers
61 views

Help with a ctf im stuch on, base64 encryption [closed]

So my friend and I were trying to do this ctf challenge here labyrenth .com and when we were trying to solve the first part of the "Threat" challenges we stumbled upon a challenge we have no idea how ...
2
votes
1answer
64 views

SEAL Homomorphic multiplication

In SEAL homomorphic encryption library, there is an internal procedure to decompose a polynomial with large coefficients into a vector of polynomials with smaller coefficients. The procedure is ...
3
votes
1answer
36 views

How to distribute system parameters in identity-based encryption

Identity-based encryption papers describe that system parameters are declared as public. However,in real scenario, how to distribute system parameters to users?
1
vote
1answer
21 views

Time efficiency of Bitcoin Multi-signature Vs. threshold signature

I read this paper (Securing Bitcoin wallets via a new DSA/ECDSA threshold signature scheme) that illustrated that threshold signature is the best solution to avoid single point of failure but I think ...
-3
votes
2answers
61 views

Why are asymmetric keys represented as base 64? [closed]

When one generates a public and private key with say a total of 4096 bits, why does the program output what I assume to be base 64 instead of base 10 or binary?
6
votes
1answer
113 views

Designing Secure Multi-Party Computation Sub-Protocols Based on Homomorphic Encryption

When designing SMPC protocols using secret-sharing, it is a common approach to compose a protocol from several sub-protocols (each proven secure under the formal definition of security w.r.t. semi-...
1
vote
1answer
69 views

How to choose key from string?

do you know any methods for choosing specific position in text for a key? Background: Lets suppose, that I want to encode message to friend: Text1 (not too long - max 1000 chars). I have made ...
6
votes
1answer
5k views

Can I remove newlines in a public key?

Can I remove new lines from the RSA public key file to get a one line string? So the question is if the key looks like this AAA BBB CCC or ...
1
vote
0answers
15 views

Unique decentralized ID systems

We are all familiar with the standard decentralized ID system, the web of trust, e.g. for PGP keys. However, normal web of trust systems are unable to guarantee uniqueness — there's no practical limit ...
6
votes
0answers
80 views

Are there any signatures based on matrix multiplication with noise?

Are there any signatures based on matrix multiplication with noise? Representing the message as a matrix and multiplying with some randomness coming from another matrix such that the signature itself ...
5
votes
2answers
750 views

Would it be better to split a file and then encrypt, or vice versa?

Assuming that you are paranoid before storing your file (distributed across a shared location), which will be the best case scenario: splitting the file first and then encrypting or encrypting first ...
7
votes
1answer
494 views

Timing attack on RSA as used by CryptoLocker?

So far I have researched timing attacks on RSA, We all know the ransomware named CryptoLocker uses RSA 2048 bit encryption. Now, is it possible to break the encryption using a timing attack. I have ...
5
votes
1answer
409 views

Toy encryption system that provides “hints”

I'm looking for a toy encryption system that has a specific property that when decrypting it with a key that is close enough to the key used in the encryption, it will produce some of the original ...
0
votes
1answer
73 views

Key Hierarchy and key Encryption

If i have two 56-bit DES keys, and I use these two key to encrypt a 256-bit AES key. Like this $K_{AT}$ encrypts $K_{BT}$ and $K_{BT}$ encrypts $K$ What is the effective security of key $K$? Is it $...
-1
votes
0answers
23 views

Meaning of Policy matches when signing SSL certificates

I was going over the process of doing a self-signed SSL certificate. The config file here is one of the inputs to this process (see: https://www.phildev.net/ssl/opensslconf.html) I have a question ...
0
votes
0answers
23 views

How does the openssl TLS implementation select the ciphersuite?

I would like to ask some help in pointing to me how the oopenssl TLS 1.2 server implementation selects the chosen ciphersuite? Does the server selects the first ciphersuite that is in the server's ...
12
votes
4answers
4k views

Why is a known-plaintext attack considered a complete break?

I read somewhere that if a cipher has a known-plaintext attack, then it is considered completely broken. Say there is a cipher that someone uses where the algorithm is understood and a known-...
1
vote
1answer
40 views

What is the logic behind Compress function in iterated hash function

I am working on cryptographic hash functions theorems. In the iterated hash functions part a specific word started appearing constantly: "Compress" for instance within the "compress function". I am ...
0
votes
0answers
25 views

openssl AES, cannot decrypt with java [closed]

i'm using openssl to encrypt some data, which will decrypted with an java serverlet. Server isn't under my control, so i cannot install/modify anything on it. The question is how i can encrypt AES ...
0
votes
0answers
20 views

Do I need output buffer to be multiple of AES block size for CTR mode? [migrated]

In my C code, I use OpenSSL's AES in CTR mode for encryption via EVP interface, that is I have something like this: ...
6
votes
1answer
129 views

Is solving $m^3 = k*n + c$ hard?

Given the equation $$m^3 = k\cdot n + c$$ I know $n$ and $c$, and I need to find $k$, so that $m$ is a natural number. $n$ and $c$ are large numbers, so i can't use bruteforce. How can you find a ...
0
votes
2answers
60 views

Is this RSA signing and verification process secure?

I need to verify that messages in a communications program are from valid senders. Below is a highlevel outline of how I think the process would work. The connections themselves are done over TLS. The ...
-1
votes
0answers
22 views

initialling SAM (Secure ACCESS MODULE) [closed]

I'm working on the AFC (automatic fare collection) system which required a SAM( secure access module) for key management.system works fine with local key management in MCU and I don't have any ...
5
votes
2answers
553 views

Can elliptic curve (25519) be used to encrypt file?

This is probably a simple question, but I haven't been able to see it stated anywhere. Is it possible to directly encrypt a file (of any length) with some form of EC using the 25519 curve. I know it'...
-4
votes
0answers
32 views
5
votes
1answer
75 views

Difference between hierarchical and multi level secret sharing

In this paper, the definitions are simply as follows. Multi-Level secret sharing: Higher level participants can help lower participants to get the secret. Compartmented secret sharing: Each level ...
3
votes
1answer
122 views

Why should $a,b < N$ for Montgomery Reduction?

In Montgomery reduction, when calculating $a \times b \mod N$, it is required that $a \lt N$ and $b \lt N$. I think $0 \le T \lt N \times R$ is enough for the Montgomery Reduction. Rationale: Let $a'...
2
votes
1answer
129 views

Using e-ID Number for Encryption and Digital Signing

I want to use e-ID number for performing Encryption/Decryption and Digital Signing - and in order to do so, I've opted a PGP-oriented approach which goes a bit like this. Generating PGP key-pair ...
11
votes
1answer
480 views

Compact digital signature for noisy data

The question asks for a signature scheme, with a public verification procedure, that is tolerant to minor alterations of the signed data during its transmission [possibly in analog form over some ...
3
votes
3answers
1k views

RSA digital signature vs authenticated cipher

I want to provide both confidentiality and integrity for data at rest (many large files stored on disk). I plan to encrypt the data using AES, which will cover the confidentiality requirement. So ...
0
votes
1answer
134 views

What is Group in Diffie-Hellman?

I understand how Diffie-Hellman key-exchange works. Mainly, two parties agrees in a prime $p$ and a generator $g$. Then one party selects its private exponenet $x$, computes its public value $g^x \...
0
votes
0answers
30 views

CDH <=> and Square-DH. Square root problem

Here describes a way of proving CDH <=> and Square-DH. The thinkg I don't get - how to efficiently compute $CDH(U,V)$ from $CDH(U,V)^2$. Isn't Square root problem is hard in general? (In case of ...
5
votes
1answer
81 views

Strange notation using dollar sign

In the paper Multi-Signatures in the Plain Public-Key Model and a General Forking Lemma, the authors Bellare and Neven use notation which looks like left arrow with dollar sign above it. Authors ...
-1
votes
1answer
80 views

Can I calculate $d$ given only RSA’s $c$, $n$ and $e$?

The question “Calculating RSA private exponent when given public exponent and the modulus factors using extended euclid” assumes the factors are known. This got me wondering if it is possible to ...
2
votes
0answers
47 views

Avoiding doubled letters in encrypted text

I have an encrypted string based on an "alphabet" of 29 runes and access to successfully decrypted (runes->English) plaintext. Testing for a Vigenere cipher, I tried a Friedman attack (aka Kappa test, ...
3
votes
3answers
411 views

Fast PKI for embedded device

We are creating a device with a small microcontroller (20 MHz CPU 16 KiB RAM). We need some way to securely send signed files to device (only signature, no encryption necessary). An external company ...
2
votes
1answer
45 views

Do reversible black box obfuscators exist?

We shall say that an obfuscator $\mathcal{O}$ is a reversible black box obfuscator if for each reversible program $P$ the obfuscated program $\mathcal{O}(P)$ is still reversible but does not reveal ...
1
vote
1answer
64 views

How was the AES MixColumns matrix constructed?

How was the constant matrix in AES MixColumns constructed? \begin{bmatrix} 02 & 03 & 01 & 01 \\ 01 & 02 & 03 & 01 \\ 01 & 01 & 02 & 03 \\ 03 & 01 & 01 &...
1
vote
1answer
18 views

Extra attributes in a certificate signing request

When creating a certificate signing request, there is a part where openssl says "Please enter the following extra attributes to be sent with your certificate request". One of these is a challenge ...
0
votes
2answers
65 views

security of using digital signature as key derivation material

I want all keys in my iOS application to rely on the Secure Enclave for security as the iOS keychain becomes insecure on jailbroken devices. Currently, the Secure Enclave currently only supports ...
3
votes
4answers
16k views

Where i can find an AES implementation in python? [closed]

Where i can find a "reviewed" version of AES implementation in python. Not an API like PyCrypto whereby you can call AES algorithms in a single line.
1
vote
1answer
57 views

Is a stream cipher similar to One-Time Pad using hash secure?

I've read some Q&A about combining OTP with hash on this site, but I still wonder why some answers said that using hash for OTP key is not strong enough to resist brute force attack? Assuming ...
1
vote
0answers
85 views

proving indistinguishability of joint distribution using hybrid argument

Using Hybrid Argument, I want to prove following equivalence: $$\{X,Y,Z\}\equiv \{X',Y',Z'\}$$ by proving following equivalences: $\{X,Y,Z\}\equiv \{X,Y,Z'\}$(1) $\{X,Y,Z'\}\equiv \{X,Y',Z'\}$(2) $\...
-1
votes
1answer
75 views

Why does Paillier have poor performance?

Can anyone explain to me why Paillier crypto system does not provide good performance? I read here (pdf) that RSA and ElGamal provide better performance than Paillier algorithm.
5
votes
1answer
105 views

Does adding more characters to the Enigma rotors improve crypto strength?

This seems like an obvious question but I haven't been able to find it, so here goes: Enigma is based on an alphabet of A-Z (26 characters); obviously this directly affects message content (e.g. ...
17
votes
5answers
1k views

Can an Enigma-style cipher of sufficient complexity be considered secure today?

Regarding the German Enigma machines, if I recall correctly, the reason they were defeated was because the Allies were able to generate a massive database of possible rotor settings, and because the ...
6
votes
1answer
164 views

Least-weak way to authenticate using only AES ECB/CBC

I have an embedded application that needs to occasionally get secure updates from a server. The only crypto library I have available for the chip is an AES-256 cipher (ECB and CBC, encrypt/decrypt). ...
16
votes
2answers
1k views

GPG/PGP Verification of Revocation

How does one verify a key revocation? After revoking a key and sending the revocation to MIT's keyserver, I noticed that the key is listed as such: ...

15 30 50 per page