# All Questions

35 views

### How to encrypt letters less than block n using Hill Cipher

I am learning about Hill Cipher and know that it is a block cipher where each block of n letters (considered as an n-component vector) is multiplied by an invertible n × n matrix, again modulus 26. ...
58 views

### Is it safe to derive a password from a signature provided by ssh-agent?

I'd like to use a password-based system on a remote host (accessed via SSH) without having to copy-and-paste the password and without storing it on disk. Using the system with some other form of ...
44 views

### Does NSS fully implement PKCS 11?

I am looking towards using NSS in a Linux application that makes use of a TPM (HSM). So, I am checking the support of PKCS 11 in NSS, at least for the management of Elliptic Curve keys, signature with ...
69 views

### What does “nonlinear mapping” mean?

Page 15 of the Keccak reference (PDF) explains that the $Chi$ step mapping of the Keccak-f permutation in Keccak is defined to be “nonlinear mapping”. Without this, the complete permutation would be ...
71 views

### If a cipher has key length shorter than plaintext, then it is not perfectly secure

I am trying to verify the statement above. So far I only know that a One-Time-Pad is the only “perfectly secure” cipher. It has a key length which is exactly the same as the plaintext. I think the ...
33 views

### FEAL-4 Wrong outputs of Round Functions

On page 2 of this article, there is example of FEAL-4. At round 2, the input to F (Round Function) is 0x80800000. As F accepts only 4 bytes I divide the input by 2 so that (As I assume the result ...
60 views

### Which mathematical operations does secp256k1 point multiplication use?

To convert a bitcoin private key to a public key, the secp256k1 point multiplication math is used. Could I – theoretically – convert a private key to a public key just using the four arithmetic ...
41 views

### Serpent Cipher 128bits (Example rounds on any plaintext/key)

Is there are any possibility to see trace(example) of Serpent Encryption/Decryption on concrete plaintext/key example, (not code implementation) or at least animation of steps. During reading of ...
65 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]. ...
33 views

### Plaintext-aware encryption for symmetric schemes?

The notion of plaintext-awareness is well-known for asymmetric encryption, but the notion seems to make sense for symmetric encryption as well. Is this a known concept?
46 views

### exchanging private key between service and iPhone app - digital signing

I need to do digital signing of my request data which will be sent to the server. My server sends distinct private keys to her clients after authentication and expects all responses to be digitally ...
42 views

### Does Ciphertext policy ABE support search operation on encrypted data

Basically CP-ABE (or attribute based encryption) allows end-users to encrypt the data with desired access control structure. I was investigating the how to do keyword-search on encrypted data given ...
85 views

### Is it possible (how difficult) to find MORE than one valid RSA signature?

Is it possible (how difficult) to find more than one valid RSA signatures for a given message m (after padded) and a public key ...
57 views

### Engima machine decoding with PC and GPU

I saw this answer at this site about decoding a 3-rotor Engima machine's settings: How cryptographically secure was the original WW2 Enigma machine, from a modern viewpoint? And did some math for ...
50 views

### Understanding the FMS attack on WEP

I am trying to implement the Fluhrer, Mantin and Shamir attack, one of the ways to break WEP. I seem to have hit on a problem. I have no idea whether or not it is a programming error, or if I don't ...
69 views

### Chi-Squared Step of Vigenere Cipher Decryption

So, I have been assigned an assignment where I had to solve a Vigenere cipher. Following along with this webpage I managed to get all the way to the chi-squared step. But, that is the problem. Upon ...
51 views

### What does “G2” mean when used with X509 certficates and certificate authorities?

For example "Google Internet Authority G2"?. I thought it was another way of specifying Class 2 (for organizations, for which proof of identity is required) but then see certificates such as "VeriSign ...
55 views

### Privacy-Preserving Protocols and Proofs of Security

While dabbling in privacy-preserving protocols (mainly using Semi-Homomorphic Encryption) and coming up with miscellaneous ideas for comparison tests or other similar primitives, based on obfuscation ...
71 views

### DES S-Box properties

Two of the properties that lead to the design of DES S-Boxes are: 1)For any non-zero 6-bit difference between inputs, no more than 8 of the 32 pairs of inputs exhibiting that difference may result ...
43 views

### Elliptic curves in java

I am writing you because I want to implement the DPS signature with elliptic curves in Java. I found this library http://docs.oracle.com/javase/7/docs/api/java/security/spec/package-summary.html which ...
26 views

### ECIES: Purpose of optional shared information?

