5
votes
2answers
479 views

Feistel-Network - why wire crossing?

In Feistel-Network, there would be a wire-crossing at the end (for the next round). Which insufficiency would occur, if the wire crossing would be omitted?
2
votes
1answer
27 views

Attacks from releasing decrypted CCM payload before verifying tag

CCM specifies (Section 1.7) that no plaintext data should be released before the MAC is verified. Why is this recommendation given and what attacks are possible against CCM if data is treated like a ...
3
votes
0answers
43 views

Attacking Scrypt Under Access Pattern Leakage

Could cache-timing channels (such as exist for certain block ciphers) somehow be made use of in order to extract memory-access pattern information if both the attacker and user are NOT in a shared ...
0
votes
2answers
86 views

How do “modes of operation” with block ciphers like (eg) DES work?

When trying to understand how “modes of operation” are applied when using block ciphers like DES, I noticed I must be missing something. Maybe I simply misunderstood or mixed up things somewhere. ...
6
votes
1answer
84 views

Efficiency of oblivious algorithms vs non-oblivious algorithms?

Recently, plenty of researchers are looking at designing efficient data-oblivious algorithms. Roughly speaking, an algorithm is said to be data-oblivious if its data access patterns are independednt ...
6
votes
2answers
138 views

Are any of the practical implementations of ORAM being used in a real world system?

The concept of Oblivious RAM (ORAM) was first introduced by Oded Goldreich and Rafail Ostrovsky in 1996. However, in the past 5-10 years there has been a surge in the amount of research that looks ...
-2
votes
0answers
46 views

How do I decipher a text using a repeating one-time pad?

I have an encrypted message that is 582 characters long. I know that: It is in hexadecimal It has been encrypted using a one time pad The pad's length is exactly 50 characters When the pad reaches ...
0
votes
1answer
37 views

Do RSA keys contain a checksum mechanism? [duplicate]

I'm new to cryptography, and I was making an experiment a few minutes ago, but I want to have some deeper knowledge about RSA public and private keys. I have a set of keys One begins with ...
0
votes
2answers
75 views

What makes an open source encryption algorithm safe?

Take for example the popular AES algorithm where we have a combination of substitution, shift row, mix column, and add key steps involved in encrypting plain test. All of the mathematical operations ...
3
votes
1answer
58 views

How to deniably send a value

Alice has a single bit of information, b, that she wants to send to Bob (over an unalterable but possibly-monitored channel) but in such a way that without the ...
1
vote
0answers
70 views

Who invented the $1^n$ notation? [duplicate]

I am always wondering about the seemingly odd syntax $1^n$ which designates the security strength of a cryptographic algorithm. Who invented this (odd) syntax and what was the reason for inventing ...
8
votes
2answers
413 views

Are there key-derivation functions that are safe to use in parallel on the same secret?

I'm considering using a key-derivation scheme for generating multiple keys from the same user secret. It is important that given all but one of these derived keys, it is not feasible to calculate the ...
0
votes
0answers
74 views

What is the non-programmable random oracle model?

I would like to know the difference between the random oracle model and the non-programmable random oracle model. ​ What is the difference?
4
votes
1answer
89 views

Finding all polynomials up to a given degree to generate a bit sequence

Consider the following bit sequence: 00100000110 Using Berlekamp-Massey algorithm we can find the following minimal degree polynomial: $P(x)=x^6 + x^5 + x^4 + 1$ Now, is there a way to find all ...
0
votes
0answers
18 views

Notation of * in hash function of identity-based encryption

