0
votes
1answer
75 views

Why does Fortuna RNG use double SHA-256?

In the paper for Fortuna the authors say that you can use any good digest algorithm (obviously as long as its output is 256 bit) and then they recommend double SHA-256. Why? What's the benefit? What ...
0
votes
2answers
61 views

Decrypting triple DES using 2 keys in crypto tools

I'm currently working on crypto tools to encrypt/decrypt 4 blocks of messages using triple des with 2 keys. So i've reached the final cipher text, but now I have to do the reverse and get the ...
0
votes
2answers
59 views

How to decrypt 3DES in ECB mode (using a wordlist)?

I have some encrypted texts (encrypted with 3DES in ECB mode without salt). My question: How can I decrypt them using a wordlist? (or without one) Example: Encrypted text: ...
0
votes
4answers
157 views

How does TLS generate the shared secret?

From many readings, I got to know that TLS generates master shared secrets using pre-master keys and uses the DH algorithm to generate the shared secret/Master secret. What values during the hello ...
0
votes
1answer
96 views

Non-interactive Zero-knowledge proof signature validation without public key

I'm looking for a method for a scenario with following requirements: At least 3 people (A,B,C,...) are in a Network where they can broadcast messages to everyone but not communicate with a specific ...
0
votes
2answers
94 views

IV/Nonce in CTR&GCM mode of operation

We know reusing IV can compromise our secrecy. I have some questions aiming to clarify the use of an IV/Nonce in CTR/GCM: Is it OK to use the same key for encrypting plain-texts in authenticated ...
0
votes
1answer
73 views

How to determine which type of crypto is used in a text file? [closed]

is there a tool or a way to determine which type of crypto is used in this type of text: ...
0
votes
1answer
51 views

AES CBC encoding of decomposable OAuth2 tokens

We're building a stateless RESTful API that relies on the content of OAuth2 tokens to identify users and what they have access to. Users authenticate with other means and are given a token, which they ...
0
votes
1answer
70 views

Public-Key Deterministic Encryption : Why does not provide perfect security?

I've got a question about an assignment . The question is "Why a Public-Key Deterministic Encryption Algorithm does not provide perfect security ?" . I suppose it means according to Shannon . Any ...
0
votes
1answer
85 views

DES-encrypted cipher

Suppose that you knew that a plaintext was encrypted with DES and consisted only of 16-bit Unicode letters, numerals, and punctuation marks available on a standard English-language QWERTY keyboard. ...
0
votes
1answer
74 views

Why is CBC based on AES malleable in blocks other than the first block?

Perhaps I don't understand the answers to Malleability attacks against encryption without authentication, so trying to be more concrete... please be patient. If I want to change the first block and I ...
0
votes
1answer
66 views

Are the protocols DH-EKE, B-SPEKE, A-EKE, and SRP are considered challenge-response authenticaion mechanisms? [closed]

I got confused which one is considered challenge-response mechanism which one is not.
0
votes
1answer
41 views

Digital Signature with Encryption

Hope it will be clear. I need to digitally sign pieces of information. What I'm currently doing is the following (for each piece of information): Run SHA1 on the information Encrypt the result with ...
0
votes
1answer
115 views

Question about SHA-2 (and potentially similar hashing algorithms)

I have been educating myself recently about the SHA-2 hashing algorithm, and in the midst of this pursuit, I've encountered a question: This algorithm uses a set of constant hexadecimal values, ...
0
votes
1answer
108 views

how do you calculate the private exponent in asymmetric key encryption [duplicate]

Here is an excellent paper on the math of asymmetric key encryption: http://www.mathaware.org/mam/06/Kaliski.pdf‎ See the example on Page 6. The public key = $55$ Primes used to calculate public ...
0
votes
1answer
78 views

frequency analysis substitution

I am trying to find the plain text for the following cipher text using a frequency analysis vr pvst yqlp mq nvf But for the letters above this is really ...
0
votes
1answer
75 views

Testing a steganalysis technique on realistic data [closed]