According to Wikipedia the ECIES algorithm has two optional shared information $S_1$ and $S_2$. They are used as follows: Generate a random shared secret $Z$ according to ECIES, which will never be ...
34 views

### What is the restriction on k, for the kth composite residuosity problem to be hard

This paper considers the exponent to be an odd integer. When k = 2, it is called the quadratic residuosity problem (mod n where n is composite) which is hard and can be solved if the factorization of ...
85 views

### Complexity of verifying OTP secret

What is the minimum number of unique pairs of digests and inputs to a one-time pass needed to verify that a secret is equal to a ...
71 views

### Are partial hashes used in cryptographic protocols?

In my question (and answer) about a partial hash code used within a signature application I found out that partial hash codes are sometimes used within protocols with a relatively restricted security ...
52 views

### How to distribute symmetric key between $n$ entities?

If there are $n$ servers for broadcasting a symmetric key in such a manner that following holds: No server alone can find the key $K$ alone. Any two servers can pass $k_i$ and $k_j$ such that ...
55 views

### Type G Bilinear Pairings

I was reading PBC and its implementations for finding pairing parameters. I am particularly interested in implementing a BLS signature scheme with 20-byte (160-bit) signatures ("short signatures"). ...
53 views

### Groth-Sahai proofs and hardness assumptions

I am learning Groth-Sahai NIZK proof system for Bilinear groups. While going through the literature, I am getting confused on how the proof system is related to Subspace Decision, SXDH or DLIN ...
75 views

### ECC cryptography with shorter signature when not needing high security?

I am new here and fairly new to cryptography, so if I say something wrong, let me know. I am trying to set up a system where a user can receive a temporary license key over the phone, put it into ...
44 views

### IND-CCA2 secure schemes without Plaintext Awareness?

I have been reading up on IND-CCA2 security and was wondering: Are there efficient IND-CCA2 secure schemes that do not require plaintext awareness? I'm guessing yes - could someone point me to these ...
85 views

### Hardware Implementation of Pairing over BN curves

I am in the middle of FPGA based Hardware architecture design for the computation of Pairing (particularly R-ate Pairing) over BN curves. Where, the point addition, and point doubling should be ...
58 views

### Algebraic Normal Form Piccolo

I'm trying to verify the claim of paper Improved Algebraic Fault Analysis: A Case Study on Piccolo and with Applications to other Lightweight Block Ciphers about the numbers of equations in algebraic ...
74 views

### Universal hashing techniques based on matrix multiplication

The article here says below, about a universal hashing technique based on matrix multiplications. "However, there is a little known method based on using a random matrix. It has lots of advantages - ...
82 views

### A question about elliptic curves and finite fields in bilinear pairings

Based on what mentioned in the paper "Pairings For Cryptographers" http://www.sciencedirect.com/science/article/pii/S0166218X08000449 the two inputs of a pairing map are two members of two additive ...
70 views

### How does AES-CCM work in BitLocker?

I'm studying this white-paper: http://jessekornblum.com/publications/di09.pdf The author says that using AES-CCM with the external key (highlighted in green at page 9, figure 4) and with the nonce at ...
97 views

### Convergent encryption has dictionary attack, but why hash function doesn't?

Convergent encryption (CE), $E_k(d)$, is a way to encrypt the data $d$, with the characteristic that the encryption key $k$ is $k=h(d)$, where $h(\cdot)$ is a cryptographic hash function. Consider a ...
50 views

53 views

### Mutual authentication with Public Key and session Key

I am trying to understand two protocols for mutual authentication and if they are secure or not. $K$ is the session key, and it's calculated $k=H(TimeStamp)$. Are the following both cases secure? ...
130 views

### Commutative Encryption with RSA scheme?

I wanted to know how I could manage to do what I'm going to tell you next, with the RSA encryption/decryption scheme. So Alice and Bob each have a public key $(n, e)$ and a private key $(p, q, d)$; ...
49 views

### Autocorrelation in Autokey

I know that Vigenère can broken using auto-correlation (as explained at cryptool-online.org). Now my question is: Why does this also work with autokey (tested it using crypttool)? To prove that I ...
69 views

### Bilinear pairing

I am working on Efficient Construction of Pairings which are being realized by Miller's algorithm. In this algorithm the basic steps are point doubling and line function computation point addition ...
178 views

### Secure Secret sharing

I'm trying to come up with a new way to do oblivious transfer that is faster and requires less computation than existing methods. The basis of my method is shamir secret sharing. Below is an example ...