1
vote
1answer
53 views

Encoding an element in $r=r'||h(r')$ way

We consider a finite field $\mathbb{F}_p$, where $p$ is a large prime e.g. 256-bit. We have $b$ a fixed element of the field. We encode it as $b'=b||h(b)$, where $h(.)$ is a cryptographic hash ...
-1
votes
1answer
45 views

How to tell if an audio stream is encrypted or corrupted? [closed]

Is the following stream encrypted or corrupted? I was on a call and then this happened: http://vocaroo.com/i/s0PlF2s8ULAU
1
vote
0answers
25 views

Proof that two signatures are done with the same short bases

My question is regarding lattice based signatures. Each lattice can have multiple short (secret) bases. Is it possible to proof in zero knowledge that two signatures on a fixed lattice have been ...
1
vote
0answers
23 views

What is the exact algorithm and functions of the 4 way handshake?

I have to make a detailed diagram of the 4 way handshake and formulas for its functions so I need to know the exact process behind it. Like precisely what functions are used in it? I have been trying ...
5
votes
1answer
208 views

How should I read these three-dimensional (pseudo)random-generated numbers representations?

Visiting this site: http://lcamtuf.coredump.cx/oldtcp/tcpseq.html#phase I found graphical representations of random-generated sequence numbers, but I can't figure out how to interprete the plots. ...
0
votes
1answer
46 views

A5/2: Ciphertext Only Attack

A5/2 could be attacked with cipher-text only, using the Error Correction Code, in order to retrieve the session key. For the purpose of simplicity suppose that the error correction code copy the ...
13
votes
4answers
3k views

Which public key cryptosystems are not based on number theory?

Are there any public key cryptographic systems whose hardness assumptions don't involve number theoretic problems?
-2
votes
0answers
50 views

any post-shannon symmetric ciphers?

As far as I understand block ciphers use only simple operations to ensure good enough confusion and diffusion levels. meaning there is no math in it. "breaking a good cipher should require as much ...
4
votes
0answers
65 views

Does changing the order of the steps within a round affect the security of AES?

I was trying to understand the internal structure of AES (Advanced Encryption Standard) Standard order of steps within a round: Substitute Bytes Shift Rows Mix Columns Add Round Key Substitute ...
3
votes
1answer
52 views

What do the last chunks of the output string of Scrypt contain?

When you use scrypt to hash a string, it will generate something like: ...
0
votes
1answer
39 views

Why is symmetric lightweight crypto only about block ciphers and not about stream ciphers?

Why is symmetric lightweight cryptography only about block ciphers and not about stream ciphers? AFAIK stream cipher implementations cost at least three times less than block cipher ones?
1
vote
1answer
37 views

In Paillier homomorphism how do you substract?

I'm trying to learn homomorphism so the problem may also be in my code (which I will include). I want to compute $a - b$ where $a$ is bigger then $b$. In order to do this I tried to compute $\frac{a}...
1
vote
1answer
33 views

“NP-complete” authentication systems

Are there any symmetric authentication systems based on the hardness of an NP-complete problem? I understand that it doesn't really matter, since NP-completeness is about the worst case, and in crypto ...
1
vote
1answer
43 views

Rotating password with PBKDF2

Crypto is hard. Thank you for helping me learn. My encryption scheme currently looks like this: Salt is stored out in the open Secret is the user's password, known only to them EncKey||AuthKey = ...
6
votes
2answers
376 views

We can obtain “absolutely perfect CONFIDENTIALITY” using the one-time pad. Is there such a thing as “absolutely perfect INTEGRITY”? [duplicate]

The OTP (one-time pad) gives us perfect secrecy. This is the very best confidentiality available in this universe. (Although it does require large keys, which is beside the point of this question). ...
1
vote
0answers
70 views

Feasible attacks on ECRSA cryptosystem

In ECRSA cryptosystem, I want to know the feasible attacks. For illustrations we have two prime $p$ and $q$ such that $p \equiv 2 \pmod 3$, $q \equiv 2 \pmod 3$ and generate key pair as follows: $$n = ...
0
votes
1answer
26 views

In Paillier homomorphism, how do you deal with bit length? [closed]

I'm trying to figure out homomorphic encryption and would like to multiply two paillier encrypted numbers. Like so: [a].[b]=[a+b] To try this I got this Paillier.java and tried the following: <...
5
votes
1answer
135 views

How can I instantiate a generalized hash function?

I've come across a bunch of "strange" hash function notations, such as the following ones and now I don't know how to choose / instantiate them. Can you please explain me what this notation means and ...
3
votes
2answers
53 views

SHA-3 maximal number of zeros (Padding)

What is the maximum number of zeros, which are appended at the input- padding in messages? How large must the message be for this?
0
votes
0answers
26 views

elliptic curve and embedding degree

I am new in ECC. I am confused what the embedding degree in elliptic curve represents and what is the impact of its values on the curve and security ( small values or large values? What does the ...
2
votes
0answers
19 views

hash function notations and existing cryptographic hash algorithms [duplicate]

I am implementing Role-based access control by referencing the paper Enforcing Role-Based Access Control for Secure Data Storage in the Cloud. In page 6, they have mentioned to choose hash functions $...
1
vote
0answers
28 views

Hash function notations and their corresponding existing cryptographic hash algorithm

I am implementing Role-based access control by referencing the paper Enforcing Role-Based Access Control for Secure Data Storage in the Cloud. In page 6, they have mentioned to choose hash functions $...
1
vote
0answers
40 views

Build a hash function that returns a digest in $\mathbb{Z}_{N}^{\ast}$

I want to know if there is a way to build a Hash Function in a such way? $\mathcal{H}:{\left\{ {0,1} \right\}^*} \to \mathbb{Z}_{N}^{\ast}$, $N=pq$ and where $p,q$ are primes.
3
votes
1answer
52 views

How is a hash function that implements random oracle model collision resistance?

ROM is considered as collision resistance. Does ROM assume there is an infinite set of output, or assume the output set is always larger than the input set? Because by the pigeonhole principle, ROM is ...
2
votes
1answer
173 views

Prime factorization of 700 decimal digits number

I'm a newbie to encryption. If I create a number 'n' as a product of two prime numbers 'p' and 'q' with the following specifications: 'p' is a fully random prime with 300 decimal digits in length. 'q'...
0
votes
1answer
31 views

Getting the same two hash values for carved files I found

I am doing an independent study class for computer forensics, I have to carve the images I've been given. After using scalpel I get a .wav file and .asf file both files play the same songs, and they ...
2
votes
0answers
24 views

What is bounded-retrieval model?

What is bounded-retrieval model in cryptography? How is it related (or apply) to leakage-resilient cryptography?
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
87 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
85 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
139 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
47 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
415 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
78 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
90 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
109 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
149 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
107 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 ...

15 30 50 per page