$H:\{0,1\}^{*} \rightarrow Z_{p}^{*}$ $H:\{0,1\}^{*} \rightarrow Z_{p}$ $H:\{0,1\}^{*} \rightarrow G_{1}^{*}$ $H:\{0,1\}^{*} \rightarrow G_{1}$ Difference meaning of $Z_{p}^{*}, Z_{p},G_{1}^{...
9
votes
1answer
108 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 ...
1
vote
3answers
148 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 ...
0
votes
0answers
44 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 ...
3
votes
1answer
67 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 ...
11
votes
2answers
974 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 ...
3
votes
2answers
104 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; ...
0
votes
0answers
35 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, ...
0
votes
0answers
55 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 ...
3
votes
0answers
45 views

How to decrypt the below encrypted messages? [closed]

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 ...
2
votes
1answer
539 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 ...
2
votes
3answers
67 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 ...
0
votes
1answer
64 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 ...
-2
votes
1answer
56 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? ...
1
vote
1answer
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 ...
2
votes
1answer
133 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. ...
5
votes
1answer
53 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 ...
3
votes
1answer
139 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. ...
2
votes
1answer
49 views

Find an example of a lattice such that LLL algorithm can't find the shortest vector of the lattice, satisfying

I want to find an example of a basis of a lattice of dimension $n$ such that LLL algorithm can't find the shortest vector of the lattice, and such that the shortest vector of this lattice, say $b=...
0
votes
0answers
27 views

Password manager that uses a mix of long and short key derivation functions

I was reading "A Convenient Method for Securely Managing Passwords, Halderman et al., 2005". In short, the authors say to do the following: ...
5
votes
0answers
46 views

Quantum complexity of LWE

As per my understanding LWE is quantum secure because there is no known quantum algorithm to solve LWE in polynomial time. Due to the reductions given by Regev et al. If there is any algorithm that ...
2
votes
0answers
60 views

Are analog quantum computers a threat to RSA and DLP?

We already know that D-WAVE's "quantum computers" can't really run the Shor's algorithm, because the way they're built doesn't qualify them as universal quantum computers. Now researchers actually ...
3
votes
1answer
94 views

Salting Hash stored on RFID tag?

In my application, I am trying to prevent counterfeit widgets from being used on our gadgets; think HP ink-cartridges. I will be doing such with UHF RFID tags embedded in the widgets. Unfortunately, ...
0
votes
0answers
69 views

Security Proof in Fuzzy Identity Based Encryption?

Been having a great deal of difficulty understanding the use of simulators to prove security of ABE schemes so I though I would start from the first ABE paper (Fuzzy Identity Based Encryption) to try ...
1
vote
1answer
47 views

Conditional probability with Vigenere Cipher given specific plaintexts and key sizes

Apologies if this should be in the Mathematics stack exchange, I just ask it here because the context is cryptography. Here is the question that I seemingly cannot get correct: Consider the ...
3
votes
1answer
58 views

Conditions for Perfect Secrecy with the Vigenere Cipher

Please forgive my ignorance here as I'm far from a math major and I've never looked into cryptography before so if this seems stupid - it probably is. There is a question in a quiz I'm attempting that ...
0
votes
1answer
64 views

Questions about length key of RSA 2048 bit

I use putty gen to generate RSA key, I choose length of key is 2048 bit, it generate public key: ...
3
votes
1answer
74 views

proof of correctness Ring-LWE cryptosystem

I've been studying Ring-LWE based crytposystems such as the one in this paper, but I can't seem to find/come up with a proof of correctness for this particular scheme. The encryption goes as follows: ...
2
votes
1answer
117 views

Forgery attack against Textbook RSA with simple redundancy

I know how to forge vanilla Textbook RSA message signatures (easy). I've learnt that by adding a good redundancy to the message, it cannot be forged anymore. How can one add redundancy so that the ...
0
votes
0answers
24 views

Diffie-Hellman combined with DSA/RSA

we have learned Diffie-Hellman, RSA and DSA (Digital Signature Algorithm) in university. Because DH is vulnerable of Man-in-the-Middle we had the task to program the DH combined with RSA to protect ...
1
vote
1answer
28 views

Can I use the Sequence Number as the (implicit) IV in AES-GCM IPsec?

The RFC https://tools.ietf.org/html/rfc4106#page-5 states that, under AES-GCM IPsec, each packet is expanded by 8 bytes for the IV and up to 16 bytes for the ICV. Why? Since we already have a ...
3
votes
1answer
78 views

tripartite diffie hellman with Weil pairing

I try to understand how the tripartite Diffie-Hellman key exchange works. I read Joux's paper for this: https://www.semanticscholar.org/paper/A-One-Round-Protocol-for-Tripartite-Diffie-Hellman-Joux/...
5
votes
1answer
72 views

What is the most efficient attack on NTRU?

So, I got how finding the private key is equivalent to resolving the SVP. I also understood that the LLL algorithm can only be used in small dimensions. Now, I wonder what is the most efficient attack ...
3
votes
1answer
121 views

Change initial hash value of SHA512/t

Fips 180-4 defines under 5.3.6 how to calculate initial hash values for SHA512/t for a given value t. Can someone explain me how the t actually affects the outcome of the procedure (which, as far as I ...
5
votes
1answer
671 views

What does this notation stand for when describing a code?

This code has appeared in some online course material. I understand the $(5, 4, 3)$ refers to (length, num codewords, distance) but no explanation of the $Z_2^5$ notation is given: One $(5,4,3)$ ...
0
votes
1answer
33 views

factorization of an integer $N$ that is in special format

Suppose $p_0$ and $q_0$ are known prime numbers and define $p_i$ and $q_i$ as follows: $$p_{i+1} = next\_prime(p_i^2 + q_i^2), \qquad i \ge 0$$ and $$q_{i+1} = next\_prime(2p_iq_i), \qquad i \ge 0$$ ...

15 30 50 per page