# All Questions

81 views

### Is it possible to test implementation for side-channel attacks?

When it comes to implementing cryptographic algorithms, there seems to be a big focus on the difficulty of doing so without introducing the potential for side channel attacks and the knowledge ...
53 views

### Explanation of cryptographic terminology for newbies [on hold]

I feel like I'm making a mountain out of a molehill here, but I have (what should be) a relatively simple project, but the terminology used all over the Internet is either too simple or too difficult ...
12 views

### Can someone help me decipher this? [closed]

I have absolutely no idea what this is or how to decipher it. Could you either do it... or help me learn how to? ...
137 views

### Any benefit to writing a message as a mix of 2 languages before encryption?

For example, imagine a message that is a mix of Japanese and English words; Japanese in unicode, English in ASCII. Japanese doesn't use spaces between words. The sentence structures, anything ...
39 views

### Found weil pairing. Index Calculus method on the results of weil pairing

Consider Elliptic curve with p = 59, A = 1, B= 0, P = (25,30) and Q=(35,31). So I tried to solve this using MOV attack. The torsion point for them E[5] is R(-25,30i) where is sqroot -1 Chosen two ...
64 views

### Parameterizing adversaries with security parameters

In many cryptographic games, the adversary doesn't seem to be parameterized by the security parameter.‡ Are such games equivalent to variants in which the adversary is parameterized by the security ...
947 views

### Can any MAC be used as a KDF?

First, let me clarify what I mean with a Key Derivation Function (KDF). I'm interested in KDFs that take an $n$-bit symmetric master key and some diversification data of arbitrary length as input and ...
92 views

### Importance of round complexity in determining the efficiency of an MPC protocol

Literature has different ways of specifying complexity of an MPC protocol: computation complexity that measures the number of (assumed primitive) operations performed by all the parties; ...
33 views

### Dependency of cryptographic protocols on cryptography primitives

To what extent depend cryptographic protocols on cryptographic primitives? Are there cryptographic protocols that can only be implemented with certain cryptographic primitives? If the answer is yes, ...
52 views

### Why is RSA still being used? [duplicate]

In hybrid encrytion, I still see that some site's use RSA in their https connection, so now I wonder, why do they not use ECC instead of RSA, ECC requires less computational power and encrypt's and ...
22 views

### How to decrypt the below encrypted messages? [on hold]

My friend was experimenting with the encryption methods (self-made) to encrypt text using ASCII map. He wanted to try this idea whether this encryption can be broken and so shared an encrypted text ...
533 views

### Decrypting a blowfish cipher with three keys

Disclaimer: I'm pretty new to cryptography and I don't have a strong mathematical background. I apologize in advance if I missed something blatantly obvious. I participated in a security CTF this ...
75 views

### Public-key Cryptography: I need a technical answer [closed]

So, I already understand the point of Public-key cryptography, and how it's supposed to work. I understand the basics, and I've seen way to many diagrams. What I haven't seen enough of, however, is ...
63 views

### Is there a method/protocol to validate a self-signed certificate by comparing a shortened hash?

I'm working on a solution where an iPad should connect to a server software running on a laptop using TLS with a self-signed certificate that was automatically generated on the laptop during the ...
63 views

### Given a prime exponent e and a prime number n, find b, where b^e = 1 mod n

Can anyone help me with the following problem. Given a prime exponent $e$ and a prime number $n$, find $b$, where $b^e \equiv 1 \bmod n \land b > 1$. For example, $b^5 \equiv 1 \bmod 11$ how to ...
46 views

### In Shamir's (t, n) secret sharing scheme why don't use infinite field? [duplicate]

Well, we use finite fields to select shares. What happened if we use infinite fields.then will the scheme be vulnerable? Easy to break? Or share generation and reconstruction will be difficult? ...
36 views

### Given C is a code of length n. Containing M code-words with a distance d

I'm studying for my exam and came across this question below. I don't understand how to get $d$. I get $C$ is a code of length $n$. Containing $M$ code-words with a distance $d$. $(n,M,d)$ But how ...
122 views

### How does DH work when combined with ECC or RSA?

I know that Diffie-Hellman is used to create keys in a secure way over an insecure channel. But there is one thing which I cannot understand: I see that a lot of sites use ECC or RSA alongside DH. ...
50 views

### Binary format of encrypted PGP private key?

Short Version of the Question: I would like to remove any predictable information from an encrypted private keys binary representation. Does anyone have a hint where the binary format for encrypted ...
112 views

### Is the use of AES in LoRaWAN correct?

I'm reading about LoRaWAN (specification). This network protocol has a particular way to encrypt data, detailed in the part 4.3.3.1. Here is a recap of how the encryption work, as I understood it. ...
37 views