0
votes
0answers
42 views

Would a pictographic, phoneme-based, hand cipher be difficult to crack with computer crypt-analysis?

What I'm talking about is a hand cipher which uses phonemes instead of individual characters and pictograms instead of the usual shuffling/substitution methods (e.g Caesar, Solitare, Vignere). The ...
1
vote
2answers
99 views

What do these notations mean in the definition of Perfect Secrecy, if we read those in English?

If m: message, M: message space, k: key, K: keyspace, c: cipher, C: cipher space and $E_k$: encryption function, such that $E_k(m) = c,\ m,m^* \in M,\ k\in K,\ c\in C.$ Then, what do the following ...
0
votes
1answer
68 views

Is $f\colon x\mapsto g(x+1)$ necessarily a pseudorandom function?

Let $l\in\mathbb N$ and suppose $$g\colon\;\{0,1\}^l\to\{0,1\}^l$$ is a pseudorandom function. Is $f$, defined as below, necessarily a pseudorandom function as well? $$f(x)=g((x+1)\bmod2^l)$$
2
votes
1answer
129 views

Generate hash value using public key along with message

I was trying to understand one way signature chaining on message by Saxena and Soh. As the message is passed from one user to other, every user can combine their signature to create one single ...
1
vote
0answers
42 views

Using a Secure RNG in Probabilistic Fair Exchange