I'm developing a new image steganalysis technique, and I'd like to test how effective it is in practice. How could I do this? Are there such things as standard "test vectors" for steganalysis?
0
votes
1answer
87 views

Generate random in secure message transfer

I’m doing a school assignment about secure communications between a Server and a Client. Basically, messages are exchanged between the clients and the server and these communications must implement ...
0
votes
1answer
68 views

A replay attack question

Which of the following protocols is susceptible to replay attack :- 1) A -----> B username, password 2) A -----> B username, h(timestamp,password) 3) A -----> B username timestamp, ...
0
votes
1answer
71 views

Enhance CSPRNG output [duplicate]

If I XOR the output from 2 CSPRNG will the result be better (more random) than the output from either one? Assume one of the PRNG is biased.
0
votes
1answer
205 views

Can AES decrypt with a wrong key?

The title is asking the question in layman terms, but what I really mean to ask is this: Let $x \in \lbrace 0,1 \rbrace^{128}$ (an arbitrary input block) and let $K \in \lbrace 0, 1 \rbrace^{128}$ ...
0
votes
1answer
68 views

Authentication using certificateless signature

With traditional PKI approach two parties can communicate with each other in following way Now, How the above approach will be applied using Certificateless Cryptography.? How two parties in two ...
0
votes
1answer
112 views

Tamper-evident audit logs

I want to be able to detect tampering in a log file that is under the control of an untrusted party. I am not interested in secrecy, only the integrity of the contents in the file - so I want to ...
0
votes
1answer
44 views

Asymptotic Hash Function and Concrete Hash Function

I'm reading Collision-Resistant Hashing: Towards Making UOWHFs Practical, and they say that its formalization is non-asymptotic. Why is the formalization non-asymptotic? What is an example of hash ...
0
votes
1answer
80 views

Biometric authentication [closed]

I see in some “Authentication schemes with biometric” papers that those authors wrote a phase as password and biometric update phase. My question is that why we may needs biometric update phase? Is ...
0
votes
1answer
85 views

Security based on PRF

I've seen that there is several kinds of PRF, and sometimes people speak about strong PRFs. When proofs of a protocol or algorithm are given based on the assumption of the use of a PRF, are they ...
0
votes
1answer
72 views

What is the difference between various modes in FPE?

Format preserving encryption has three modes FE1( FFX) , FE2(VAES) , FE3(BPS) . All of them are based on Feistel Networks .Can somebody explain how they differ from each other ?
0
votes
1answer
180 views

Appropriate AES key length for short term protection

Currently I'm doing some initial research for a fully connected distributed network communication model. The context here is a peer-to-peer multiplayer protocol, using a majority-voting system. More ...
0
votes
1answer
124 views

McEliece Public Key Encryption

The definition of Public Key Encryption(PKE) say that: A PKE scheme is a triple of probabilistic polynomial time algorithm (PPT) (Gen,Enc,Dec). The definition of PPT say: In complexity ...
0
votes
1answer
52 views

Hash of multiset of values, which lets me compute the hash of the union

Cryptographic hash functions normally take as input a bitstring. I am looking for a hash function that takes as input a finite multiset of values. In other words, given $S \subset \{0,1\}^*$, I want ...
0
votes
1answer
105 views

DSA generate signature and verify

I'm trying to generate a signature for DSA with the following parameters: $p = 23$ , $q = 11$ , $g = 3$ , $H(m) = 8$ , $x = 5$ for the life of me, I cannot choose a random $k$ ($0 > k > q$) ...
0
votes
1answer
105 views

Is there way to combine secrets first and later split them?

Shamir's Secret Sharing allows a secret to be split into multiple shares so that it can be reconstructed later. Is there a way to do the reverse? Can we combine a few secrets first and later split ...
0
votes
1answer
120 views

Is AES a linear hash?

So, having read a variety of documentations on AES encryption, I came to the unknowledgeable conclusion that the key schedule applied to the array of chunks, and not just the 14 cycles on a single ...
0
votes
1answer
161 views

Encryption algorithms and the “One-Time pad” [duplicate]

