# All Questions

32 views

### how many pairs of plaintext-ciphertext are needed before we break AES? [duplicate]

Imagine a set of words ($plaintext$) each are encrypted using AES-ECB mode and due to some leakage in the system an attacker could gain access to some pairs of $plaintext$ and $ciphertext$. But once ...
63 views

### How can I calculate the probability of collisions of a hashing algorithm?

I'm pulling a “Dave” and I'm designing my own hashing algorithm. Not that I intend to use it, I'm not certifiable or anything, I just want the challenge of creating something. I'm not going to get ...
109 views

### How can I compare two hash algorithms?

In studying the algorithms of cryptographic hash functions, I have tried out a few (educated) modifications to the code for academic purposes only. For example, I modified the algorithm by applying an ...
71 views

### How do we generate AES S-BOX?

I am new to AES and I am too much confused about the generation of S-box in AES. I don't have any idea of $GF(2)^8$ field and how the things are happening around. Please answer this question with a ...
22 views

### Defining correct secured channel from endpoint to server

I'm new to cryptography and have a question regarding encryption usage. The scenario is as follows: I have an endpoint hardware device (CPU - ARM A7 1.2 ghz) which runs Ubuntu 14.04. This hardware ...
36 views

### Signatures with Hybrid Encryption

Typically, in public-key settings, sign-then-encrypt has been used to provide confidentiality and integrity. However, most public-key cryptosystems use hybrid encryption. I've been searching around ...
49 views

### Public key of a split key without calculating private key

I am searching for a secret splitting scheme where the private key doesn't exist, since each party chooses their own secrets. The other parties should however still be able to calculate the public ...
21 views

### How to change radix in FFX

http://csrc.nist.gov/groups/ST/toolkit/BCM/documents/proposedmodes/ffx/ffx-spec.pdf tells me that radix should be an arbitrary input determined by the user. However, I do not understand how this ...
25 views

### How to reconstruct hash value to the original format? [duplicate]

I would like to know how I can reconstruct a hash value such as 558f68181d2b0c9d57d41ce7aa36b71d9 to its original format (734). I have used a code in matlab, which provided me with an hash output, ...
41 views

### RSA Encryption: What happens if n is a factor of the message M? [duplicate]

From what I have learned about RSA encryption, the message M and the modulo n must be coprime because Euler's theorem only holds for coprime numbers? for example, what happens if I choose p = 3, q = ...
18 views

### Cryptanalysis on two time pad ciphers? [duplicate]

One time pad ciphers are unbreakable if the message is encrypted correctly and if only used once. However if used more than once, it becomes decipherable. How come? Also, would it be smart to use one ...
30 views

### Implementation of digit serial rotators for SIMON cipher?

I am working on architecture of SIMON cipher where I have to use either bit serial, parallel or digit serial to implement the algorithm for each round function and also for sub-key generation. So I ...
9 views

### Does we need IV if we're generating a new Symmetric key for every message? [duplicate]

We need to encrypt individual messages, for every message we: Generate a new AES key Encrypt the message with the key (AES/CBC/PKCS5Padding) Encrypt the symmetric key with with a public key ...
49 views

### Identification schemes: Okamoto

