0
votes
0answers
44 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 ...
0
votes
0answers
54 views

Is there any real practical group signature scheme deployed?

Groups signatures are a crypto primitive introduced in order to guarantee anonymity on signatures constructed by a group of people. Since there introduction and there exhaustive security requirements ...
0
votes
0answers
48 views

Unicity Distance - AES

I am quite confused calculating the unicity distance and I was hoping that someone can clarify some things for me. My main issue comes from somewhat a difference of the calculation given by our ...
0
votes
0answers
42 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?
0
votes
0answers
38 views

Solving discrete logarithm when p is not a safe prime

If you have the cyclic group of integers modulo $p$, where $p$ is not a safe prime, as well as a generator $g$ with which for all factors $q$ of $(p-1)$, $g^{(p-1)/q} \ne 1$, This answer says that ...
0
votes
0answers
19 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 ...
0
votes
0answers
35 views

Anyone familiar with domain of hash functions in bilinear pairing based system?

I need a clarification regarding domain of hash functions. I have defined a bilinear pairing based system as follows: Let G1 and G2 be cyclic multiplicative groups of prime order p generated by g1 ...
0
votes
0answers
43 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 ...
0
votes
0answers
51 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?
0
votes
0answers
30 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 ...
0
votes
0answers
49 views

ElGamal Generator g problem

Having an ElGamal encryption scheme with p=19 which value can not be assigned to g? The answers were : 1,7,11,2 I think you can't assign value 1 to g.
0
votes
0answers
42 views

Elliptic curve point addition

I have this curve in E(F131) : $$Y^2 = X^3 + X + 2 $$ I want calculate the sum P + Q considering that $$P= (5,1)$$ and $$ Q = (60, 49)$$ For calculate the result i use these formulas: $$ xr = ...
0
votes
0answers
121 views

My attempt of combining socialist millionaire and Diffie-Hellman. Is it any good?

I've come up with an algorithm to solve the socialist millionaire problem, but I'm not sure if the algorithm is secure. I wasn't able to find any flaw in it, but it seems too simple to be secure, so ...
0
votes
0answers
46 views

Does the encryption algorithm DES perform random permutations? If so how is information not lost?

"Before round 1 begins, all 64 bits of an incoming message and all 56 bits of the secret key are seperately permuted (shuffled)" My question is this : Is the shuffling of the bits performed randomly? ...
0
votes
0answers
19 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 ...
0
votes
0answers
42 views

Bilinear pairing arithmetic - cryptographic accumulators

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)$ ...
0
votes
0answers
45 views

How many bits of entropy can I expect from /dev/urandom in iOS?

Apple's latest security documentation indicates that it now uses CTR_DRBG for generating pseudo-random numbers (previously Yarrow instead of CTR_DRBG), using "timing variations during boot" and ...
0
votes
0answers
37 views

Discrete log in Galois Extension Field

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$ ...
0
votes
0answers
62 views

Name of this attack?

I am studying Merkle tree signature. Let $\sigma=(s,Y_s,\sigma_{\text{OTS}},As)$ be a signature of certain document. Here $s$ is the index of leaf, $Y_s$ is the respectively OTS public key and $A_s$ ...
0
votes
0answers
42 views

Factorization of a number obtained by a modular multiplication operation can reveal factors of the used operands?

Consider a number $r$ obtained by: $r=a \cdot b \mod n$ Can knowing the factorization of $r$ reveal some information (bits) of $a$ and $b$ ?
0
votes
0answers
61 views

Finding Patterns in Encrypted Data

I am looking for an application (Windows) or code example that might help me find patterns in an encrypted file. I have a ciphertext for which I want to see when a key is repeated. I am not trying ...
0
votes
0answers
38 views

prepaid meters that rely on a disconnected system

i have some experience with cryptography in the banking sectors, mostly in block ciphers like DES 3DES etc. im interested in prepaid electricity meters as it is a number that is generated from a ...
0
votes
0answers
28 views

RSA_DH vs ECDH implementation

In ECDH protocol is possible, naturally, to use the same algorithm for calculate a secret key for both communication parties (Alice and Bob for example). It is possible to design also a same algorithm ...
0
votes
0answers
43 views

What are some hashes that do not exhibit the avalanche effect?

I do not know much about cryptography. But, I'm in a situation where I need a hashing method that does not exhibit the avalanche effect. I tried Googling but couldn't find anything.
0
votes
0answers
79 views

Which of these is a secure MAC?

Let (S,V) be a secure MAC defined over $(K,M,T)$ where $M = \{0,1\}^n$ and $T =\{0,1\}^{128}$. Which of the following is a secure MAC: $S'(k,m) = S(k,m)[0,\ldots,126]\quad and \quad V'(k,m,t) = ...
0
votes
0answers
52 views

Enigma algorithm Question about the Ringstellung

This might be a stupid question but I need to implement the Enigma algorithm and I don't fully understand how it works. I've googled the subject and I am confused about what the Ringstellung is and ...
0
votes
0answers
31 views

Outsourced Multiparty computation proof in Ideal world

I need to know in an outsourced two party computation where honst $A$ and $B$ outsource their private and secure data to a malicious server, why we need to design a simulator that interacts with an ...
0
votes
0answers
46 views

Role of trusted party in the Ideal model in Malicious case

Imagine there is a protocol supporting outosurced multi party computation. There are three parties involved in the protocol: client $A$, client $B$ and a server. Client $A$ and $B$ send their private ...
0
votes
0answers
54 views

Security of a custom non linear hill cipher

Initially let me state that this is an atypical type of cryptographic encoding. First I break up my key into three parts $k = {W,\overrightarrow{b},\alpha}$. the $W$ is simply a $n \times n$ matrix, ...
0
votes
0answers
48 views