I am not well versed in the field but I believe I know the basics. All encryption algorithms that I know of utilize direct data manipulation to encrypt a message (string of bits) such as shifting, ...
0
votes
1answer
821 views

My encryption message system & question about security

I made this small tool for make & read easily an encrypted message without nothing to install, just a simple private key like a word or a couple of words to share. (Without say it directly of ...
0
votes
1answer
67 views

Paillier Crypto System : Pros and Cons? [closed]

Can you please list the pros and cons of the Paillier crypto system you have encountered or found?
0
votes
1answer
55 views

What makes adaptive memory attack difficult for the adversary?

On page 11, definition 2 of "Simultaneous Hardcore Bits and Cryptography Against Memory Attacks", the paper outlines the following steps (PK,SK) public key and secret key are generated by defender ...
0
votes
2answers
85 views

Create a field in PBC

Edited (I removed the emphasize on Integers): My question is partly cryptography and partly programming, I would appreciate any help on any aspect of it :) I want to use PBC library to do the ...
0
votes
1answer
71 views

Different patterns of different paterns, wildcard [closed]

I'm not realy experienced with programming and such but I am wondering if the following could be implemented in, lets say, python we have the following ciphertext sequence ...
0
votes
1answer
78 views

Best hash size for hash trees

I want to know if having a 8-byte hash value is better than 16-byte hash value for use within hash trees. My mind tells me that the shorter the hash value, the better. But doesn't a smaller hash ...
0
votes
2answers
148 views

How is SSL secure from rogue Certificate Authorities?

There's one thing that I've never quite understood about SSL (which perhaps means I don't understand SSL at all): how is SSL secure from rogue Certificate Authorities? This is probably best ...
0
votes
1answer
115 views

Which areas in CS will be (or have been) most affected by fully homomorphic cryptography?

I'm in the middle of planning a 5000ish word essay on fully homomorphic cryptography, the current practical implementations and their limitations. Which areas of CS as a subject have been (or will ...
0
votes
1answer
72 views

Encrypting a broadcast channel

We're building a data service that is expected to go out through a single "fat pipe" channel. The design requirement says that the data in the channel must be protected by authentication and ...
0
votes
1answer
144 views

RSA - Ecrypting the same data with the same public key = same ciphertext?

If an adversary knows my public key and guesses what was my plaintext, can he test for it somehow? The most obvious way is encrypting the guessed plaintext with my public key and the same parameters ...
0
votes
1answer
60 views

PBKDF2 when dkLen and hLen have the same size

I was reading RFC 2898 and something is not clear to me. When I use PBKDF2 with SHA-256 and I want a derived key with length 32 bytes (the same length as my hash function output), your derived key ...
0
votes
1answer
519 views

GPG vs PGP vs OpenSSH and management of them

What is the main difference of the three? Can I use only one of them for everything (e.g. GPG for SSH authentication) If I encrypt my private key with a pass-phrase, is it strong enough so that if ...
0
votes
1answer
59 views

Is it possible to create a Bilinear Function with Already Assigned “Multiplicative” Input Groups?

Assume that we have an already assigned Multiplicative Cyclic Group $\mathbb Z_p^*$ with order $q=p-1$, and $p$ is a prime number, is it possible to create a bilinear function $\hat{e}: \mathbb Z_p^* ...
0
votes
2answers
198 views

Computational indistinguishability and example of non polynomial algorithm

The wikipedia page on computational indistinguishability says that two ensembles are not distinguishable if "any non-uniform probabilistic polynomial time algorithm A" cannot tell them apart. To help ...
0
votes
1answer
71 views

RSA Certificate Owner and Issuer line meanings?

Apologies if this question is not in the right place. I've recently been looking through some RSA certificates ( specifically, Android apk .rsa files) and I'm having trouble deciphering the one and ...
0
votes
1answer
167 views

Request for 1024-bit primes $p$ , subgroup $q$ and subgroup generator $g$

I need to find a prime $p$ of $1024$ bits with a $160$ bit sub group size $q$, such that $q|p-1$ , and $g$ is the generator of the sub group size $q$. I'm looking for the numeric values of $p$ , $q$ ...

15 30 50 per page