I am reading Cryptography theory and practice by Stinson. The book is talking about the proof of security of Schnorr and Okamoto schemes. It claims that if an impersonater can find (in the case of the ...
54 views

### how to implement order preserving encryption except cryptdb

Which cryptographic algorithm is suitable for implementing order preserving encryption with out using cryptdb
35 views

### implementation of digit serial architecture

I am working on architecture of SIMON cipher where I have to use either bit serial, parallel or digit serial to implement the algorithm for each round function and also for sub-key generation. So I ...
78 views

### Multiplicative inverse ($17^{-1} \mod 31$)?

So. Sorry for bothering you with such a simple question, but I can't really get this done. It's just an exam question in which I need to use CRT in order to calculate the RSA signature of a msg ...
31 views

### Encrypt with K1, K2 and decrypt in opposite with K2, K1 [duplicate]

When using symmetric cipher, does the following statement holds: E(x, k) means encrypting x with key k in ECB mode ...
79 views

### RSA-PSS salt size in certificate

In RFC 4055, the signature RSAPSS algorithm has the following ASN 1 parameters: ...
51 views

### one complex password as a “seed” for localy generated per-service passwords

I've stumbled upon a project that suggests a way of having to remember one password, from which a “per-service password” could be generated by salting the service name using scrypt. What could be a ...
17 views

### PK systems using groups in practice

The four Public-key cryptosystems: RSA, ElGamel, DH, and Rabin (all with others) all require some group operations in an integer field or multiplication group of some residue classes. When it comes ...
20 views

### RSA: If I sign the same digest with same key twice, will the signatures be identical? [duplicate]

If I don't have public keys to verify the signature, can I use this to discover that two signing services are using the same key? Can you send a reference?
35 views

### Establish authentication

I have designed a basic authentication scheme where two nodes will mutually authenticate that other holds a shared secret. I have very limited RAM/ROM (its on uC) and bandwidth. Here it goes: ...
51 views

### Type of values that can be accumulated in bilinear map (multiplicative) accumulator reg.

Is there any restriction that the members to be accumulated in bilinear map (multiplicative) accumulator need to be relatively prime to P? Where P is the order of group.
85 views

### What is the danger if a non-prime is chosen for RSA? [duplicate]

I was reading this question about generating primes for RSA keys. The answers point out that most implementations of of the algorithm use probabilistic prime-ness checking algorithms. The answer by ...
70 views

### Side channel attack on FPGA AES engine

I actually don't know if this is the right place where ask, but I try. The side channel attacks aren't a negligible problem. There are several ways to protect from these attacks its own IP inside the ...
67 views

### What is more efficient, pairing based cryptography or non pairing based cryptography? [closed]

As far as I know non pairing pairing based cryptography is less time consuming than pairing based because, pairing based uses complex operations. Are there any advantages of pairing based cryptography ...
59 views

### SSH rekey security implications

When an SSH session is rekeyed due to either the time limit or data limit for rekeying having passed, does the Diffie-Hellman exchange take place within the encrypted channel provided by the existing ...
9 views

### What is search space of this problem? [duplicate]

I have an exam and i have no time to solve this problem(I think about it a lot but i do not solve it).please help me and solve it for me: $A$ is a random number and has $512$ bits.We make $B$ ...
58 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
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 ...
77 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 ...
43 views

### Cryptanalysis and Copying encrypted volumes

I just recently concerned myself with cryptography due to Snowden's revelations and there are a few things I cannot really wrap my head around but maybe you can help me with that. I am not a ...
41 views

### Join Datasets While Protecting Anonymity

I've run into this issue a couple of times in my career. I'll see if I can explain with an example (please ignore the fact that this is implausible in the real-world). Suppose I sell computers, and I ...
71 views

### Can a combination of encryption algorithms weaken the overall encryption?

Are there any instances where a combination of industry standard encryption algorithms can weaken the overall encryption of the data? As a Naive example using non-standard encryption algorithms, ...
64 views

### Understanding the PRINCE cipher linear layer

I am struggling to understand how to implement the PRINCE cipher linear layer. (https://eprint.iacr.org/2012/529.pdf) From my understanding I need to multiply the state with M, and with M' in between ...
41 views

### How to find an impossible differential?

Given an arbitrary SPN-based cipher with X rounds. How to find an impossible differential for this cipher? What are strategies to find one?
63 views

### zero knowledge framework for c programs - how to prove correct C program execution with private inputs

I am looking for a zk framework that could be used for proving correct execution of programs written in C (or any other high level language) such as: I know x s.t. SHA-256(x) = y (y is public, x is ...
89 views

### Vigenère cipher frequency analysis not working

I'm writing a C++ program to use the Kasiski method to crack the Vigenère cipher. I'm testing it with a bit of Shakespeare encrypted with the key ABCDEFGHIJKL. It ...
44 views

### AM protocol for 2 distinct objects

Prover is going to convince verifier that 2 objects are distinct, do you know any Arthur-Merlin protocol for this problem?
22 views

### Generating whitening keys through encryption

Question, if I generated whitening keys by encrypting the plaintexts of 0000... and 0A0A... would this reduce vulnerability to meet in the middle and related key attacks? If so, any rough idea of how ...
69 views

### Property of Multiplicative group of integers mod n

While practising on paper I've realized of a property of multiplicative group of integers mod $n$. First, let's define $G$ being $p$ a prime and $g$ a primitive root mod n or a generator of a ...
124 views

### Is it possible to make an encrypted text look like a sentence consists of random words?

Without having any knowledge of common encryption methods, I wonder if an encrypted text can look like random valid words as if it is a sentence. Is it possible? If so, what methods should I use?
95 views

### Euler's Totient function for semiprime numbers

I have noticed, during the period I spent studying RSA, that Euler's Totient function can be calculated in another way than $ϕ(N) =(p-1).(q-1)$ Let me explain myself by pointing to a brief example: ...
74 views

### verify fails on 3rd party after signing with BouncyCastle

I am using BouncyCastle to perform ECDH and then encrypt the data between the mobile (Android) and my hardware with ECIES. It all works fine. When I try to sign a byte array and send it to the ...
77 views

### Lightweight hash function

I am researching about lightweight hash functions and I've got two related questions: What is the standard or requirement for a hash function in general to be considered lightweight ? Why can it be ...
274 views

### How to decrypt a PGP message with only the two primes and the public exponent?

I'm trying to decrypt a PGP Message that is encrypted with an RSA key, but I only have this information: Public exponent: 65537 Prime 1: ...
22 views

### Type 1 pairings and encoding function from $\mathbb G_T$ to $\mathbb G$

Let $e : \mathbb G \times \mathbb G \to \mathbb G_T$ be a Type 1 bilinear pairing. Is it possible to define an encoding function $E : \mathbb G_T \to \mathbb G$? If so, how could this encoding ...
For calculating accumulated values for set of elements chosen randomly from say ${ e_1 ,e_2,...e_n}\varepsilon X$ we use the formula $acc= g^{f(e,s)}$ where $f(e,s)= (e_1+s)(e_2+s).....(e_n+s)$ ...
I was reading 'Pinocchio Coin' paper by Danezis et al. where they have said, "If we use the efficient pairing groups of Pinocchio, computing discrete logarithms in the exponent field $\mathbb{F}_p$ ...