0
votes
0answers
30 views

How to calculate unicity distance of Fleissner grille?

I need to calculate unicity distance of Fleissners grille of $M \times M$ size. All I know is that plaint text redundancy equals $2$. The alphabet is not specified. Is it possible to calculate its ...
0
votes
0answers
64 views

splitting the plaintext and ciphertext into blocks

Say I was to use RSA with a given value of n. I choose to split the plaintext and ciphertext written in a 27 letter alphabet into blocks with k and m characters resp. How would I find the largest ...
0
votes
0answers
19 views

Uniformly distributed sub-sequences of a main PRG sequence

Let $ g_s $ be a pseudo-random generator that generates uniform distributions of numbers ($s$ : seed) of a fixed bit-size. One wants to compare the pseudo-randomness of certain subsets of elements ...
0
votes
0answers
17 views

$GF(2^n)$ for $n > 32 $ arithmetics free or opensource java library [migrated]

I need a library implementing the $GF(2^n)$ field arithmetic for a large $n$. I tried BouncyCastle but it provides only $n < 32$.
0
votes
0answers
54 views

Semaev summation polynomials

I am little confused how this attack works. We have the points $P, Q$ such that $Q = nP$. We let $u_{1} $and $u_{2}$ such that $R(x,y)=u_{1}P+u_{2}Q$. Then if we find the solution $x_1,...,x_n$ of the ...
0
votes
0answers
74 views

Proof that this is not a secure pseudorandom function

$p$ is a large prime number. Consider the following function $F:\mathbb Z^*_p \times \mathbb D\rightarrow\mathbb Z^*_p$ where $\mathbb D=2,....,p-1$. $F_k(x)=x^k \bmod p$ Proof that it's ...
0
votes
0answers
20 views

Using Montgomery ladder to calculate the coordintes

In one of my assignments I need to solve the below: For a Montgomery curve $3v^2 = u^3+u^2+u$ over ${\mathbb{F}}_{11}$ and point $P = (9,8)$. I need to compute $x$ coordinate of $3P$ using ...
0
votes
0answers
41 views

Proving pseudorandom generators

Can anyone please help me on how to prove or disprove (by counterexample) whether the following function $G'$ is a PRG (Pseudorandom Generator) given that $G$ is a PRG. $$G'(s) = ...
0
votes
1answer
28 views

Encrypting and Authenticating The Simplex Communication Between Embedded Devices

I am planning to build temperature sensor nodes for my home heater control. Central device will control the heater using temperature data read by nodes. These nodes will send temperature data to ...
0
votes
1answer
16 views

Are there any disadvantages of using libsodiums helpers for en-/decoding/comparision instead of the native ones?

Libsodium has some helpers, which allow hexdecimal decoding, encoding and also constant-time string comparison. So if you use the php binding libsodium-php you ...
0
votes
0answers
14 views

Are the ECDSA public keys of a stable/fixed length relative to curve size? [duplicate]

I am working in an environment with strict bandwidth requirements, and we need predictable bit lengths of the stuff we send. We need to broadcast ECDSA public keys, and we are using OpenSSL to ...
0
votes
0answers
18 views

FDE Protection against firmware backdoors [migrated]

In early 2015 news broke that the NSA was installing firmware backdoors in many hard drives. I was wondering, if there was a BIOS and Hard Drive backdoor how well would full disk encryption protect ...
0
votes
0answers
6 views

Security parameter p=O(n) [duplicate]

In many homomorphic encryption scheme, a security parameter is given as p =O(n). How to use the big oh values for calculation? Is there any method to do that.
0
votes
0answers
31 views

Choise enother scheme to basises of lattice cryptosystem

In the lattice cryptosystem to find a good or bad basis we apply "hadamard Ratio". But in high dimension computing of this ratio is hard. dose any other scheme exist to solve this problem?
0
votes
0answers
13 views

Known plaintext, ciphertext, encryption method (AES CBC) and IV (static) [duplicate]

I know the plaintext, the ciphertext, the encryption method (AES CBC) and the IV -- which is static. While not able to perform a chosen plaintext attack per se, I can obtain many known ...
0
votes
0answers
25 views

Finding Private Key $d$ using RSA [duplicate]

I'm a RSA n00b when it comes to the mathematics for RSA. After spending some time reading, watching lectures, etc. I pretty much have everything down, except for how to figure out the equation for ...
0
votes
0answers
22 views

Key equal to IV [duplicate]

