# All Questions

198 views

### Computation indistinguishability questions

The definition I have is: Two probability ensembles $X = \{X_n\}_{n \in \mathbf{N}}$ and $X = \{Y_n\}_{n \in \mathbf{N}}$ are computationally indistinguishable if for every probabilistic ...
74 views

### Why not put MAC in fixed position and cover padding for MAC-then-encrypt?

The biggest problem with using MtE with a mode where it's known to be secure (CBC) is with the padding, where you can't retrieve the authentication until you know where it is by looking at the padding ...
117 views

### What is a Key Derivation Function?

From Wikipedia: In cryptography, a key derivation function (or KDF) derives one or more secret keys from a secret value such as a master key or other known information such as a password or ...
170 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 ...
246 views

### How can I map arbitrary group elements to unique integers without using Hash functions?

Let's say, I have a group $G$ of large prime order $p$. A set $S$ consists of $n$ random elements chosen from $G$. Without using a collision resistant hash function $H$, how can I map elements of $G$ ...
188 views

### Is Encryption without knowing the input directly possible at all?

I know the question is rather unusual, but let me clarify what I'm searching for: There is one person, lets call her $Alice$. $Alice$ has $n$ plaintexts $t_1..t_n$ and $n$ public keys $pk_1..pk_n$ of ...
108 views

### How does SafeNet MobilePASS generate passwords? (TOTP Variant)

This question is similar to How does SafeNet MobilePASS generate passwords? The question and answer there is related to the HMAC Variant of SafeNet Mobilepass. I'm looking for details on the TOTP ...
134 views

### Is there any existing cipher capable of scaling from a 1 bit key up to a one-time-pad?

We have ciphers that handle small amounts of entropy, such as a 256 bit key for AES; and we have one time pads for enciphering 1:1 entropy, such as a 1GB key for a 1GB file if you could ever harvest ...
78 views

### Secure symmetric encryption algorithm for any-size base62 data

I am searching for a secure algorithm to encrypt base62 (or any other base) data for ids in urls. It should feature: No blocksize etc, limiting the length of the message to a factor of n If you ...
174 views

### Cryptosystems used to generate public key certificate

Where can we find the cryptosystems used to generate public key certificate? Are the cryptosystems under the signature algorithm and signature hash algorithm? Do I need to analyze the packets ...
161 views

### Encryption algorithm designed to be easy to decrypt by machine but impractical to decrypt by hand

I am looking for - or considering the design of a new - encryption algorithm that does not use variable keys, such that it is easy for a computer to encrypt and decrypt any message regardless of its ...
109 views

### Problem with implementing DES in python

i'm implementing DES in python and i've stumbled upon a problem i can't really find the problem, after debugging it i narrowed it down to this function, can anyone tell me if i'm implementing the DES ...
119 views

### Cracking plain RSA by factoring the modulus n

This is the setup: I have both public and private keys of one "instance" of RSA. And I have only the public key of another RSA cryptosystem, but this system has the same modulus as the first one. I ...
270 views

### How does hash function in Elgamal signature scheme prevent existential forgery attack?

I have heard that hashing the message M prevents an existential forgery attack. I was wondering how.
373 views

### Collision resistant hash functions

Let (Gen1,H1) and (Gen2,H2) be two hash functions. Define (Gen,H) so that Gen runs Gen1 and Gen2 to obtain keys s1 and s2, respectively. Then define Hs1,s2(x)=Hs1(x)||Hs2(x). a) Prove that if at ...
94 views

### Isn't Groth-Sahai proof system applicable beyond Bilinear groups?

Classical paper by Groth-Sahai on NIZK proof system is titled as "Efficient Non-interactive Proof Systems for Bilinear Groups". To my understanding, only (Pairing Product Equation) PPE are defined ...
159 views

### What does it mean that a protocol realizes “strong mutual authentication”?

What does it mean that a protocol realizes "strong mutual authentication"? And What does it mean that a protocol realizes "weak mutual authentication"? Can you define them formally ? I have found a ...
132 views

### Attacking both authenticity and secrecy in authenticated encryption modes

looks like NIST only approved GCM mode for authenticated encryption and other modes don't have any approval or a good implementation available. Is that possible a weakness in $GHASH$ compromise ...
241 views

### Factoring large numbers

I am trying to factor few integers that are each between 115 and 135 digits long. I was wondering if anyone knew of any efficient methods or any programs that I could use to find the two primes $p$ ...
72 views

### Would this be a plausible authenticated encryption scheme using nested encryption?

[This is was the most promising out of an incrementally developed set of (mostly flawed, to some degree) schemes I posted here, but I was told I should post each one separately] This scheme is highly ...
50 views

### Is the “Matryoshka Cipher” possible to write and implement?

Named after the Russian nesting dolls (a physical representation of the hidden data and the layers of encryption surrounding it) one example of the Matryoshka cipher would be the "Zvyozdochkin set" ...
74 views

### FEAL-4 Fk Function 4 Rounds

As I understood in FEAL-4 it needs 4 pair of round keys. Which means that we need to launch Fk function 4 times. My problem occurs starting the 2nd round. At the first round we have the original 64 ...
102 views

### simple encryption scheme turns out to be “somewhat homomorphic”

In the paper Fully Homomorphic Encryption over the Integers in the introduction: How do I calculate $r$ and $q$ of this equation in the picture? $r \approx 2^{\sqrt{\eta}}$ and \$q \approx ...
64 views

### How does the signature checking work in DKIM?

As far as I understand DKIM works like this: DKIM is not used to encrypt anything, the only purpose is to mark mails that are not really sent from the claimed domain as spam. the DKIM-enabled ...