-2
votes
0answers
33 views

Unknown Hash or Cipher [closed]

I'm trying to identify what method was used to hash or encrypt a string of text, I have the plain text and the output, however, I have been unable to identify the method used to produce the output. ...
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 ...
1
vote
1answer
42 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
1answer
32 views

How to find the time complexity of modular multiplication? [duplicate]

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)$.
4
votes
1answer
78 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 - ...
1
vote
1answer
110 views

Authentication protocol which detects client impersonation from another machine

Consider following authentication protocol. Client ClientA knows some initial secret KeyA shared with server. Client also knows IP of legitimate server. Now when client wants to establish connection ...
-3
votes
0answers
36 views
11
votes
2answers
1k 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$ ...
4
votes
0answers
67 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 ...
0
votes
1answer
38 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 ...
-1
votes
0answers
27 views

Currently Best Integer not bit FHE [closed]

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?
0
votes
3answers
610 views

Generation of a cyclic group of prime order

I am trying to implement a cyclic group generator in Java, but I am running into some issues. In many cryptosystems, the following phrase is expressed during the key generation stage. Let G be ...
2
votes
1answer
57 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 ...
12
votes
2answers
201 views

Formal verification in cryptography

I have seen in some places that people use formal verification and/or computer-aided verification for cryptography (tools like ProVerif, CryptoVerif, etc.). How do these approaches work?
-1
votes
1answer
31 views

Modelling crypto protocols using Formal methods [on hold]

How to start working with SPIN/Promela for modelling cryptographic protocols using formal method such as LTL?
1
vote
1answer
57 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 ...
3
votes
1answer
61 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
0answers
63 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 ...
0
votes
2answers
334 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. ...
0
votes
0answers
11 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 ...
6
votes
2answers
84 views

What does the TLS 1.2 client finished message contain?

I am implementing TLS 1.2 and I'm stuck on the client finished message. My question is: what is the size and structure of a clients finished message in TLS 1.2 when using the ...
21
votes
6answers
3k views

Why should I make my cipher public?

As I understand it, the less people know about the internals of my protocol or cipher, the more secure the protocol is. However Kerckhoffs's principle states that A cryptosystem should be secure ...
11
votes
2answers
88 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 ...
1
vote
1answer
42 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
65 views

Extracting key bits from linear cryptanalysis equation for SDES

From the linear cryptanalysis of SDES, we get a linear equation consisting the K[1, 3] of the round key 1 and 2. From this how will I retrieve the key bit? How do we solve the linear equation we get ...
0
votes
1answer
34 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 ...
4
votes
1answer
90 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? [closed]

I would like to add EmailAddress to my PKCS10 CSR: .addRDN( BCStrictStyle.EmailAddress, emailAddr ) Why does the Bouncy/Spongey spec say the following?: ...
1
vote
1answer
13 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 ...
-3
votes
0answers
49 views

How solid is this method of encryption? [closed]

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 ...
4
votes
3answers
766 views

How can mega store my login details and still be secure?

I understand how Mega's encryption works. For a quick summary of all those in the future looking for an answer on this... here is how it works: Upon first signing up for an account you make a ...
5
votes
2answers
434 views

Security of tokenization of plain text conversations - cryptanalysis

I came across a marketing video here. They claim to perform AES encryption and tokenization of sensitive data, at the corporate gateway, before it leaves the company firewall destined for the public ...
0
votes
1answer
47 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 ...
-3
votes
0answers
13 views

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

The key is "FUN". I just want to make sure I am doing it correctly.
3
votes
1answer
77 views

Why is padded RSA not CCA-secure?

Why is the padded RSA construction given in the picture not CCA secure?
0
votes
1answer
100 views

Is regular CTR mode vulnerable to any attacks?

Regular plain CTR mode, is it vulnerable to any attack? I plan to write a program to encrypt a drive with ctr mode. Would this be wise? Would AES be better? When I look at this diagram, it looks ...
-1
votes
1answer
49 views

Would the rotors in Enigma machines always advance by one position? Or was there a way to set this?

Before encrypting a letter the first rotor advances by one, right? So there could be a way, once the first rotor turns 26 times, make the second rotor advance two positions instead of one. Or three. ...
-2
votes
1answer
48 views

Affine Cipher - Greatest Common Divisor

Really simple question regarding the Affine Cipher. Can someone tell me how $3^{-1}$ is supposed to result in 9 in the following explanation below?
0
votes
2answers
133 views

How does a Hashing algorithm always result in a digest in a fixed size?

This question revolves around the Hashing Algorithm attribute that the resulting digest is always the same size (also known as Fixed Width). For example, whether you hash the word "hello", or 10gb ...
8
votes
5answers
328 views

Which cryptography technique does not increase the size of the plain data?

I want to encrypt some data(text/voice/video) but it is essential that the size of the cipher data remains the same as the plain data. Which techniques can I use, and how secure are these techniques ...
1
vote
2answers
1k views

What is the length field in SHA-512 padding?

If I am using SHA-512 on a message and need to determine the padding field and length field, how do I determine the length field? I think I understand the padding, but not the length field. For ...
14
votes
2answers
2k views

Can someone explain the ECB Penguin?

I've seen the ECB Penguin used to demonstrate why ECB is not a recommended method of encryption, but I do not understand how this translates to text or passwords. Aren't the people who create these ...
11
votes
2answers
2k views

Terminology: differences between the terms “pre-master secret”, “master secret”, “private key”, and “shared secret”?

Both crypto.SE and security.SE have excellent Q&As about how TLS generates session keys (I have linked some at the bottom). In reading these threads I'm having troubles with terminology since the ...
4
votes
1answer
83 views

Understanding Hellman's TMTO

I am trying to understand the basic TMTO by Diffie Hellman as described here. I am having trouble understanding this passage here: Hellman had the idea of storing the dictionary in the form of ...
1
vote
1answer
411 views

Blowfish ECB mode: Tools for known-plaintext attack?

I'm currently dealing with multiple blowfish-encrypted files that share the same key. All are encrypted using ECB mode judging from their appearance: I don't know what the key is but I know 64 ...
21
votes
2answers
2k views

Why is PuTTYgen-created RSA public exponent(e) not in {3,17,65537}?

As far as I know, RSA public exponent(e) should be one of {3,17,65537}. However, I found PuTTYgen-created RSA public exponent(e) is 0x25(37) by default,as follows, (PuTTYgen version: 0.66) I am ...
3
votes
1answer
143 views

Is finding collisions in a part-hash not often enough a bad problem?

My situation: I've been working now for a couple of months on my own unique hash function, I've changed it many times and had two main versions but I won't bore anyone with the details of my work; at ...
0
votes
1answer
53 views

Creating a message authentication scheme

I have such situation. I have a device like dongle. But it has certain limitations. For example, it can only have implemented encryption and decryption functionality. The availability of ciphers ...
3
votes
2answers
184 views

What is the difference between SHA-3(Keccak) and previous generation SHA algorithms?

SHA-1 and SHA-2 share the same structure and mathematical operation as their predecessors - SHA-0 and MD5. Both SHA-0 and MD5 have been broken. This is one of the main reasons why SHA-1 is considered ...
1
vote
0answers
49 views

What is th purpose of m and q in elliptic curve cryptography protocols?

In crypto protocols that contains calculus on elliptic curves I can often see $\dfrac{m}{q}$$Q$ where $m$ stands for order of EC points group and $q$ is the order of corresponding subgroup of $m$. $Q ...

15 30 50 per page