Latest Crypto related questions

Score: -2
convert from one bech32 address to another with different slip44 coinTypes
jp flag

I would like convert between one bech32 address to another with different slip44 coinTypes.

For example, a terra address terra172xqaafhz6djy448p32633q4rl7eaz4wqnjn46 uses slip44=330 and cosmos address cosmos1mwwvfu804wcaanz8j78f8h75flxkyjua23kdvw uses slip44=118.

The prefixes can be assume to be the first characters til you find a 1, and thus can be popped off easily, leaving us with the bech32 s ...

Score: 1
weixin0129 avatar
A signing scheme that can be verified by anyone from the group who signed jointly
al flag

Suppose that a set of entities each have public/private key pairs, (P1, S1), (P2, S2), ..., (Pn, Sn).

In a straightforward scenario, a message signed with Si can be verified using Pi.

My question is, is there a way for me to sign a message with {S1...Sn} and the signature can be verified using one of the {P1...Pn}?

Here is my use case:

I have a list of clients, with each I share a key pair with.

In ...

Score: 6
crypt avatar
RSA Signature using SHA-256 is secure?
cn flag

Is following RSA signature scheme secure against forgery and prevents breaking text book RSA?

$$y = \operatorname{SHA-256}(m)$$ $$s = y^d\bmod N$$

where $m$ is message of arbitrary length, $y$ is the 256-bit hash of $m$ computed using SHA-256, $d$ is RSA private key, and $N$ is an RSA modulus with length 2048 or higher?

Score: 0
driewguy avatar
Collision resistance analysis
vn flag

I am learning about collision resistance security notion of hash functions. However, I got confused when collision resistance experiment started using "keyed" hash functions in the experiment (and also in other similar experiments). This is a small extract from Introduction to Modern Cryptography by Katz and Lindell :

The collision finding experiment:
1. A key s is generated by running Gen(1^n).
2. Th ...
Score: 0
James Moffet avatar
Proof of score in a public game with a public contract leaderboard
es flag

Game:

Users stack blocks to form an unstable tower. Each time a new block is successfully laid, the game creates a score_string which is meant as proof of the user's current score. Assume each user has a unique public key that is known to the leaderboard, and that the user can sign their score_string when submitting to the leaderboard contract. Assume the game is running locally on the user's device ...

Score: 1
Problem Solver avatar
Securely sort lists of numbers from two parties
jp flag

I am looking for ways to securely sort two lists of numbers. Yao's millionaire's problem considers each party with one secrete number and compare them securely. Are there papers on extension to this problem where each party has one list of numbers and each party will learn the positions of each element of its list with respect to a concatenated list merged from both parties? One party will not learn the ...

Score: 0
zatg98n4qwsb8heo avatar
Disable/Lengthen FileVault 2 recovery key
es flag

Can I use FileVault 2 without a recovery key? If not, can I disable decryption via the recovery key? Otherwise, can I implement a longer recovery key?

Reasoning: I use passwords that are at least 128-bits strong; soon, I will be migrating to 512-bit passwords for resistance against Grover's algorithm (not necessary for most people). According to Wikipedia, FileVault 2 recovery keys use a 35-charac ...

Score: 0
Tunnel_Vision avatar
What would be the benefits of a fast PRNG that produces an 8-bit output and could pass 1 Peta Byte of the PractRand test?
cn flag

Assuming that all other elements like the internal state of the algorithm are considered secured and very hard to discover from a cryptanalytic standpoint.

How significant would be for the algorithm to be able to pass the PractRand with the specifications mentioned?

Score: 1
Is F' = G(F)) a secure PRF given F and G are secure?
br flag

If we have a secure PRF (, ) and a PRG G where : → × is a secure PRG. Is the PRF F'(k, x) = = ((, )) also secure?

The Stunning Power of Questions

Much of an executive’s workday is spent asking others for information—requesting status updates from a team leader, for example, or questioning a counterpart in a tense negotiation. Yet unlike professionals such as litigators, journalists, and doctors, who are taught how to ask questions as an essential part of their training, few executives think of questioning as a skill that can be honed—or consider how their own answers to questions could make conversations more productive.

That’s a missed opportunity. Questioning is a uniquely powerful tool for unlocking value in organizations: It spurs learning and the exchange of ideas, it fuels innovation and performance improvement, it builds rapport and trust among team members. And it can mitigate business risk by uncovering unforeseen pitfalls and hazards.

For some people, questioning comes easily. Their natural inquisitiveness, emotional intelligence, and ability to read people put the ideal question on the tip of their tongue. But most of us don’t ask enough questions, nor do we pose our inquiries in an optimal way.

The good news is that by asking questions, we naturally improve our emotional intelligence, which in turn makes us better questioners—a virtuous cycle. In this article, we draw on insights from behavioral science research to explore how the way we frame questions and choose to answer our counterparts can influence the outcome of conversations. We offer guidance for choosing the best type, tone, sequence, and framing of questions and for deciding what and how much information to share to reap the most benefit from our interactions, not just for ourselves but for our organizations.