# All Questions

832 views

### Is there benefit to signing unencrypted emails?

I came to this article from another comment on Crypto StackExchange. After reading it, I am wondering if there is any benefit to using a digital signature on unencrypted S/MIME emails?
586 views

### Vigenere ciphertext encrypted with another vigenere cipher

I have been learning about Vigenere ciphers and then thought of this scenario: if a cryptographer encrypts a plaintext English message with a Vigenere cipher and then another cryptographer, who wants ...
91 views

### See any problems with this search-specific homomorphic encoding strategy?

I'm imagining this for use in the scenario of cloud-stored client-encrypted email, where, when seeking to do a string search across messages, you don't want to have to download every stored message in ...
53 views

### Hash function and indifferentiability [closed]

What are the properties derived from the fact that a hash function is indifferentiable from a random oracle?
77 views

### Keccak and compression functions

Keccak follows a sponge construction. Can we say that Keccak employs a compression function? Generally speaking, for sponge constructions, can we say that there is an underlying compression function? ...
106 views

### Cipher built from GPU primitives [closed]

Is it feasible to build a cipher (or hash) out of GPU or DSP primitives (e.g. big matrix multiplication, Fast Fourier Transform, big block SIMD, or hardware H.264/AVC codec)? Preferably those are slow ...
130 views

### Does brute force attack use the program that created the ciphertext?

I've read several articles about brute force cryptanalytic attacks, but none explicitly say what algorithm is being run for each attempt, nor what criteria is used to declare an attempt a success or a ...
189 views

### Is deniable error-correction possible?

This question came up as I tried to answer an earlier question I asked: cryptographic data structure wanted: sparse array without membership test. I still have not resolved that question to my ...
108 views

### Determining average number of hash calls to get a hash that begins with X

I have been attempting to find an answer to a self-study question: If I have a hash algorithm that outputs 256 binary bits, on average, how many times would I have to call the hash function so ...
146 views

### Roots of polynomial in Shamir secret sharing

I need to know whether one can obtain any roots of the polynomial in Shamir secret sharing if he possesses less than threshold shares. For instance in (t,n) if he has t-1 shares can he obtain any ...
53 views

### Are there any obvious techncial faults in F. Ruiz's 2013 URSA javascript cryptography? [closed]

The link to the cryptography is here: http://prgomez.com/ursa/ I have found the following simple javascript system of encryption/decryption portable and easy to use for emails and messaging sites, ...
103 views

### EC Public Key length in ASN.1 DER

I have two X.509 certificates in DER format. A: ...
234 views

### Reusing message in One Time Pad

One of the main rules of the OTP is, that a key should never ever be reused. But if we use some commutative operation (XOR for example) for generating the cipher text, then I don't see any difference ...
47 views

### Group Dependent Language

The text below has been taken from the below paper Groth-Sahai Paper. The relevant part is highlighted in red. What does this group-dependent language mean in this context? From the definition of a ...
134 views

### What is the (uncompressed) x,y-representation of a curve point on the P-256 NIST elliptic curve?

I am trying to understand the FIDO U2F Raw Message Format, especially the format in which a user public key should be provided. The documentation says the following: A user public key [65 bytes]. ...
64 views

### Don't Understand these Parameters

I don't understand section 3 of the paper Fully Homomorphic Encryption over the Integers. How can one calculate these paramters and make these equations in pictures into code?
86 views

### Brute Force Attack Strategies

A Brute Force Attack obviously involves attempting to decrypt ciphertext (with the associated plaintext being known) using all possible encryption keys. Aside from attempting all possible ...
34 views

### impersonating attack against a protocol

recently I'm reading Efficient eCK-secure Authenticated Key Exchange Protocols in the Standard Model, and I sense that the scheme in the following(the reader can refer to the paper for details) is ...
130 views

### What is “msg = group.random(GT)” in Charm encryption schemes?

In many encryption schemes in Charm the random group message is used instead of a text-message: msg = group.random(GT) For example, in CP-ABE scheme, random ...
204 views

### Strategy to crack a presumed substitution cipher

The ciphertext given is: ejitp spawa qleji taiul rtwll rflrl laoat wsqqj atgac kthls iraoa twlpl qjatw jufrh lhuts qataq itats aittk stqfj cae I've done ...
20 views

### Ability to locate free sectors on an encrypted volume

I am trying to understand, generally how could this be a security issue ? Assuming the volume's backing media has this weakness (lets say an NTFS sparse file based TrueCrypt container) what could the ...
85 views

### Basic question about design of program with data encryption

I need to store encrypted files on a hard disk. The actual code side is not important for me now (I plan to use C# and AES-GCM encryption from Bouncy Castle library, please tell me if you think that's ...
80 views

### Problem understanding the construction of block cipher distinguishers

I know a block cipher distinguisher is an algorithm which can predict with high probability whether a system is a random permutation or a block cipher by asking a few queries to the system. My ...
178 views

### what is the difference between IBE and ABE schemes

Can somebody explain in simple words. real life example light help and limitations of these schemes etc.
81 views

### Montgomery Multiplication in FPGA explanation

I'm trying to implement an RSA module in a FPGA. I choose to use Montgomery multiplication. I've found a document where the Montgomery Multiplication is pretty clear. I don't understand only a step. ...
98 views

235 views

### Cryptographic data structure: sparse array without membership test

I would like a data structure supporting two operations: $\mathsf{set}(k,v)$ and $\mathsf{get}(k)$, with the following properties: $k$ can be any number between $0$ and something impressively large, ...
149 views

### For calculating the index of coincidence for each sequence

I was learning about the finding the key length reading the following web site... http://practicalcryptography.com/cryptanalysis/stochastic-searching/cryptanalysis-vigenere-cipher/ and I really don't ...
73 views

### Checking the share membership in secret sharing schemes

I was thinking of this since yesterday. Imagine, a secret is split into its respective shares (using any secret sharing scheme) with threshold $t$ and total $n$. Can we find out given any random ...
67 views

### Is elliptic curve point multiplication semantically secure?

Is elliptic curve point multiplication semantically secure? I'd like to know if there are some sets of elliptic curve parameters (e.g. NIST curves) that are proved to be semantically secure or that ...