6
votes
1answer
227 views

What is “witness encryption”?

I recently skimmed over tho papers on time-lock encryption: “Time-release Protocol from Bitcoin and Witness Encryption for SAT” by Liu, Garcia, and Ryan “How to Build Time-Lock Encryption” by Jager ...
-1
votes
1answer
27 views

Relationship between an elements order and the DLP [closed]

How can I use these properties to attack the DHKE? I know that the order of $a$ is always $2$ for $a = P - 1$ in $Z_p$. The subgroups generated by a will be $\{1,a\}$.
4
votes
2answers
137 views

Turning a 64 bit block cipher into a 128 bit block cipher

There are quite a few block cipher modes of operation that require 128 bits. There are also modes of operation where a higher block size than 128, e.g. a block size of 256 bit would even be practical. ...
2
votes
2answers
111 views

3DES over Galois Counter Mode (GCM) for authenticated encryption

Is it possible to use DES or 3DES over Galois Counter Mode (GCM) to provide authenticated encryption? I haven't seen any implementation yet.
0
votes
1answer
62 views

Encrypt a file for multiple persons with different keys?

I thought a problem and want to ask if there's a more elegant solution. The scenario: A company with a fileserver, which hosts encrypted documents. The files need to be accessible by about a dozen ...
1
vote
1answer
141 views

Session key Exchange, some doubt

I have to find a solution to this problem: I have a network composed by 1 server and some client. The server has a couple of keys (public and private) and it shares a secret key with each client. My ...
1
vote
2answers
86 views

Concerns about use of MAC in my specification

Here is the pseudocode for a routine I am designing: ...
5
votes
1answer
1k views

What are the differences between collision attack and birthday attack?

From my understanding both types of attack, collision and birthday, are based on the principle of two randomly/pseudo-randomly chosen plaintext to hash to the same value. I don't want to launch any ...
5
votes
1answer
743 views

what are the advatanges and disavantages of the digital signature algorithms for JWT?

I am using a Java JWT library jose4j. There is a list of digital signatures algorithms which can be used. HMAC using SHA-2 RSASSA-PKCS1-V1_5 Digital Signatures with with SHA-2 Elliptic Curve Digital ...
0
votes
1answer
69 views

Encryption(AES) and verification per message

I want to send/receive messages with A (an peer) using TCP socket. I want to encrypt messages using AES CBC. Only I and A know a symmetric key K1 used in AES CBC, and K2 used in HMAC. The size of each ...
1
vote
0answers
27 views

Compromised Issuing CA [closed]

I'm configuring a PKI infrastructure with an offline root CA and several issuing CAs. Among other topics, I'm struggling to decide how the revokation of an Issuing CA certificate works. My Root CA ...
9
votes
2answers
134 views

Why develop Edward curve formulas that deviate from unification?

Edward curves were considered initially because they provide a unified formula for both doubling and addition, thus having inherent side-channel resistance. But a lot of work has been done recently ...
0
votes
1answer
62 views

is this possible to use asymmetric encryption schemes as order preserving encryption

Are we able to use order preserving encryption in asymmetric schemes, is this work efficiently. is this secure at any one of the situations
-2
votes
2answers
74 views

How can complexity be increased or decreased in AES?

I have been studying data compression for a while. For educational purposes, after a lot of reading, I managed to create a software that performs encryption and authentication using AES256-GCM. ...
1
vote
0answers
31 views

Voting protocol - How many dishonest tallying centres can the protocol cope with?

We have the voting protocol that is described here. I am looking at the following exercise: Determine how many dishonest tallying centres the protocol can cope with before the following properties ...
2
votes
1answer
50 views

Establish Trust By Signing Random Seed

I'm trying to get my server to establish trust with a client. Neither is on the Internet, so there are no certificate authorities. The typical way to establish trust in my domain is for a client to ...
0
votes
1answer
72 views

What does the acronym “CRT” stand for in the PKCS #1 specification?

What does the acronym "CRT" stand for in the PKCS #1 specification? Does it stand for "Chinese Remainder Theorem"? Thanks, Pete
0
votes
1answer
595 views

What's the structure of server-key-exchange message during TLS handshake

Here is a relevant question: With OpenSSL and ECDHE, how to show the actual curve being used? Using ...
3
votes
1answer
126 views

