0
votes
1answer
14 views

How to find the time complexity of modular multiplication?

There are two number of length m bits. How do I prove that the complexity of modular multiplication of these two numbers is $O(m^2)$.
3
votes
1answer
25 views

What is the private key in RSA?

I'm new to cryptography and I have a doubt: I read some pages a bit different definition for the RSA private key: In 1 - (n, d) In 2 - ...
-2
votes
0answers
15 views

improve of cryptography algorithm [on hold]

This is my algorithm.. ...
0
votes
0answers
14 views

How do attacks on WEP work?

There is an abundance of tools and tutorials on how to break WEP encryption. However, I fail to find a nice resource that gives a clear break-down of why the attacks are possible. For example, I know ...
1
vote
1answer
21 views

Boolean functions in cryptography

I recently started becoming interested in Boolean functions. Because they are defined as $f: \{0, 1\}^n \rightarrow \{0, 1\}$, or in other words only over $\{0, 1\}$, I guessed they can somehow be ...
0
votes
0answers
11 views

Securing Digital cash with Encryption [on hold]

In digital cash we use bit commitment to secure the id. can we do this with encryption instead of bit commitment. Will it be secure then?
0
votes
0answers
21 views

Bit stream reverse engineering

Given a continuous stream of bits that might be encrypted or unencrypted, what are the common steps in approaching the analysis of such a stream, assuming it holds significant data in an arbitrary ...
0
votes
1answer
24 views

Symmetric cipher speed (AES vs Camellia vs Twofish)

If I have understand correct, Twofish is more secure (harder to break) than AES and Camellia, but Twofish is slower than AES and Camellia. But how can I mesure the speed difference between AES vs ...
8
votes
2answers
352 views

RSA encryption using multiplication

Generally in RSA we encrypt as $m^e \pmod n$. Will RSA work if we replace the power by normal multiplication? $E = (m \times e) \mod n$ and decryption as $c \times d \mod n$. What will be $d$ ...
0
votes
0answers
14 views

Currently Best Integer not bit FHE

HElib encrypts and evaluates on bits. Are there any FHE that evaluates on encrypted integers? If there are more than one, which one to choose?
1
vote
1answer
26 views

Can we do modulus switching for number theoretic encryption?

Can we do modulus switching for number theoretic encryption such as Paillier or ElGamal?
0
votes
0answers
43 views

Why are hash functions like SpookyHash and MurmurHash so highly collision resistant?

Why are hash functions like SpookyHash and MurmurHash so highly collision resistant? I tried to test these hash functions using a few billion input messages and I found that there is no hash value ...
1
vote
1answer
75 views

To what extent is WhatsApp's claim to not be able to read to messages realistic

As those of you who use WhatsApp messanger probably know, with their recent update now the chats and calls are encrypted. Here's What WhatsApp claims: Messages you send to this chat and calls are ...
1
vote
1answer
41 views

What would happen to AES if we replaced Mix Columns with Shift Columns?

I have this as a question in an assignment and I guess I don't fully understand the steps. I understand that if we omit Mix Columns , then every byte of the ciphertext would not depend on every byte ...
-1
votes
1answer
28 views

Modelling crypto protocols using Formal methods

How to start working with SPIN/Promela for modelling cryptographic protocols using formal method such as LTL?
1
vote
1answer
38 views

How is decryption done in AES CTR mode?

Since AES CTR mode uses a unique IV and counter to produce the key to XOR with the plain text to get the ciphertext, the question is so as to how decryption is done. Since AES CTR produces a ...
2
votes
1answer
49 views

Is the use of a 4-round Blake2b permutation in OPP justified?

The MEM-AEAD construction uses a 4-round Blake2b permutation in masked Even-Mansour mode as a (tweakable) block cipher. 4 rounds of the Blake2b permutation are already broken to my knowledge. Why ...
0
votes
1answer
64 views

Is this cascading encryption, and is my security weakened as a result?

I'm trying to understand what is, and what is not, considered cascading encryption. All of the posts and conversations I've read over the past few days discourage the practice, including this article. ...
0
votes
0answers
10 views

