6
votes
2answers
661 views

HMAC vs ECDSA for JWT

I will be implementing JSON web tokens into my website and have a question about implementing them. I have a choice of using two algorithms, HMAC-SHA256 and ECDSA-SHA256. I have used HMAC-SHA256 in ...
2
votes
1answer
334 views

Using a SHA512 hash to encrypt data

How can I judge the level of security with the following algorithm: I create a 64 byte hash using SHA512 via some input. I use this hash to iterate over the plaintext, byte by byte, and similarly ...
3
votes
2answers
62 views

Is it OK to use a secret IV as key when creating keyed MD5 checksum for fixed-size data?

Is it OK to use a secret IV as key when creating keyed MD5 checksum for fixed-size data? Because data size is known, attacker cannot append anything. And I think it's hard to raise chosen-plaintext ...
2
votes
2answers
92 views

Securely generating auth tokens

(Disclaimer: I'm an experienced server-side Java programmer, but with little crypto experience.) Objective: I've got a login server which, given a login+password pair, should issue a unique auth ...
3
votes
1answer
77 views

Improving security of (authentication) protocol

I have a basic protocol which tries to authenticate messages going from client to server. Basically it is like this: Imagine I want to send message M to server. Client computes a MAC over the ...
10
votes
1answer
406 views

Status of Algebraic Eraser key exchange?

Algebraic Eraser™ is a relatively new asymmetric key agreement protocol (also designated the Colored Burau Key Agreement Protocol), based on a simultaneous conjugacy search problem in a braid ...
1
vote
0answers
40 views

Is this ECC based messaging method secure?

I developing an encrypted messaging for ZeroNet (aP2P file-based network, website: zeronet.io) and would like to have some guidelines if any of this could work. My first idea: In ZeroNet every user ...
0
votes
1answer
98 views

How to prove that a SKE scheme is IND-CPA secure

There's an IND-CPA SKE scheme 1 $(\mathsf{Gen}, \mathsf{Enc}, \mathsf{Dec})$. Scheme 2 is defined as $(\mathsf{Gen}', \mathsf{Enc}', \mathsf{Dec}')$, where $\mathsf{Gen}' = \mathsf{Gen}$, ...
7
votes
1answer
154 views

Branchless AES Implementation

Imagine a branchless implementation of the AES-128 cipher. Are there any benefits over the implementation that contains branches, other than possible prevention of timing attacks? Is it even true, ...
2
votes
1answer
121 views

Is it an overkill to add external integrity check to the AES-GCM encoding?

There is a java library for android which implements integrity checking to predefined encrypting mode(which can be found here). Short class description from author page to avoid further questions ...
2
votes
1answer
46 views

Is it secure to use ciphertext feedback with RC4?

Consider the following modification of RC4 to give some "ciphertext feedback" ...
0
votes
0answers
22 views

Advantages of the general digraph trust model over the strict hierarchical model

Are there any advantages of using reverse certificates and the general digraph trust model over the strict hierarchical trust model as described here: In the digraph model each CA can generate ...
1
vote
1answer
151 views

Cracking simple RSA when just the ciphertext and one public key is known