How to map a handful of numbers in a large range to a much smaller range deterministically without collissions

I want to map a set of long integers (say around 100 different values) that can span the entire 64 bit integer range to a much smaller range such as from 0 to 25000 deterministically with almost zero ...
0
votes
0answers
29 views

Does “identity-based dynamic threshold signature” exist and could such scheme contain a “Signature Combination” algorithm?

I came across [1] and I'm very puzzled by this paper. They use a building block which they call "identity-based dynamic threshold (IBDT) signature", citing paper [2]. First of all [2] does use this ...
0
votes
0answers
70 views

How do I prove IND-CPA security of RSA-OAEP?

How do I prove that RSA-OAEP is IND-CPA secure? It would be very good to show how to prove it formally, but an informal proof would also be enough. Because of the random number in RSA-OAEP, RSA gets ...
0
votes
0answers
66 views

Why is it a bad idea to use Diffie-Hellman with a prime such that $p - 1$ is smooth?

I recently stumbled upon another question in which somebody menitoned that using custom primes for DH is safe if you keep in mind, that $p-1$ should not be a smooth number. Why is that?
0
votes
0answers
42 views

Decypting a Stream Cipher

I am trying to decrypt a stream cipher. I know what the first word of the message is when decrypted but I am unsure how to decrpyt the rest of the message. I know what the first word is because I ...
0
votes
0answers
21 views

Does Windows CNG store private information using LSA secrets?

I read that LSA Secrets have the capability of storing data privately, more importantly, ensuring that users without proper permissions cannot access that same data. Windows CNG has security measure ...
0
votes
0answers
22 views

What is sLHAE (stateful length-hiding authenticated encryption)?

Can somebody please explaint me how does sLHAE works in TLS? I met this term in some TLS papers and struggled to understand how it works, specifically the "length-hiding" part.As to my understanding ...
0
votes
0answers
34 views

If a DES key correctly decrypts one message, what's the probability it's the real key?

Suppose an adversary gets a message-ciphertext pair $(M,C)$, where $C=DES_K(M)$. They do an exhaustive key reach to locate the lexicographically first key $T$ for which $C=DES_T(M)$. What's the ...
0
votes
0answers
31 views

What crypto scheme should I use on embedded m2m system with assymetric uplink/downlink bandwidth?

I am working on implementing info security into custom m2m radiolink communication system, which has some restrictions: MCU based endpoint can transmit to gateway with packets max 16 bytes long, and ...
0
votes
0answers
35 views

Registration and log in through public key cryptography?

I read about zero knowledge proofs. Let's say you want to create an account at a website. You choose a password $p$ and from $p$ you derive deterministically a public & private key pair $(e,d)$ ...
0
votes
0answers
49 views

arithmetic calculation problem to quadratic arithmetic program

I am reading the Pinocchio paper (verifiable computation): http://research.microsoft.com/pubs/180286/pinocchio.pdf The paper is rather hard for me. I am considering this calculation problem: ...
0
votes
0answers
151 views

Montgomery Reduction

I'm taking a hardware cryptography class and working on a problem that focuses on Montgomery Reduction. So by definition: Computing a x b (mod N) Pick R, s.t. R > N, gcd (R,N) = 1 Compute N^-1 ...
0
votes
0answers
48 views

Is there are code hidden in Wired Magazine's December 2014 Issue?

There seem to be several hints that there's more to Wired Magazine, December 2014 (Issue 22.12) that meets the eye. In his Letter from the Editor, Scott Dadich says: I’ll refrain from spoiling ...
0
votes
0answers
34 views

Generating interactive, secure multiple ECC key pairs deterministically

In Elliptic Curve Cryptography (ECC) assuming user A has a private public key pair of $S$, $P$ accordingly with generator point $G$ which as we know is: $$P=S*G$$ Assuming that user A wants to ...
0
votes
0answers
41 views

Determine encryption method with input and output

A website stores username and password in a session cookie. In the cookie the password is "encrypted" or modified in some way. Given that the "encrypted" version is always the same, I do not believe ...
0
votes
0answers
56 views

side channel attacks against TDES (compared to AES)

We all know AES has some pretty strong side channel attacks, some where (with a couple of hundred know plain- and ciphertext combinations) a key can be derived in a matter of minutes. Others may take ...
0
votes
0answers
41 views

Protocols with deliberate errors

This question is motivated by discussion cocerning “The Two Sheriffs” puzzle, see (1) and (2). Are there any public key protocols where Alice and Bob intentionally insert errors in their messages? ...
0
votes
0answers
72 views

Rabin cryptosystem with 1 mod 4

We have p and q which are distinct primes congruent to 1 mod 4. Then we have n = p*q. Do you know any algorith for calculating square roots for the decryption in this case? I'm asking for some ...
0
votes
0answers
89 views

Security of basic SHA256 MAC in an authenticate-then-encrypt scheme

I know the following construct is insecure if the MAC as defined below is appended to the encrypted message in an Encrypt then Authenticate (EtA) scheme. $k_1$: encryption key $k_2$: authentication ...
0
votes
0answers
27 views

Does it make sense to have multiple values of authentication and cipher offsets while encrypting a packet?

Consider a packet with N segments. cofsset(cipher offset - from where one must cipher) lies in arbitrary Segment "A". aoffset (authentication offset - from where one must authenticate) lies in ...
0
votes
0answers
35 views

EC based password authenticated key exchange protocol

I would like to know: What is the currently best (efficiency and security wise) known EC based password authenticated key exchange protocol? (i.e. is there any EC based protocol may be similar to DH ...

15 30 50 per page