1
vote
1answer
167 views

FIPS-Compliant SHA2

I want to use SHA-512 for hashing in a system that must be FIPS-compliant. When I look at the FIPS 140 list of approved providers, I don't see SHA from any provider as being an approved algorithm, I ...
0
votes
0answers
181 views

Deriving a decryption equation

Consider a very simple symmetric block encryption algorithm, in which 32-bits blocks of plaintext are encrypted using a 64-bit key. Encryption is defined as C = (P⊕KL)⊗KR where C = ciphertext; K = ...
7
votes
3answers
526 views

Testing the Fortuna random number generator?

I have implemented the Fortuna random number generator as described in chapter 10 of "Practical Cryptography" (Ferguson and Schneier, Wiley, 2003), the result can be found at http://www.seehuhn.de/...
0
votes
1answer
129 views

Prime modulus for RSA and sharing a secret?

According to this paper entitled "Using Commutative Encryption to Share a Secret" they define their modulus to be a large prime p, which is public. Both exponents are private in this case. According ...
1
vote
1answer
202 views

Misunderstanding Broadcast Encryption

I have a secret message which I want to encrypt such that any of several different keys can open it independently. The keys can't know about each other and it has to be able to work completely ...
0
votes
0answers
62 views

Key establishment protocols other than Diffie-Hellman

Are there any key agreement/exchange/establishment protocols which are NOT based around the Diffie-Hellman protocol or handshakes using public key cryptograaphy? DH seems to form the basis of this ...
2
votes
1answer
208 views

Hash function as secure as one-time pad?

We know that the one-time pad is provably secure as a cipher to encrypt some data. Is there an algorithm which does the same just as a hash function? Can we get a provably secure hash function? Maybe ...
1
vote
1answer
128 views

Identity-Based Encryption consist of four algorithms. Extract phase is one of them and it is done by PKG or receiver?

The Identity-Based Encryption consist of four randomized algorithms: Setup, Extract, Encrypt, Decryption. The Setup phase is done by Private-key generator, Encrypt by sender and Decryption by receiver....
1
vote
1answer
701 views

Storing AES encrypted RSA private keys on a server

I'm thinking about creating an encrypted messaging web application where users create RSA key pairs, they store the public key on the server for others to see and also store an AES encrypted private ...
1
vote
1answer
126 views

Finding $x$'s parity in the discrete log problem

Suppose $p$ is prime, and $g, a\in\mathbb F_p$ are given elements with $g$ a primitive root. The discrete log problem poses the task of finding an integer $x$ such that $g^x=a$. Show that even if $x$ ...
0
votes
1answer
67 views

Are passwords generated from sine vulnerable to certain attacks?

A friend mentioned that he used the sine of a number, i.e. sind(54), to generate long passwords. This way he only has to remember sine 54 and have a calculator to get his password back. I am wondering ...
0
votes
1answer
135 views

OpenSSL encrypted text length

OpenSSL block ciphers return length of the text as output of the encryption (envelope_seal()), and If I have to send the length over network, I append the length ...
0
votes
3answers
287 views

Simple multiplication as an encryption method

There was a time when I wondered about multiplication as an encryption operation. That was when I was thinking in terms of modular multiplication. But how about based around simple multiplication. ...
1
vote
1answer
380 views

Additional Data in AEAD (Chacha20-poly1305 libsodium)

I have recently been playing with Chacha20-Poly1305 with libsodium, and all of the examples state the additional data portion of the tag is stored in plaintext when encrypted. But from what I can tell ...
1
vote
1answer
107 views

Why is knowing M not enough to break Blum Blum Shub?

In Blum Blum Shub, the generator is $x_{n+1}={x_n}^2 \mod M$ where $M=p \cdot q$, $p \in \mathbb P$, and $q \in \mathbb P$. Supposedly, knowing $p$ and $q$ is enough to break the system. But if I know ...
1
vote
0answers
70 views

Boneh-Boyen like signature scheme

Full Boneh-Boyen signature scheme defines a pair of secret keys (SK) $a \in \mathbb{Z}_n$ and $b \in \mathbb{Z}_n$ and a pair of public keys (PK) $A = G^a \in \mathbb{G}$ and $B = G^b \in \mathbb{G}$. ...
4
votes
1answer
241 views

How hard is it to find plaintexts whose hashes satisfy $h(a)\oplus h(b)=h(c)$?