I am attempting to implement probabilistic fair exchange described in Probabilistic Non-Repudiation without Trusted Third Party. A secures a message using AES with 512 bit keys (in my ...
1
vote
1answer
165 views

(Simple) Tool for analysing performance (speed in particular) of cryptographic hash function?

I am doing some research for which I intend to insert some (external) function in different cryptographic hash functions and I would like to analyse how the insertion of this extra code in the hash ...
-3
votes
3answers
141 views

OTP - Reuse key BUT add IV, is it secure enough?

I have already asked a similar question and now I can continue to this question about adding a "extra key" = IV. My last question was about reusing key in OTP (One-Time-Pad). Now this question is ...
-4
votes
1answer
186 views

OTP - Why not reuse key? EDITED! [duplicate]

EDIT: REUSING KEY IS SECURE! OTP - Reusing key IS SECURE! PROVED! This might sound really dumb but why is it bad/insecure too use the same key twice on One-time-pad? Question: Why and how does using ...
0
votes
1answer
118 views

What is the proper way to generate a fixed length key from a variable length password?

The password is entered by the user and the key is processed locally. Neither the password nor the key will be stored, only used and forgotten (but hopefully not by the user). Is SHA256 by itself ...
0
votes
1answer
86 views

How much of Probability do I need to know to study Cryptography?

I have just started MSc in Computer Security. I didn't study probability before. Now, I have some short time to complete my MSc semester. What are the minimum topics from 'Probability' do I need to ...
0
votes
1answer
78 views

How to encrypt a vector $e\in Z^{m}$ using LWE

I have a vector $e \in Z^{m}$, now I want to encrypt it by using LWE (Learning With Errors). Because in LWE, we have to encrypt of a bit $\{0,1\}$. How can I encrypt a vector $e \in Z^{m}$? Thank you ...
0
votes
1answer
93 views

Randomness in generation of Virtual Machines from pre-built Image [closed]

I am studying Multi-Tenancy vs. Virtualization, and I got thinking about randomness, true randomness, virtualization etc, and I couldn't find anything on it. From what I gather, ...
2
votes
1answer
444 views

How multiplicative property of RSA can be exploited

It is known that RSA has the multiplicative property $E(m_1) \cdot E(m_2) = E(m_1 \cdot m_2)$ because $m_1^e \cdot m_2^e = (m_1 \cdot m_2)^e \pmod n$ But how can this property be used to break ...
2
votes
1answer
81 views

Algebraic cryptanalysis on public-key schemes

The book Algebraic Cryptanalysis (Bard, G.V.; Springer, 2009) speaks about transforming a symmetric scheme into a system of polynomial equations and solving these equations to break the scheme. But ...
5
votes
2answers
1k views

Why is this the inverse of a Enigma Machine rotor?

I am learning about how the Enigma Machine works and I found this example of one letter being encrypted by an Enigma Machine. It shows the letter "G" going through three rotors and then it goes into ...
3
votes
1answer
124 views

Is it possible to combine true streaming with AEAD?

It seems there is a difference between "streaming" in cryptographic sense (as in CTR) and "streaming" in general programming sense (as in "accept a file larger than RAM from socket and save it on ...
1
vote
1answer
245 views

KDFs for symmetric encryption master key & serial number

Let's assume that I generate a high entropy AES master key (through /dev/random for example) and I want to derive it with a fixed-length serial number (12345 for instance). The derived key is used to ...
2
votes
1answer
116 views

Encrypt entire payload or only confidential parts of payload?

In cases where a large complex data structure contains elements that are a mix of confidential and not-so-confidential data, what would be the pros & cons of: encrypting the entire structure ...
1
vote
1answer
116 views

algebraic attacks for mixed operations (mod 2 and mod 256) [closed]

If a cipher has mixed operations, e.g $\oplus$ (addition mod $2$), and addition modulo $2^8$. How we we going to express them mathematically? Thanks in advance!
1
vote
1answer
194 views

Cipher text only attacks on deterministic fully homomorphic encryption schemes

If we have encryptions of additive and multiplicative identities in the corpus of cipher text of a deterministic fully homomorphic encryption (FHE) scheme, I guess we can break it. If the FHE scheme ...
2
votes
0answers
203 views

BER or DER X9.62 ECDSA signature

The signature format for ECDSA signatures can be encoded using ASN.1 integers according to X9.62 or it can comprise of two integers with the same size as the key size. In case the X9.62 format is ...
1
vote
1answer
342 views

Creating a random password based off of a prime number

So I am making an application that basically creates strings that must be encrypted before they are stored on a user's device. If the user blindly starts running the application without creating a ...
0
votes
1answer
816 views

What do I use as the encryption key and initialization vector in AES cfb128

I'm writing a program that can encrypt a file using AES cfb128 (using Openssl and C++). The scenario of the program is this: Person A visits computer, encrypts a file they make, takes away a key ...
1
vote
1answer
331 views

Creating unique keys with md5

The project I'm working on requires me to find a way to create a unique key based on data stored in a table. The table in question consists of x columns and y rows. In order to create the key I want ...
0
votes
0answers
62 views

Are there any noisy homomorphic encryption schemes?

Are there any Homomorphic Encryption(HE) schemes that result in noisy answers ? By noisy i mean , the answers could be approximately near the actual answers by noise factor $\epsilon$. For example , ...
1
vote
1answer
122 views

How does the certificate authority generate a signature F?

E=encrypt(K,M) - is message M encrypted with key K gives encrypted text E M=decrypt(K,E) - is encrypted text E decrypted with key K gives message M KCA−pub,KCA−priv - is the private-public key pair ...
0
votes
1answer
80 views

Altering the message space of Paillier

Is there any obstacle if we restrict in Paillier the plaintext values to be drawn from $\mathbb{Z}_N^*$ instead of $\mathbb{Z}_N$ as the original scheme indicates.
1
vote
1answer
124 views

Why is a Feistel network not a type of substitution-permutation network?

I understand what substitution-permutation networks look like. I understand what Feistel networks and Feistel-like networks look like. A Feistel network or a Feistel-like network features substitution ...
2
votes
1answer
124 views

difference between soundness in ZKPoK and special soundness for sigma proofs

What is the difference between soundness in ZKPoK and special soundness for sigma proofs?
1
vote
3answers
146 views

Salsa20-GCM composition secure?

AES-GCM seems to be used by everyone but I never seen even one post about Salsa20-GCM. Is it secure? Wikipedia mentions that GCM ...
5
votes
3answers
178 views

Fault-based transition for crypto proof (a la Shoup) with big probability of fault - does it work?

background In [Shoup2004], Victor Shoup synthesizes the 'sequence of games' technique for proving security properties: Roughly it consists in a sequence from game_0 to game_n, game_0 consisting in ...
2
votes
2answers
230 views

Zero knowledge-proof for discrete log that is not honest-verifier

Take a cyclic group of prime order. The Schnorr-protocol for proving knowledge of the discrete logarithm of some group element is honest-verifier zero-knowledge, meaning that if the verifier chooses ...
2
votes
1answer
220 views

New to cryptology, studying Message Authentication Codes

I understand the basic operational theory behind MAC, but I'm getting tripped up on some of the finer details. Also the differences between MAC, HMAC and MIC are getting lost on me, including the ...
1
vote
1answer
97 views

Common reference string in NIZK

I want to ask that does the common reference string in NIZK have to be random? Or can it be anything?
0
votes
1answer
80 views

AES inversion operation in sub byes

I was wondering why in the AES sub-bytes operation one can represent the inversion as computing $x^{254}$. What is the reason for this? Moreoever, I was wondering what the text on page 212 of ...
2
votes
1answer
169 views

What use is the signature without the message under RSA?

Using RSA for signing & verification, is there a way to take a valid signature for an unknown message, and for someone else to generate a valid signature using a different key against the valid ...
0
votes
1answer
297 views

Affine transformation in AES: Matrix representation

I know that the affine transformation of the AES can be represented both as a polynomial evaluation over $\operatorname{GF}(2^8)$ and as a matrix-vector multiplication (see, e.g., p.212 C.4 of The ...
2
votes
2answers
535 views

Toy public/private key example open to frequency analysis?

I've been looking at an online Public Key Encryption Example (summarized below). It seems to me that choosing cyphertext = plaintext^(key) mod n would produce the ...
-1
votes
1answer
959 views

Decrypted RSA 64 bit encryption using modulus and private exponent. Got gobbledygook [Verify] [closed]

As part of an experiment, I was given a .enc RSA (encrypted) file that was most likely generated using openssl. I had the public key, I factored it, obtained the private exponent, and decrypted the ...
2
votes
1answer
175 views

Hash functions to the power of two and three notation

I have found in a Wireless Sensor Networks security paper, operations where cryptographic hash functions are elevated to the power of 2 and to the power of 3 (i.e. $h^2(x)$ and $h^3(x)$). This might ...
2
votes
0answers
112 views

Pseudorandom Function Proof

Given a set of pseudorandom functions $F=\{f_s^i\}_i$ for each $s\leftarrow\{0,1\}^n$ generated at random; moreover each $f_s^i$ uses a specific PRG $G^i:\{0,1\}^n\to\{0,1\}^{2n}$, where: ...
0
votes
1answer
102 views

anonymous signature implementation and usage?

This is one of the question asked in my class. Implement a anonymous digital signature. So it means hiding signers information. i could not find any article in anonymous digital signing. Also another ...
0
votes
1answer
4k views

How to decrypt a '.enc' file that has been encrypted with RSA using a public key? [closed]

While solving a CTF challenge online, I came across a situation where I needed to decrypt a '.enc' file that has been encrypted using someone's public key. The ...
0
votes
1answer
371 views

What is the difference between chosen-plaintext attack and adaptive-chosen-plaintext attack?

I've just dived in cryptography and would like to learn basics of this science. Currently I can't understand the difference between these two types of attacks. As I understood from Bruce Schneier's ...
0
votes
1answer
65 views

DSA: Authentication and assurance of authorized parties

When dealing with Asymmetric cryptographic algorithms, usually the sender of the critical data asks the listener for a Public Key for encrypting the data and sending them. This is while the private ...
0
votes
1answer
38 views

Identification by RSA

Suppose we have identification scheme as such: Bob takes random $r$, and encrypts it with Alices public RSA key $(n,e)$, sends $r^e$ to Alice. Alice decrypts $r$ and sends it back to Bob, becomes ...
0
votes
2answers
147 views

Removing “security by obscurity” from port knocking

Every article about port knocking, for instance https://wiki.archlinux.org/index.php/Port_Knocking , declares this method as security by obscurity. Is the following enough to remove that title; a ...
1
vote
1answer
119 views

Replay Attack in Stream Cipher

Stream ciphers are vulnerable to replay attack if the same key k is used. If E() is a stream cipher and an attacker intercepts the message m that's being transmitted at time t, how can the attacker ...
3
votes
1answer
577 views

What is the purpose of pre master secret in SSL/TLS?

I studied about SSL/TLS and learned that client and server must share keys below. common key for encryption common key for generating message authentication code Then, in SSL/TLS, a client doesn't ...
1
vote
1answer
91 views

Will ANY prior knowledge assist in determining contents of a SHA1 hash?

I am working on a project testing a hash that protects some data, and I've already eliminated hash length extension attacks as a possible point of compromise, and I'm trying to educate myself on all ...

15 30 50 per page