Can someone explain to me (Or better yet, point me to a tool that does the brute forcing) how to crack a standard, simple RSA cipher (So don't bother with padding) if I know just one public key, the ...
3
votes
1answer
147 views

Symmetric encryption using RSA for random generated password

I'm fairly new to encryption, so I wanted to check the logic for a .net solution I'm working on that encrypts data between two parties. the receiving (decrypting) party will have an RSA key pair ...
0
votes
1answer
71 views

Why is Tor alone not enough to guarantee anonymity for Bitcoin?

Why is Tor alone not enough to guarantee anonymity for Bitcoin? Why do we need the constructions like Zerocoin?
1
vote
1answer
146 views

Proving collision resistance of a hash function?

Let $f$, $g$, and $h$ be hash functions that each map binary strings of length $2n$ to binary strings of length $n$. Suppose that $h(x) = f(g(x)||g(x))$. Prove that if $f$ and $g$ are collision ...
1
vote
0answers
47 views

on broadcast encryption

I've read the following paper and have one question on it. M. Luby and J. Staddon, "Combinatorial Bounds for Broadcast Encryption", EUROCRYPT'98. On page 523 (12th page of the paper) the authors say ...
1
vote
1answer
47 views

Key material leak from initialized cipher?

Let's imagine that cipher (say AES256 in CBC mode) is initialized when application starts: ...
3
votes
1answer
59 views

How is a group element converted into a key?

I've only just started research on cryptography so I apologize if this is a basic question or I'm getting terms confused. I'm researching braid group cryptography and currently looking at the ...
5
votes
2answers
111 views

Leading 00 in RSA public/private key file

I found these following values ALWAYS have the leading 00 in public/private key, public key: modulus private key: modulus, p,q, d mod (p-1), d mod (q-1), coefficient e.g., modulus ...
0
votes
0answers
17 views

Strength of a cryptography algorithm [duplicate]

I'm just read this article from Atmel corporation in comparing RSA with ECC cryptography algorithms. First of all please read these two paragraphs quoted from the article: P1: Strength of an ...
2
votes
1answer
42 views

Is a hash “reset sequence” possible?

Is there such thing as "hash reset sequence" that brings hash to the same known state? A hash function has a state. In MD5 and others vulnerable to the length extension attack, the attack works by ...
7
votes
2answers
197 views

Can the Smart-Vercauteren Homomorphic Encryption be implemented as a practical fully homomorphic encryption scheme?

Smart and Vercauteren proposed a homomorphic encryption scheme (PKC 2010) following Gentry's principles. ​ Though their scheme can achieve fully homomorphism theoretically, they admitted that "for ...
2
votes
1answer
84 views

IV larger than block size of cipher?

Is there any advantage to using an IV larger than a cipher's block size? Say I'm using AES-256 in Galois Counter Mode (GCM). My file format looks like this: ...
4
votes
1answer
173 views

Consequence of a change on the Guillou-Quisquater Protocol

In the Guillou-Quisquater Protocol, the prover convinces the verifier that he knows an $e$-th root of an element $y \in \mathbb{Z}^*_n$ ($p, q, e$ are primes, $n = pq$ and $e$ is coprime with ...
0
votes
2answers
139 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 ...
0
votes
3answers
156 views

Factorizing N to derive D [duplicate]

So I have the value of N. I have to use this value of N to find the value of D. N = 265291078722948385089717069136983657793 Now I read about RSA algos and found out that ...
5
votes
1answer
87 views

Do low-entropy fingerprints actually make any sense?

I'm thinking of ZRTP and OTR in particular here. From my understanding, after a Diffie-Hellman session is initiated, the shared secret is then hashed into a 4-digit number, which the two parties can ...
3
votes
2answers
231 views

What is the use case for XOF functions (i.e. SHAKE128/256)?

FIPS 202 defines 2 functions: SHAKE128 SHAKE256 As extendable-output functions (XOFs) that can have variable output length. But in Appendix A.2 marks: it is possible to use an XOF as a hash ...
1
vote
1answer
86 views

Time complexity of trial division

Suppose $n=pq$, where p,q are prime numbers. let $p ( \le q)$ be the smallest prime, then we know that $p \le \sqrt{n}$. In trail division, we check $n \mod i$ for the values of $i$ from 2 to ...
1
vote
1answer
53 views

Help with pseudorandom functions

I started a new lecture this year about crypto and I've had a few problems in the first few weeks with the exercises we got. I would appreciate a "guide" on how to solve problems like the following ...
3
votes
2answers
104 views

Are all encryption tools made equal?

I'd like to encrypt work-related data backups stored on an external drive. The backups contain proprietary company information and trade secrets. My current backup program, Comodo Backup, allows me ...
3
votes
2answers
172 views

Is there any relation between two strings with the same MD5 hash?

Is there any relation between two strings with the same MD5 hash? For example these two strings: ...
0
votes
1answer
86 views

what problem happen if we always use IV Zero in CBC Mode? [duplicate]

i have a question about CBC operating mode. what problem happen if we always use IV Zero in CBC Mode?
0
votes
0answers
41 views

Why we use operating modes in cryptography? [duplicate]

Why we use operating modes (CBC , . . ) in cryptography? i mean what is the essential of use it ?
3
votes
1answer
126 views

Relationship between exponent and modulus in RSA (as RSA properties as listed in X.509)

In one of my assignments, I had the following question (Please read on. Not a homework assignment :) ): X.509 (1998 version) lists properties that RSA keys must satisfy to be secure. One such ...
1
vote
0answers
51 views

Grouping in BGN

The below equation is mentioned in Homomorphic Encryption and the BGN Cryptosystem (pdf, page 4): Mult(pk, $C_1$, $C_2$): Choose $u \xleftarrow{R} [1, n]$ and output $D = \hat{e}(C_1, C_2) \cdot ...
1
vote
1answer
177 views

Confused with 128-bits AES round numbers

The key size used for an AES cipher specifies the number of repetitions of transformation rounds that convert the input, called the plaintext, into the final output, called the ciphertext. The ...
1
vote
0answers
62 views

Calculating Phi(M) and D for RSA decryption given p,q,e

I've been given a message in 4 digit numbers but it doesn't seem to work when I use my calculated values for phi(m) and d. If I'm correct phi(m) = (p-1)(q-1) correct? And d is given by ed = ...
-2
votes
1answer
37 views

Test vectors representation

The test vectors listed in https://github.com/cantora/avr-crypto-lib/blob/master/testvectors/Mickey-v2-128-unverified.test-vectors Are represented as Hex strings? I'm sure that the key is, because ...
2
votes
1answer
207 views

RSA vs ECDSA/ECDH

So we've been using RSA for a while now. I wonder, is it still secure? I'm wondering whether surveillance agencies can at this point read traffic encrypted with say, TLS_ECDH_RSA_WITH_AES_128_GCM? ...
2
votes
2answers
183 views

Why do 1st and 3rd key have to be the same in 2 key 3DES?

From this answer: However, that wasn't the only situation they had in mind; they also considered the case where someone implemented 2 key 3DES in hardware (which the first and last subkeys ...
2
votes
1answer
149 views

Encryption that can only be decrypted once?

I want to encrypt a message so that it can only be decrypted once. I know that we can use nonces to do this when we exchange data over a communication channel, but in my case the cipher text will be ...
2
votes
0answers
70 views

If a PRG is constructed by iterating a PRF, is it backtracking-resistant?

Say we construct a pseudo-random number generator from a pseudo-random function $f$ (using some constant key $k$ and some initial value $v_0$). We do this by feeding the output block of the PRF back ...
3
votes
3answers
204 views

Does complicating a flawed algorithm make it secure?

It's a basic question I guess, but I don't know the answer and I don't think that anyone asked it. Suppose I built a system, it relies on MD5 for security, suddenly I read am article on how easy are ...
4
votes
0answers
62 views

Which precautions to protect against side-channel attacks on ARX ciphers?

In recent crypto there has been a trend to design ciphers using only the ARX set of instructions - i.e. additions (modulo $2^{32}$ or $2^{64}$), rotations (by a fixed constant) and XORs, examples ...
3
votes
1answer
64 views

MD5 Hash outputs not produced

Are there any hash outputs not produced by the MD5 hash function? I need to use it as a placeholder for an empty hash while comparing two hashes.
1
vote
1answer
53 views

How many Hashes to find a digest of 2^{n−k}?

Given an n-bit cryptographic hash function $H$, how many messages should we expect to hash before finding a message $x$ such that $H(x) < 2^{n−k}$ for some integer k? My take: Shouldn't it simply ...
2
votes
3answers
437 views

Prevent replay attack without storage

I am designing a set of low-power sensing motes. Each mote will communicate to a central base over RF. I want the mote to be able to authenticate itself with the base, and send its data without being ...
1
vote
1answer
79 views

Where can I get the correct and precise algorithms for elliptic curve cryptography?

I have been asked to implement cryptographic operations using elliptic curves. I would like to get precise algorithms for various processes like key generation, digital signature and verification. I ...

15 30 50 per page