If I will use for AES encryption in CBC mode key that is equal to IV, how this change security (IV will be secret)?
0
votes
0answers
16 views

HMQV and MQV group representation attack

Currently reading Krawczyk's HMQV paper https://eprint.iacr.org/2005/176 and trying to follow what he says about the group respetnation attack on MQV: It says that for any group of prime order $q$, ...
0
votes
0answers
14 views

Lightweight Asymmetric encryption algorithm [duplicate]

I'm an embedded systems researcher, and new in crypto field. Actually, I need to know if there are any lightweight asymmetric encryption algorithm especially from time needed for key generation. I ...
0
votes
0answers
40 views

Translation of Schorr Ring Signature to ECSchnorr Ring Signature

I have to write an EC version of Schnorr Ring Signature Scheme. I've already wrote regular ECSchnorr Signature Scheme using this (page 128). I've found a scheme of Schnorr Ring Signature Scheme (page ...
0
votes
0answers
40 views

What are the negative consequences for choosing 8 S-boxes for DES vs 1 S-box for AES?

DES has 8 different S-boxes, and AES has only 1. What are the negative consequences of such choices?
0
votes
0answers
31 views

Is it possible to re-generate ECPublic key from raw private key and curve params?

As per my understanding, in Elliptical curve cryptography, the EC PrivateKey is nothing but a bigInteger value. If you know the curve specs and you have this private BigInteger value (which I am ...
0
votes
0answers
38 views

Is there a fast implementation of RSA for Microcontrollers?

Zhe Liu, Johann Großschädl, and Ilya Kizhvatov. "Efficient and Side-Channel Resistant RSA Implementation for 8-bit AVR Microcontrollers" describes a fast implementation, but only contains a sketch of ...
0
votes
0answers
44 views

what is the fastest and efficient method to perform modular multiplication?

I'm working on a code that needs to perform modular multiplication of big numbers several times. Since the operation takes place several times, using division to find the remainder is very expensive. ...
0
votes
0answers
23 views

how to prove sequence y uphold golomb's third axiom

given $\{ x_k \}$ is a m-seq of order $n$, we define $\{ y_k \}$ to be a $m$ digits number: $$ y_i=x_ix_{i+1}...x_{i+m-1} $$ for every integer $n \ge m \ge 1$ how can I show that $\{ y_k \}$ upholds ...
0
votes
0answers
23 views

How to calculate Private Key in RSA using Extended Euclidean Algorithm [duplicate]

I have googled for about 2 hours now and still haven't found an explanation. The wiki article just makes me more confused and so has every other similar question I've found on StackExchange. Here's an ...
0
votes
0answers
25 views

(Looking for reference) Variants of Diffie-Hellman

Sorry for asking a non-pure-crypto question but I think that crypto.SE might be the right place to find the right people to answer this: I remember having seen a few years ago, online and in HTML ...
0
votes
0answers
82 views

What type of encryption scheme can prevent cheating in this coin flip protocol? [duplicate]

Consider the following protocol for two parties to flip a fair coin: Trusted party $T$ publishes her public key $p_k$ A chooses a random bit $b_A$, encrypts it under $p_k$, and announces the ...
0
votes
0answers
16 views

gpg 2048R - why encryption data length is different if text data 36 bytes

We are using gpg2 and base64 commands with 2048R algorithm Input: encrypted 36 bytes input text data with fixed length(36 bytes) current problem: if I run gpg command continuously, some times ...
0
votes
0answers
15 views

trusted platform module prototype

I have a Java card, which I like to learn more about by installing my own TPM on it. One, which I can kind of "kick the tires", install root keys, send different command to, and ... without fear of ...
0
votes
1answer
85 views

How to calculate mapping in bilinear

I am trying to read a paper in cryptography. In key generation phase, paper give a definition for bilinear like G and Gt be two cyclic groups of prime order p $e: G * G \to G_t$. be a map with the ...
0
votes
0answers
45 views

key exchange using hashing with preshared secret

I came upon an idea the other day that I had some questions about. I am not a security professional but I do study with an amateur interest and have not heard of this particular idea before. There ...
0
votes
0answers
32 views

How all necessary parameters are shared between signer and verifier in ED25519 signature scheme?

I am a newbie in cryptography. I want to use ED25519 signature scheme in my application which requires frequent sharing of secret data between two entities in public domain. I know that Schnorr ...
0
votes
0answers
32 views

What is the security parameter in “KAC” key generation? [duplicate]

I am trying to implement key generation from the paper Key-Aggregate Cryptosystem for Scalable Data Sharing in Cloud Storage. In the paper, the first step in key generation is a setup phase state as ...
0
votes
0answers
40 views

Unbreakable encryption [duplicate]

I am a newbie, I know that I must be wrong, but I need a good explanation. How is it possible to break a cryptographic algorithm created by me, when only I know the algorithm and the key for ...
0
votes
0answers
38 views

Reversible hash function

I met the following 'reversible hash' function applied on a data $d$ consisting of $d_1, \ldots, d_n$ words: $h_0(d) = 0, h_i(d) = c ∗ (d_i + h_{i−1}(d))$, for $0 < i \leq n$. $c$ is a small, odd ...
0
votes
0answers
63 views

How to check if a function is significant or not?

f(n) = 1 / ( log n ) ^ 1/2 I know that this function is not negligible because it will never converge to zero even for large values of n. Now my question is, how ...
0
votes
1answer
77 views

How does non-linearity (S-box) add security to AES?

I'm trying to understand how AES guarentees security. One of the named points on the web is that AES uses a non-linear step (the SubBytes step). But how exactly does the Rijndael key schedule add ...
0
votes
0answers
30 views

How does ABE decryption works? [duplicate]

I am trying to understand how Attribute Base Encryption (ABE) works. So, after downloading libfenc library from here, I built the source code on Ubuntu 12.04 without any error. Afterward, I tried to ...
0
votes
0answers
37 views

Show that using a PRF with a non-uniform key may result in non-uniform values

In a homework assignment we have to use a key derivation function like HKDF. Suppose $k$ is a non-uniform secret key sampled from the key space $\{0, 1\}^{256}$. In particular, $k$ is sampled ...
0
votes
0answers
15 views

How to generate a bilinear group of prime order p [duplicate]

I am trying to implement an IEEE Paper In Cryptography. I read many reference regarding an RSA key generation. But i am confused with above statement. Please someone explain me What it says with ...
0
votes
0answers
26 views

Does CPA attack assumption requires the oracle to have the key?

In CPA model, we assume Eve has access to an oracle who has the correct key and Eve can send query to the oracle to encrypt in CPA the data. Assume this encryption algorithm is a plain ECB mode AES ...
0
votes
0answers
25 views

How do we measure number of possible encryptions in One Time Pad [duplicate]

trying to brute force a specific length of ciphered pad, how do we measure the total number of possible encryptions in One Time Pad
0
votes
0answers
18 views

Advantages of the general digraph trust model over the strict hierarchical model

Are there any advantages of using reverse certificates and the general digraph trust model over the strict hierarchical trust model as described here: In the digraph model each CA can generate ...
0
votes
0answers
17 views

Strength of a cryptography algorithm [duplicate]

I'm just read this article from Atmel corporation in comparing RSA with ECC cryptography algorithms. First of all please read these two paragraphs quoted from the article: P1: Strength of an ...
0
votes
0answers
38 views

Why we use operating modes in cryptography? [duplicate]

Why we use operating modes (CBC , . . ) in cryptography? i mean what is the essential of use it ?
0
votes
0answers
36 views

What is the DK function when generating an AES key for Kerberos 5?

I'm trying to understand RFC3962. So far I understood everything, except for the last part: generating the derived key from the PBKDF2 output. To generate an encryption key from a pass phrase and ...
0
votes
0answers
20 views

How do I check if the secret key polynomial of the ATV-FHE (NTRU based) scheme is invertible?

I want to implement the ATV-FHE scheme as described here https://eprint.iacr.org/2014/039.pdf. To generate the secret key polynomial I compute f = 2*u + 1 , with scheme parameters chosen such that ...
0
votes
0answers
16 views

Encrypted vs unencrypted digital signatures [duplicate]

Is there a difference in terms of security between An encrypted stream of bits obtained by encrypting a plaintext concatenated with it's signature $ C = E_k(plaintext||\sigma)$ where $E$ is a ...
0
votes
0answers
49 views

How to sign an elliptic curve point using an ECC signature scheme?

In Schnorr based ECC signature scheme, a message $M$ is signed with the private key $\mathit{sk}$ as $$s=\mathit{sk}\cdot h(M,R)+k$$ where $R=k\cdot P$ and $P$ is a base point. If $M$ is a point ...

15 30 50 per page