Given a cryptographic hash function $h$, for example SHA256, how hard is it to find plaintexts $a,b,c$ such that $$h(a)\oplus h(b)=h(c) \text?$$
2
votes
2answers
219 views

Is there any advantage on encrypting the CMAC together with the message?

I'm reading a protocol specification where the procedure is to generate a CMAC, take the first 4 bytes of it, append this authentication tag to the message and then encrypt the message + CMAC together ...
2
votes
1answer
170 views

Noisiest RF band for random number generation

I've been looking into the difference between PRNGs and proper RNG techniques. One that I particularly like is the idea of tuning a radio to a certain frequency and bandwidth and just listening to the ...
0
votes
2answers
418 views

Client-Server application how can data be encrypted so only clients can read it

Requirements We are building a system that connects multiple clients through a restful API. It allows the creation of groups of trusted clients. We need a way to store group shared data encrypted ...
3
votes
2answers
234 views

In ECC, how do I prove that point addition is commutative?

I am studying elliptic curve cryptography and this question is related to the commutative property of point addition operation. Point addition $P_3(x_3,y_3)$ of two points $P_1(x_1, y_1)$ and $P_2(...
6
votes
1answer
891 views

Does using modulo (%) affect quality of randomness?

I'm writing a small script that generates random non-signed decimal integers within a certain range of values. I'm using GNU od, with the following command: ...
0
votes
1answer
79 views

Stream cipher key length to send

I was being argued that stream cipher's key that is the length of the message must be sent to the destination for them to be able to decrypt the message. My point is don't you only have to send the ...
1
vote
1answer
85 views

Can you exchange a shared key without any hardness assumptions?

Imagine that P=NP, and one way functions don't exist. Can two people end up with a random shared key of arbitrary length, if every exchange is public? They have true RNGs, and know who they are ...
1
vote
1answer
126 views

Size of a MAC for a quickly checked message?

Let suppose that we have to check a message that was written one second ago. The message is discarded immediately after having being checked. What "minimal" size for such a MAC is secure ? Thank you.
1
vote
0answers
92 views

Existence of encryption schemes where $F_{k}^{-1} \big( F_{k}(A) + R \big) = A + O(R)$

Is there a encryption scheme in literature, where I can do something like $$F_{k_1}^{-1} \big( F_{k_2}(A) + R \big) = A + O(R)$$ where, $A$ is a $m \times n$ real matrix, $R$ is a $m \times n$ real ...
-1
votes
1answer
159 views

Generating cyclic group for Ciphertext-Policy Attribute-Based Encryption [closed]

I am doing Project under the topic CP-ABE.I need to generate a symmetric bilinear group Go of prime order p and with generator g...Then how to choose random elements from Zp....kindly anyone help me......
0
votes
2answers
113 views

Counter Mode with a sequence of zeros bits plaintext, is it secure?

I had a quiz last week in computer security course. There was a confusing question that I am still looking for a good and clear answer. First, I know that counter mode with a good block cipher is ...
2
votes
1answer
67 views

What does K stand for in frequency analysis

It was from frequency analysis lecture and the professor mentioned but I cannot recall. The K value for English was .067, German was .076. The lowest K was Russian which was .056. When the frequency ...
0
votes
2answers
336 views

How fast would a polynomial time factoring algorithm compute?

I know factoring is the chief means of breaking RSA keys. I know an algorithm that runs in polynomial time would be able to break an RSA key pair "quickly". But how quickly is "quickly"? Note, I'm not ...
0
votes
1answer
72 views

Weak Boneh-Boyen Signature in Composite order group

In the paper Ring Signatures of Sub-linear Size Without Random Oracles, authors have remarked that the scheme is instantiable in composite order setting, too. I am attaching the following reference ...
1
vote
1answer
368 views

Encrypting with Davies-Meyer hash function scheme

So I need to to illustrate Davies-Meyer hash function for a message “123” with 1-byte blocks. I can use the extended ASCII representation where each character is represented as a byte. And I can pick ...
1
vote
2answers
51 views

Automatic generation of secure passwords with the least inconvenience for a user

I'm working on a web site for a private company that should allow them to upload files, which will be later retrieved by their affiliates. The site will be available from a public Internet using ...
2
votes
1answer
555 views

SHA1 Partial Collision

I'm working on a little python script that reads in two fairly similar English sentences (they're in text files - reading them in) and I'm trying to force a SHA1 partial collision (e.g. first 32 bits ...
1
vote
1answer
366 views

