6
votes
5answers
5k views

How do ciphers change plaintext into numeric digits for computing?

For example, in RSA, we use this for encryption: $ciphertext = (m^e \mod n)$ and for decryption. If our message is "hello world", then what number do we have to ...
0
votes
0answers
277 views

Changing plaintext for encryption in RSA [duplicate]

In the RSA crypto scheme, the message $x$ (plaintext), is encrypted to produce ciphertext ($y$), by computing $x^e \bmod n$. Of course, that means that $x$ has to be a numeric value for this to work, ...
-1
votes
1answer
64 views

How to calculate this binary operation? [on hold]

I found this binary operation, however It is the first time that I found this operator '.' : That is the equation: 02 • 63 = 00000010 • 01100011 = 11000110 I don't understand how 0 • 0=1 I ...
0
votes
0answers
4 views

OpenSSL: Generate ECDSA key and CSR [migrated]

I know how to generate an RSA Private Key and CSR: openssl genrsa -out my.key.pem 2048 openssl req -new -sha256 -key my.key.pem -out my.csr But, How do I do the ...
-1
votes
0answers
27 views

Anyone know of a portion of the Enigma Code? [on hold]

I was reading about it today and it sounds like it would be a fun thing to try to decode. Problem is that I can't find a portion anywhere. Is it classified or am I not looking in the right spots
3
votes
2answers
185 views

Is the security of MAC function is based on HASH function

It is widely known, generally, that a MAC is a HASH with key. I just want to ensure that my understanding is correct to avoid base further assumptions on wrong conception. So, if I used MAC that uses ...
1
vote
1answer
34 views

Randomized functions cannot increase statistical distance

In these lecture notes instructor Chris Peikert states the following lemma without a proof Let $f$ be a (randomized) function on the domain of $X$, $Y$. We have $\triangle (f(X), f(Y)) \leq \...
5
votes
1answer
74 views

Problem with LLL reduction on truncated LCG schemes

I am struggling to apply Freize et al. paper to break a truncated LCG. A truncated LCG is a pseudo random generator that outputs the $n$ leading bits $y_i$ of $x_i$, where $(x_i)$ is such that $x_{...
0
votes
1answer
31 views

Easily reversible hash functions as a method of data transmission [duplicate]

I've been looking through the literature because I want to see if anyone has implemented this idea I have. I know data compression algorithms work by removing redundancy in data. I was wondering ...
6
votes
1answer
569 views

Is unusual (non power-of-two) RSA key size more secure?

On this blog https://blog.josefsson.org/2014/06/23/offline-gnupg-master-key-and-subkeys-on-yubikey-neo-smartcard/ there is a following sentence Generate master key Below I will use a 3744 bit ...
2
votes
1answer
473 views

DES S-Box properties

Two of the properties that lead to the design of DES S-Boxes are: For any non-zero 6-bit difference between inputs, no more than 8 of the 32 pairs of inputs exhibiting that difference may result in ...
3
votes
1answer
63 views

How to create reduction functions in rainbow tables?

I have been trying to understand rainbow tables lately and one part is giving me trouble to understand here. Let's say I want to generate a table where the chains are 100 000 hash/plaintext long. I ...
10
votes
4answers
2k views

Desirable S-box properties

What desirable properties should an S-box have? My current standard selection process is to just pick them at random and verify that they fit the following criteria: The probability that any random ...
5
votes
2answers
89 views

Is the difference distribution table of AES S-box uniform?

I am studying about various block ciphers and their weaknesses, so I have a doubt about AES S-boxes, Is the difference distribution table of AES uniform ?
0
votes
1answer
47 views

Can I discard a specific X509 signature from file?

I'm writing a program to sign files using X.509 certificates and .NET framework classes. My users can sign the same file more than once without any problem (like a revision process). So, a file may ...
1
vote
1answer
23 views

Time complexity of looking up in a rainbow table

It is mentioned in the famous paper Making a Faster Cryptanalytic Time-Memory Trade-Off (pdf) by Philippe Oechslin that: The total number of calculations we have to make is thus $\frac{t(t−1)}{2}...
1
vote
0answers
25 views

Mitigating weaknesses in RC4 [duplicate]

I've been researching RC4 and implementing it, and I was wondering, from the perspective of a cryptographer (a real one, not a fake one like me), what could be added to the RC4 algorithm to improve on ...
3
votes
0answers
26 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 ...
3
votes
1answer
72 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
49 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
62 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
111 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
68 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 ...
5
votes
0answers
73 views
+100

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
493 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
408 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
22 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
39 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
24 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
127 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
59 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
19 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
551 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
74 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 ...
10
votes
1answer
473 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 \...

15 30 50 per page