Proof that two parties can communicate

Suppose we have three parties, Alice, Bob, and Carol. Alice can receive messages from Bob and Carol individually, but can only send messages to both simultaneously. Additionally, Alice cannot tell if ...
2
votes
1answer
112 views

Can I use an ECDH Shared Secret from the same Private / Public Key Pair?

I'd like to know if using the ECDH shared secret of a static EC Private Key with it's own corresponding static EC Public Key causes a problem / weakness. (edit) not asking if it's ok to re-use the ...
0
votes
1answer
216 views

How HMAC.Update function works?

I know how standard HMAC(key,msg) function works, and I want to write a Delphi port of HMAC class that implements Update function. The problem is that I don't understand how this Update function works ...
18
votes
3answers
7k views

SHA512 faster than SHA256?

I'm getting this strange result that SHA512 is around 50% faster than SHA256. I'm using .net's SHA512Managed and SHA256Managed ...
0
votes
1answer
135 views

What is difference between Cryptographic Transformation, Encryption and Hash? [duplicate]

I read in a book that: let $f(K,R)$ is cryptographic transformation of $R$ using $K$, $K\{R\}$ means $R$ is encrypted using $K$ and $h\{R\}$ is the hash of $R$ and then the example follows. I want to ...
5
votes
1answer
207 views

How to generate own secure elliptic curves?

I know that the algorithm used to generate the Brainpool curves and the NIST curves is published. The algorithm should be this one (RFC5639 Appendix A). From what it looks like it's rather slow to ...
5
votes
1answer
125 views

EC: Why does $h>200$ need to hold?

From BSI-TR-03111 (PDF), on page 15: The class number of the principal order belonging to the endomorphism ring of E SHOULD be at least 200. This value commonly is referred to as $h$ in that ...
3
votes
1answer
163 views

What are the differences between the elliptic curve equations?

I think we're all aware of the "classical" Weierstrass (short?) elliptic curve equation: $y^2\equiv x^3 + ax +b \pmod p$. Well known examples of these curves include the NIST's and Brainpool ones. ...
1
vote
1answer
75 views

Period of pseudo random sequence generated from (5, 2, 0) LFSR

I was reading about the Linear Feedback Shift Registers and I am confused about the technique to find the period of a primitive polynomial. Consider the polynomial $x^5 + x^2 + 1$. As this is a ...
4
votes
2answers
100 views

Brute-force attack given multiple hash prefixes

(Context: I'm auditing some code which I suspect to be insecure, but I'd like to be able to quantify this.) Suppose you have a 56-bit secret key ($secret), and ...
0
votes
2answers
43 views

Securely start a client server connection without ssl/tls [closed]

NOTE: Pardon my ignorance of encryption, I learned about these concepts today Going to rephrase this question, but I think I already have fine answers provided. I need to have a block of data ...
2
votes
1answer
57 views

Compression in Symmetric-Encryption?

When using symmetric encryption is it important to compress the data first? I think that compression will make data look "more random" and this might help the ciphertext be harder to crack but I am ...
1
vote
0answers
43 views

Digital signature in a group chat scenario?

I understand that RSA is great for 1-to-1 digital signature. In the group chat of N people, other than storing and maintaining N public keys, is there a simpler way of authenticating each and everyone ...
0
votes
2answers
62 views

Get AES key from client request

I get a request from a client who encrypts the message with the wrong AES key. Is there a way for me to know what AES key the client actually used? I understand I may get the decrypted msg which is ...
1
vote
3answers
259 views

How to quickly detect incorrect password in encrypted file without compromising security?

I am developing a software to encrypt/decrypt files/streams using symmetrical encryption algorithm. During encryption phase data wil be compressed and encrypted. When decrypting data, I want to be ...
0
votes
1answer
244 views

Why does rsyncrypto require a public key during decryption?

I recently came across a project called rsyncrypto that sacrifices some security so that you can have rsync-friendly files. My understanding is that it works by generating a symmetric key for each ...
3
votes
1answer
123 views

Doubling a point on an elliptic curve