Are there any free to use video and audio chat programs that offer end-to-end encryption that do not let the service know of the content? [migrated]

Skype is compromised, FaceTime is compromised, and I believe Ovoo is compromised. Does anyone know of any genuinely free (not free-to-try or in-app purchase-type applications) that offer end-to-end ...
1
vote
1answer
41 views

How secure is the OTR protocol?

I am using Adium and wondering how secure it is. I believe it uses AES-256 (I do not understand what that means) by default. It also requests that users exchange fingerprints with each other before ...
0
votes
1answer
30 views

How robust is my coded output?

I create codes and ciphers and as a hobby and I was wondering if there was any outfit that would 'test' your output to see how resilient it is. Is there a group anywhere that will accept code, try to ...
3
votes
1answer
59 views

Backdoor in NIST elliptic curves

Let $E$ be an elliptic curve defined over a finite field $F_q$ with prime order $n$ and $P,Q \in E$ and $k$ be private key such that $kP=Q$. Since $n$ is prime, $E$ is isomorphic to $Z_n$. Suppose ...
0
votes
0answers
4 views

EmailAddress in x500name for CSR? [migrated]

I would like to add EmailAddress to my PKCS10 CSR: .addRDN( BCStrictStyle.EmailAddress, emailAddr ) Why does the Bouncy/Spongey spec say the following?: ...
-5
votes
0answers
12 views

Shamir secret sharing and homomorphism [on hold]

Problem: Implement Shamir’s (k, n) Secret Sharing (SSS) scheme, with $k = 3, n = 5$, to (a) Find shares of a given set of numbers. (b) Compute average from shares (c) Choose any three averages ...
-3
votes
0answers
41 views

How solid is this method of encryption?

Let's say your message is "This is a message." Now translate it into numbers. a=1 b=2 c=3 so on and so forth. Now take those numbers and turn them into three digits based on a randomly generated ...
-3
votes
0answers
10 views

Can someone please decrypt “NUZGIEJX” using Vigenére [on hold]

The key is "FUN". I just want to make sure I am doing it correctly.
0
votes
0answers
8 views

Deciphering and encrypting using Vigenére square for kids?

Is Vigenére cipher the most basic form of enrypting or is there another simpler way? I'd like to expose my niece to it.
0
votes
1answer
43 views

Best known attack

I always have listened the term best known attack but I have doubts respect to this term, becase there are several kinds of attacks for example structural attacks, inversion attacks. It is possible to ...
1
vote
1answer
52 views

Understanding the Hidden Subgroup Problem specific to Integer Factorization

I've been reading about the Hidden Subgroup Problem (HSP), specifically trying to understand how it is related to the integer factorization problem. I've read What exactly is the impact of the hidden ...
1
vote
1answer
13 views

Question about Cipher Block Chaining(CBC)

I'm studying at the moment the CBC Encryption method,and I was asked in an excercise how many bits would be wrong after decryption if during the transmission 2 bits are interchanged. My guess is that ...
0
votes
2answers
326 views

mode of operation in cryptography

We need to choose a mode of operation for a Telnet like application where the average message size is between 7 and 1024 bytes. What is the best mode of operation in this case? a. CBC b. CFB c. ...
-4
votes
0answers
11 views

Breaking El Gamal defined over Sn

How can we break EL-GAMAL Encryption defined over Sn the permutation group ? Kindly give the efficient algorithm for it.
1
vote
1answer
11 views

One time Key Encapsulation Mechanism?

For KEM's, do you only exchange a private key once via the public key encryption and then do all further encryption with this private key, or is a fresh private key sent out with each message? The ...
0
votes
2answers
41 views

Length of encryption password aes-256-cbc

I'm encrypting a file with sensitive information with cat secret | openssl aes-256-cbc -a -salt > secret.enc I am choosing a random encryption password with ...
0
votes
0answers
12 views

Two nodes in p2p network exchange data and read data in same time [on hold]

