0
votes
3answers
19 views

AES decryption vs encryption speed

Let's consider the CTR mode. For a faster encryption/decryption, is it preferable to use the decryption operation of AES, or its encryption ?
0
votes
1answer
12 views

Confusion regarding computing Multiplicative Inverse Modulo P?

May be a silly doubt, please rectify my confusion regarding below problem: For concreteness assume $g=2, p=11, a=6$ and $x=9$ $$A = g^a \bmod p = 2^6 \bmod 11 = 9$$ $$X = g^x \bmod p = 2^9 \bmod 11 ...
0
votes
0answers
18 views

Deriving message from signature (RSA)

Usually signatures are used for verification, and this requires that you pass both the message and the signature. I was wondering; if the message holds to a certain format (for example, valid json ...
1
vote
0answers
5 views

OpenSSL ECDH key exchang mechanism

I am using FIPS based OpenSSL module for encryption of sensitive data for my desktop socket server and client applications. I am using ECDH for key agreement.The keys public and private pair is ...
0
votes
0answers
11 views

Starting point on Fully Homomorphic Encryption and Proxy Re-encryption

I am new in this field. Can some one tell me where should I start for FHE and PRE reading ? Any papers where I can find Basic information on FHE and PRE ? Thank You in advance.
8
votes
4answers
911 views

Perfect zero knowledge for the Schnorr protocol?

Can somebody explain (or point to a reference) why the Schnorr protocol cannot be proved zero knowledge?
0
votes
0answers
11 views

Anonymous messaging using blind signatures

I want to implement a message relay server that knows nothing about who has sent a message but at the same time maintains a message quota per user. While searching for ways to do that on the internet ...
3
votes
1answer
79 views

Proving set membership in less than log(N) bandwidth

I have an unchanging set of unique items, and I want my server to show one of those items to a client, then cryptographically prove that the item is part of the set. How I do this currently: ...
0
votes
1answer
12 views

Assuring Client is Authorized to use JSON Web Token

JSON Web Tokens ( JWT ) are server-signed objects that the issuing server uses to identify a user, track session data and authorize requests. The fact that JWT are server-signed gives assurance that ...
7
votes
4answers
214 views

What is stopping someone from saving encrypted info, and decoding it later?

When I send encrypted data to a website, using public key encryption, what is stopping someone who is listening from storing my encrypted data, and decryption it in a few years after they have ...
7
votes
2answers
131 views
+100

Key Size for Symmetric Homomorphic Encryption Over the Integers

In the paper Fully Homomorphic Encryption over the Integers, it mentions a symmetric key scheme on page 1 and 2. Key Generation: Pick a random odd number $p \epsilon [2^{N-1},2^N)$ Encrypt A Bit m: ...
3
votes
1answer
29 views

Why Curve25519 for encryption but Ed25519 for signatures?

NaCl and libsodium libraries use Curve25519 for authenticated encryption (actually for sharing a key which is used for encryption) and Ed25519 for signatures. What is the purpose of using different ...
0
votes
0answers
7 views

How do I encrypt a PGP message through java's crypto extension? [migrated]

Currently I'm using bouncy castle's libraries for the actual work and have found an example at sloanseaman.com that (after a little tweaking) works with v1.52. I've also got a working example from ...
2
votes
1answer
80 views

Is there a secure source of entropy on a typical microcontroller?

On a device that does not have a hardware RNG, what is the best source for entropy? Some options and pitfalls floating around: Use the ADC to read something analog: can become deterministic if ...
1
vote
0answers
27 views

Attribute Based Encryption [duplicate]

Could someone explain the main differences between Key Policy Attribute Based Encryption (KP-ABE) and Ciphertext Policy Attribute Based Encryption using an example? I know that KP-ABE depends on the ...
4
votes
1answer
49 views

POODLE attack on TLS 1.2

The POODLE attack uses the way block ciphers in CBC mode are decrypted in combination with the packet's padding to determine some byte's value. From what I understand, even TLS 1.1 can be vulnerable ...
3
votes
0answers
43 views

What is the impact of a server not fully verifying the data in the Client Finished packet of a TLS connection?

F5 BIG-IP devices suffer from a vulnerability in which not all bytes of the Finished packet in a TLS connection are validated. The sort-of technical description can be found here. F5 don't consider it ...
3
votes
1answer
138 views

Using a hash (like SHA-256) vs AES as the source for pseudo-random values in Feistel network?

This question is in relation to Wikipedia article on Format Preserving Encryption It says the following It is also possible to make a FPE algorithm using a Feistel network. A Feistel network ...
0
votes
0answers
30 views

Test for randomness

Suppose I have a data set provided by PRNG in a matrix form with 400,000 rows and 20 columns. Each row consists 20 unique integer values from 1 to 80. I need to check the goodness of the PRNG. For ...
1
vote
0answers
21 views

Hash-values's length in identification schemes

I am trying to understand the impact of applying a hash function in an identification scheme. It makes reference to the publication "On the length of cryptographic hash-values used in identification ...
1
vote
1answer
91 views

The encryption scheme is secure?

I have a scheme and I don't know that this scheme is semantic security or not. Secret keys $\{s_1,s_2, x_1,x_2\}$ and public parameter $p$ (large prime number). Encryption E(m): $C_1 = s_1m + x_1k ...
8
votes
1answer
52 views

Edwards / Montgomery ECC with Weierstrass Implementation?

So let's assume I want to perform Ed448 or Ed25519 digital signatures or want to perform a DH key-exchange. Assume further that those curves (Curve448 or Curve25519) are required. But the problem is, ...
2
votes
0answers
22 views

DSSP reduction to DSSI

In “Towards quantum-resistant cryptosystems from supersingular elliptic curve isogenies" by DeFeo, Jao and Plut, a reduction from the Decisional Supersingular Product (DSSP) problem to Decisional ...
4
votes
1answer
249 views

PBKDF2-SHA512 - Does a Big Salt Decrease Security?

I use PBKDF2-SHA512 with an iteration count of 128,000 to hash my passwords. I use a CSPRNG to generate a salt per password. However, I am unsure about the ideal size of the salt. I have read a lot of ...
2
votes
1answer
140 views

Straightforward method for hampering frequency analysis on deterministic encryption

I'm brainstorming some different ways of making deterministic encryption more secure. I want to use deterministic encryption to preserve searchability over the keywords in a document set. However, I ...
2
votes
1answer
111 views

Is a strong block cipher usable as a strong sponge function?

From the literature, it looks like the security proofs of sponge functions depend on how well they approximate a random permutation, Since a block cipher also ideally behaves like a random permutation ...
3
votes
2answers
92 views

What practical uses can random hash collisions be put to?

Using magic, I've built a machine that instantly generates hash collisions. To try it out, I set the dial to SHA256 and typed in "e7cf3ef4f17c3999a94f2c6f612e8a888e5b1026878e4e19398b23bd38ec221a". I ...
4
votes
2answers
86 views

Randomness in Public Key Encryption

For a scheme to be at least CPA secure, one has to randomize the scheme. In case of a secret key encryption scheme, the used randomness will typically become part of the cipher text as in the case of ...
0
votes
0answers
37 views

Whar are the differences between curve NIST P-521 and Edwards E-521 for signature?

I implemented and used the P-521 curve for ECDSA. Signatures are 132 bytes long. It seems that Edwards E-521 is safer but I did not investigated very deeper. What is its signature length ? How is it ...
1
vote
1answer
50 views

Can a tree hash with leaf-size of 1 byte support verification of content with elided ranges, at a cost of at most 2 supplied internal-node hashes?

Perhaps someone can confirm my intuition: A tree hash with leaves of size 1 (for example Blake2 in a tree-hash mode) would of course not be very efficient. But it seems that it might be a suitable ...
10
votes
1answer
42 views

What are the roles of the simulator in simulation based proofs

I'm trying to better understand simulation based proofs in the UC model - but the guidelines to construct a simulator confuse me. To my understanding, the simulator is activated in two ways: ...
1
vote
0answers
10 views

End-to-End (Point-to-Point?) Email encryption [migrated]

I'm looking into providing security for the email server I recently deployed, however the subject matter is a touch more complex than I anticipated and I would appreciate confirmation or correction of ...
0
votes
0answers
10 views

How do I create a PKCS#7 or CMS enveloped signature in python? [on hold]

There doesn't appear to be PKCS#7 or CMS support in pyCrypto. Ideally, there will be a call that will create return an enveloped signature given a signer certificate, an RSA private key and a payload ...
2
votes
2answers
129 views

Is it okay to include relative time for true random number generation?

Similar questions have been asked regarding use of time in true random number generation, but I'd like to consider using time as just one source of entropy, complementing others. True random number ...
1
vote
2answers
104 views

What are the required security properties for salts?

I was recently thinking about password hashing (maybe caused by the PHC progression). I started to think a little more about it and got stuck at this question: What security properties do ...
1
vote
1answer
60 views

Inverse public-key encryption

I'm in the need of an inverse public-key encryption method where you encrypt with the private key and decrypt with the public key. In other words an asymetric encryption where you can't generate the ...
4
votes
2answers
104 views

How to hash similar strings to the same hash value?

Suppose that $s_1$ and $s_2$ are two stings that have a small hamming distance. Is there a preimage resistant "hash" function ($H$) that can map them to the same value i.e., $H(s_1) = H(s_2)$?
3
votes
2answers
928 views

Generate RSA-2048 private key for a VERY fast decryption (don't care if it will be unsecure)

Given public standard RSA exponent e = 65537, is there any (d, n) pairs so that RSA decryption becomes a trivial operation? The modulus n must be no less than 2048-bit. The goal is to get a real ...
7
votes
3answers
153 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 ...
5
votes
0answers
81 views

Using same modulus for RSA

I know that there exist some attack when using same modulus. Can two different pairs of RSA key have the same modulus? RSA cracking: The same message is sent to two different people problem But ...
1
vote
0answers
24 views

Open source code about the basic Quisquater-Piret DFA of AES-128 [on hold]

Where can i find open source code about the basic Quisquater-Piret DFA of AES-128? Are there any websites sharing the code about such physical attacks?
4
votes
3answers
411 views

Block cipher fixed points (plaintext equal to ciphertext)

A block cipher is a bijective map from the set of possible plaintexts to the set of ciphertexts, which are the same size and might as well be considered the same thing: $\theta: S\to S$. In this there ...
0
votes
0answers
35 views

Can a block cipher encrypt the message to itself (plaintext equal to ciphertext) [duplicate]

The result of the cipher should be indistinguishable from random, but can it happen that cipher produces the ciphertext that is equal to the plaintext as it also lies in the corresponding space? I ...
6
votes
3answers
781 views

CBC - a canonical mode, even though there are streaming modes

Why is CBC considered the canonical mode when there are streaming modes available such as CFB and OFB? One thing that I can think of is that in CBC you can easliy do range-based decryption. All you ...
5
votes
1answer
59 views

Where is CFB-MAC defined?

I can find a couple of descriptions of using CFB mode to create a MAC, but cannot find any standard or papers analyzing its security bounds. Is there a standard for CFB-MAC? Where can I find an ...
3
votes
2answers
40 views

Chosen plain text and chosen ciphertext definitions clarification

I am trying to understand a concept of CPA and CCA attack and I cannot get one thing from the definition. If an attacker can execute a CPA attack for something like Send 100 dollars to attacker that ...
2
votes
1answer
71 views

Is there really any way to nullify or avoid MITM attacks?

The question pretty much sums it up. Is there any way to make an attacker who is successfully performing an MITM attack to actually not be able to read or change the messages? Assuming there is no ...
0
votes
0answers
27 views

In HMAC-MD5 Implementation, why “i_key_pad” and “o_key_pad” if They Are Public and Constant? [duplicate]

Please Consider: English is My Second Language This Wikipedia article on HMACs shows a part of a HMAC-MD5 implementation making use of i_key_pad and ...
1
vote
1answer
40 views

Authenticating with a document

Hope you're having a nice day. I need to implement an authentication system between a "document" (it's not exactly a document, but an object without any computing capacity, only able to store ...
2
votes
0answers
76 views

How to break this PRNG encryption scheme? [on hold]

Suppose we have the following symmetric algorithm: key = random bits G = PRNG(seed: key) input = [0,1,1,0,1,0,0,0, 0,1,1,0,1,0,0,1] // "hi" in ascii The key can ...

15 30 50 per page