I'm working with the elliptic curve $\mathcal{E} : y^2 = x^3 + 11x^2 + 17x + 25$ over $(\mathbb{Z}_{31},+,\cdot)$ and am trying to double $P=[2,7]$. Following the instructions here, I'm doing the ...
5
votes
2answers
295 views

An electronic voting system

This semester I am taking the course Cryptography. I will have a presentation about the topic "Voting Scheme". I am preparing myself by reading from the book “Cryptography : an Introduction” by ...
1
vote
1answer
324 views

Supersingular Isogeny Key Exchange Software [closed]

Are there any optimised implementations of the Supersingular Isogeny Key Exchange by Defeo, Jao, and Plut. It seems like this would be a great drop-in replacement for Diffie-Hellman in both OpenSSL ...
3
votes
2answers
171 views

Meaning of entropy of a bitstring in NIST SP 800 - 90A

From NIST SP 800 - 90A from January 2012 (see http://csrc.nist.gov/publications/nistpubs/800-90A/SP800-90A.pdf), page 6: For the purposes of this Recommendation, an n-bit string is said to have ...
1
vote
1answer
59 views

Why does UMAC encrypt the output of universal hash function?

UMAC uses a key to choose a random hash function from a family of universal hash functions. The value of the hash function is always encrypted using yet another key, and the resulting ciphertext ...
0
votes
0answers
20 views

CMSS key sizes flexiprovider

I am study the implementation of the Coronado Merkle Signature Scheme using flexiprovider. I want to verify the Table 1 of its paper. Using the flexiprovider, I have written a example for ...
0
votes
0answers
99 views

secure multi party protocol for multiplication

I started to learn secure multiplication protocol with oblivious transfer. And i came up with this question, Design a secure 2-bit multiplication involving 4 parties? Can any one suggest an answer for ...
-1
votes
1answer
83 views

Safe way to generate different encrypted output from the “same” plaintext

Imagine I want to send imaginary defcon levels to another party over the internet. I know there are good protocols for this like SSL, but lets say I only have a blackbox tool where I can input an AES ...
1
vote
1answer
76 views

Distinguishing between two probabilities and the uniform probability

Say I have a polynomial adversary $A$ that can distinguish with a non-negligible adventage between $x$ generated from a probability $X$ and $y$ generated from a probability $Y$. Obviously, this ...
1
vote
1answer
98 views

On countermeasures for replay attacks. Does this one require plaint text password storage?

I was reading this wiki section on the countermeasures against replay attacks and it basically suggests that: If Bob wants to confirm Alice's identity he can send a one-time token (I think it should ...
2
votes
0answers
57 views

Convolution and catastrophic codes

i'm reading the article of Massey and Sain (here) and i cannot unserstand - what is "foreforward inversion"? I mean There is a description of circles in convolutional codes and a little bit ...
3
votes
1answer
156 views

Is there a scheme that allows to use RSA based challenge response protocol limited to signing only 8 bytes to create a secure signature of any data?

I have a tiny device that has a challenge-response authentication mechanism where the device signs 8 bytes of any data with it's internal 2048 bit RSA key. I would like to be able to certify any data ...
1
vote
2answers
53 views

Definition of indistinguishable schemes

Let $\mathsf{Exp}_{A,\Pi}(\lambda)$ be some indistinguishability experiment that finally outputs 1 if A outputs $b'$ that satisfies $b' = b$, otherwise 0. Then the textbooks often define the security ...
3
votes
1answer
129 views

Can we reduce Diffie-Hellman problem to “Discrete-log inversion” problem?

Let $G$ be a cyclic multiplicative group of order $n$. Let $g$ be a (public) generator of $G$. The Diffie-Hellman (DH) problem asks: Given $g^x, g^y\in G$ for $x, y\in \mathbb{Z}^*_n$, to compute ...
0
votes
1answer
163 views

Encryption of exe file

I recently started learning cryptography. I have learned some basic stuff. I'm also started learning about pc security, so I was wondering how do hackers use cryptography for bypassing antivirus ...
2
votes
2answers
196 views

RSA private key d knowing e,n

I need to find RSA private key $(d, N)$ knowing $(e, N)$. It's "own" RSA implementation. As i know $p$ is random 70 bit number, then $q$ is $p-2^{10} < q < p+2^{10}$ $d$ is max 16 bit long with ...

15 30 50 per page