I want to finde paper about exchange data between two nodes in p2p network. They must read each other's data in same time. In example two player a,b play rock scissors paper. A must read b's data ...
-4
votes
0answers
12 views

Autokey Cipher Question [on hold]

you receive the message DQIXFQETXPPZZR Given that the ciphertext has been encrypted using an Autokey cipher with key k in the range 16 to 18, decipher the meassage. Thanks,
0
votes
0answers
22 views

Security of $(k, 2k)$-bit generator for small seeds

Here is the problem I am working on for context. I have $\epsilon \le 1 - 2^{-k}$ and $\epsilon$ approaches 1 as $k \to \infty$ but I'm stuck on part c). The $f$ is secure iff there does not ...
0
votes
0answers
16 views

Why does DSA require that a new $k$ be chosen and the algorithm restarted if $s=0$?

DSA is an algorithm used to generate a digital signature, which consists of a pair of values $(r,s)$. The algorithm computes $r$ first and then $s$. However, if we calculate $s=0$, it says to restart ...
0
votes
0answers
52 views

Smart Card choice for PKI implementation

I'm seeking to implement a national digital signature standard on a smart card. I feel like this is a good place to ask if anybody is acquainted with a hardware supplier offering smart cards that ...
1
vote
0answers
30 views

How to use OpenSSL command line utility to encrypt data with encrypted key from public key?

I may not be asking the right question. I am fairly new to data encryption. I am currently being sent encrypted data that's stored as follows: [ [keysize] [key encrypted with public key] [ivsize] ...
0
votes
0answers
38 views

Is there an open source library for Functional Encryption? [on hold]

I am looking for a library which implements a functional encryption scheme that can compute a linear function. I am not interested in IBE or ABE, I would be content with the simple computation of the ...
3
votes
1answer
52 views

Do you need a HMAC if decryption attempts are severely limited?

I am considering an application where data bandwidth is extremely limited, and considering removing message authentication codes from encrypted transmissions. The encryption method is currently ...
11
votes
2answers
67 views

Practical differences between circuits and turing machines for cryptography

In formal cryptography, we model algorithms (mostly our adversaries) as (Probabilistic) Turing Machines or as boolean circuits. In our lecture on formal cryptography, we learned that circuits are more ...
4
votes
0answers
61 views

Is correlation in vector distributions “dangerous”?

Consider the two vector distributions $\xi,\chi$ described below, each one outputting integer vectors of length $n$ with coefficients in $\{0,\dots,n\}$. Distribution $\xi$ samples each coefficient ...
5
votes
1answer
88 views

Key size for HMAC-SHA256 [duplicate]

After reading a bunch of past stack exchange posts like this one and RFCs 5869, 2104, and 4868 I felt comfortable that a 32-byte key was sufficient for HMAC-SHA256. However, I am implementing my code ...
3
votes
0answers
29 views

EC Schnorr signature: multiple standard?

I 'm working on some EC-Schnorr signature code. Reading various papers on that, it's seems EC-Schnorr is not standardized as well as ECDSA. For example, I found two main differences in two main ...
-1
votes
0answers
64 views

How to prove that twice the application of a secure PRF stays secure? [on hold]

Problem 4.6*: Let $E: \{0,1\}^k \times \{0,1\}^l \rightarrow \{0,1\}^l$ be a block cipher. The two-fold cascade of $E$ is the blockcipher $E^{(2)}: \{0,1\}^{2k} \times \{0,1\}^l \rightarrow ...
1
vote
1answer
42 views

Tackling encryption problems with “Zipf's law”?

I am new to cryptography and was wondering if it would be possible to semi-reliably "decrypt" an encrypted message by using the statistical distribution of symbols (/letters/numbers) in the encrypted ...
-1
votes
0answers
23 views

Denial of service using Merkel tree proof

If suppose client and server using Merkel tree and some how Server got compromised, what he can do is always send wrong proof therefore denial of service. Is it as simple?
0
votes
1answer
145 views

In RSA. Why is $\phi(n)$ kept secret and $n$ is public?

I mean, $n$ can also be easily used to find the factors $p$ and $q$ right?

15 30 50 per page