Cryptography Questions, Problems & Solutions : TransWikia.com ~ Page 9

Speed of a 16384-bit RSA key

I don't think it makes much sense to use RSA keys to authenticate the establishment of symmetric keys with strengths less than their own. From what I know, a 16384-bit...

Asked on 03/02/2021 by Melab

1 answer

Practical use of semi direct product of group in Cryptography

Is there any example of semi-direct product used in any of cryptographic application? Does it help in choosing integers p, q in RSA?...

Asked on 02/23/2021 by SSA

1 answer

Can I use ChaCha20-Poly1305 as my KDF?

I have two devices that use a PSK. One is embedded and extremely resource confined. I'm already using ChaCha20-Poly1305 so it would be "free" to reuse this. There is no...

Asked on 02/23/2021 by mint branch conditioner

2 answer

Elliptic curve group inverse addition in OpenSSL

I am using group P-256 on OpenSSL with C++. My understanding was that, if you have a point $xP$ and then calculate (xP)^(-1) with EC_POINT_invert(group, xP_inv, ctx), then when...

Asked on 02/21/2021

0 answer

Forge valid token with misuse of OTP key reuse

I'm new to OTP and received a challenge.ChallengeContext: A server uses OTP to encrypt and decrypt authentication tokens.Misuse: The server always uses the same key.Objective: Forge a valid token for...

Asked on 02/19/2021 by Irwin

0 answer

Vulnerability in the Digital Signature Algorithm. Can I calculate k and x?

I feel DSA is vulnerable if k is randomly selected over a small set, example, {1,2,...,2^16 -1}. I am trying to come up with a program where I assume I...

Asked on 02/18/2021 by confused andstuck

0 answer

Inside attack (attack from participants) in secret sharing

I have considered a $(t,n)$ secret sharing scheme with $n$ secret, say $a1,a2....an$. It's third party secure, but it has inside adversaries. While reconstructing secrets, a group...

Asked on 02/18/2021

1 answer

Does there exist a test vector for the Xoodoo permutation?

What I need is a set of pairs, where the first element of the pair is a 384-bit input (including the sequence of 384 zero bits) and the second element...

Asked on 02/16/2021

0 answer

Time-memory tradeoffs in Shor's algorithm

Can a quantum computer with insufficient qubits to factor an integer of a given size make any progress in factoring it? For example, what if a quantum computer is only...

Asked on 02/13/2021 by forest

0 answer

Is truncated hash collision resistant if original hash is collision resistant?

Let's say I have a collision resistant hash function $H: {0,1}^* rightarrow {0,1}^n$ and I want to create another collision resistant hash function $H': {0,1}^* rightarrow {0,1}^n$ using...

Asked on 02/09/2021 by doctopus

0 answer

Ask a Question

Get help from others!

Cryptography : Recent Questions and Answers (Page 9)

Ask a Question