CPA security of a stateless and deterministic encryption system

Why can no stateless and deterministic encryption system be IND-CPA secure? Is there a formal proof for it?
0
votes
1answer
50 views

Using Permutation polynomial to compute a MAC

Is the following MAC secure? For a block $y_i$ in a file, we defined a MAC as follows: $Mac_i:PRF(k,i) \cdot g^{y_i \cdot r_i} \bmod p$. Where $p$ is a prime number, $g \in \mathbb{G}$,$PRF(k,i)$ is ...
0
votes
2answers
114 views

RSA generation of private key using public key

In RSA private key generation e*d ≡ 1 mod φ e is public, also n is public. How to prove mathematically, generation of ...
1
vote
1answer
205 views

PRF based on the GGM construction

What's the differences between the concepts “pseudorandom generator” and “pseudorandom number generator”? In fact, I want to implement a pseudorandom function based on GGM's construction at http://...
1
vote
1answer
194 views

Noise bound in FHE over the integers

I'm studying the paper Fully Homomorphic Encryption over the Integers by Marten van Dijk, Craig Gentry, Shai Halevi and Vinod Vaikuntanathan. I have questions about the proof of Lemma A.1. In page 6,...
0
votes
0answers
258 views

Python implementation of a blind signature scheme which doesn't involve RSA

RSA seems a bit creepy after the Snowden revelations and i'm looking for a simple python based blind signature library to fiddle around with. So far i've been unable to find anything. What am i ...
8
votes
2answers
1k views

Can RSA encryption produce collisions?

In RSA, a message is encrypted by $m^e \pmod N$. $N$ is the modulus, $m$ is the message and $e$ is the public exponent. (I know that $m$ should not be greater than $N$.) My question is, can $m^e$ be ...
1
vote
1answer
945 views

What is the difference between a hash function and a pseudorandom function? [duplicate]

Read the title. I've seen in RFCs that some MAC functions are called "pseudorandom functions". What are those? How are they different than hash functions? Why can't a hash function be used instead?
0
votes
1answer
524 views

Why does the DES crypto algorithm NOT use 2 rounds?

Now, if we were to go round by round, you could give a distinct reason for not using a single round since after just one round, the right half of the text comes directly, as-is, to form the left half ...
21
votes
3answers
5k views

For Diffie-Hellman, must g be a generator?

Due to a number of recently asked questions about Diffie-Hellman, I was thinking this morning: must $g$ in Diffie-Hellman be a generator? Recall the mathematics of Diffie-Hellman: Given public ...
1
vote
0answers
58 views

Decrypt a message which is encrypted using XOR? [duplicate]

This is a puzzle asked in a contest. Given that encryption , decryption happens as per following rule/code: ...
1
vote
1answer
128 views

Definition of ciphertext security

If I got it right, chosen ciphertext security implies also CPA security. In other words, attacker can submit plaintexts to the challenger (along with ciphertexts). I do not understand why ...
0
votes
1answer
110 views

Negative exponents in Shoup's threshold RSA?

I'm trying to implement threshold RSA operations, starting with decryption based on Peeters, R., Nikova, S., & Preneel, B. (2008). Practical RSA Threshold Decryption for Things That Think. ...
0
votes
1answer
123 views

Proof that $gcd(e, \lambda(N)) = 1 \hspace{1mm} \Longleftrightarrow \hspace{1mm} gcd(e, \varphi(N)) = 1$

What is the proof for the fact that $gcd(e, \lambda(N)) = 1 \hspace{1mm} \Longleftrightarrow \hspace{1mm} gcd(e, \varphi(N)) = 1$ Where: $N = P * Q$ where $P$ and $Q$ are both primes. $\varphi(N)$ ...
2
votes
1answer
88 views

Post processing of AAD and len A||C in a hardware AES GCM implementation

I'm new to GCM and I need to implement it in hardware, using FPGA. The data bus is 640 bits, so I will use 5 adder/multiplier blocks in parallel. The message size and AAD size are constant. My design ...
0
votes
1answer
71 views

Non-repudiation and digital signature of a dishonest participant

Let's assume a dishonest Alice who sends, encrypts & digital signs a message to Bob. Bob stores the decrypted message and the digital signature in a database. However Alice is a bad girl and ...

15 30 50 per page