0
votes
0answers
46 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
56 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
47 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
59 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
51 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
32 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
71 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
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
24 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
26 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
37 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
34 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
53 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
51 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
37 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
60 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
75 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
98 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 ...
0
votes
0answers
69 views

Popularity of ECMQV authenticated key agreement protocol

I've got a few ECMQV related questions: Why is ECMQV a more efficient EC-based authenticated key agreement protocol? Why is ECMQV so popular? Is it because no other protocol of its strength exists? ...
0
votes
0answers
44 views

Is the key schedule of Serpent a circle?

The creation of the prekeys for Serpent works by XORing some previous values with a counter and a fixed value. Every word is 32 bits big and 4 words form a round key (after applying a S-Box, but this ...
0
votes
0answers
32 views

Would a pictographic, phoneme-based, hand cipher be difficult to crack with computer crypt-analysis?

What I'm talking about is a hand cipher which uses phonemes instead of individual characters and pictograms instead of the usual shuffling/substitution methods (e.g Caesar, Solitare, Vignere). The ...
0
votes
0answers
36 views

Using a Secure RNG in Probabilistic Fair Exchange

I am attempting to implement probabilistic fair exchange described in Probabilistic Non-Repudiation without Trusted Third Party. A secures a message using AES with 512 bit keys (in my ...
0
votes
0answers
39 views

Substitution Permutation Network (SPN) - Decryption In Mathematica

I am working with a Substitution Permutation Function, SPN, in Mathematica. I have an encryption function for an SPN. By changing the parameters that go into the spn function, and not the function ...
0
votes
0answers
53 views

Are there any noisy homomorphic encryption schemes?

Are there any Homomorphic Encryption(HE) schemes that result in noisy answers ? By noisy i mean , the answers could be approximately near the actual answers by noise factor $\epsilon$. For example , ...
0
votes
0answers
41 views

Vigenère + columnar transposition

I'm trying to decode a text which is encoded by Vigenère followed by a columnar transposition. The method I want to use is trying random columnar transpositions and then rating how much the text that ...
0
votes
0answers
42 views

Recover keys using statistical saturation attack

I am having trouble here performing this attack on a block cipher. This is my block cipher, it is a toy with really bad diffusion just for the sake of performing a successful attack ...
0
votes
0answers
103 views

What can cause similar MD5 hashes

I have a set of MD5 hashes with huge similarities in the second half of the hash, (made up) examples: ...
0
votes
0answers
72 views

Is there any pattern in points on EC?

I read some where in crypto.stackexchange answer (related to EC-SRP protocol) that there is pattern in points on elliptic curves, i.e. if given some points containing mix of correct and wrong points ...
0
votes
0answers
15 views

Keystore and configuration file

It appears that Java Keystore is often used by web server using a configuration file, with the password opening the JKS written in it and also the password protecting the specific entry. How could ...
0
votes
0answers
57 views

common ways / methods to try to break a SP network

I have a very little cryptography background (but a relatively solid maths background) so my below question is very general. Basically I have been given a SP network with an output to reverse. I ...
0
votes
0answers
53 views

security of pairing based cryptography

while going through some papers on cryptographic accumulators i find the following statement "several pairing-based accumulators have been proposed in the past. However, due to continuous and recent ...
0
votes
0answers
37 views

AES product function

Small description: consider a polynomial in GF($2^8$) , which has the form $$f(x) = b_7x^7 + b6x^6 + b_{5}x^5 + b_4x^4 + b_3x^3 + b_2x^2 + b_1x + b_0 $$ If we multiply by x , we have $$x * f(x) = ...
0
votes
0answers
73 views

About the Security of PCBC Encryption Mode

We are designing an encrypted file system. We plan to use the PCBC (Plaintext Cipher Block Chaining) encryption mode for encryption. This is because we desire the feature ("small changes in the ...
0
votes
0answers
27 views

Security of simple Skein PBKDF mentioned in the paper

From the Skein 1.3 paper section 4.8, Skein as a Password-Based Key Derivation Function (PBKDF), it mentions the following as a simple PBKDF (S = seed and P = password): An even simpler PBKDF is ...
0
votes
0answers
74 views

How dangerous is it to encrypt with AES 256 if the end user knows the unencrypted value?

I am implementing a bit of security in a system that was originally built without encryption on a specific piece of data. The plan was to encrypt this piece of data and include it as part of the ...
0
votes
0answers
111 views

Naive implementation of Rainbow Table and/or Hellman's trade-off

Is there any naive implementation of Hellman's cryptanalytic time memory tradeoff in C and/or a naive implementation of Oechslin's rainbow table algorithm in C as well? I have seen some ...
0
votes
0answers
52 views

Composition of non-perfect encryption keys

Definition 1: A key $k$ is called perfect if it is uniformly distributed from the adversary's point of view; a key $k$ is called $ε$-perfect, if its distribution has an $ε$ trace (statistical) ...
0
votes
0answers
65 views

Making PRFs out of PRGs

Is it possible that we take a $PRG$ $G(k)$ of stretch $n\cdot2^n$, and read its output as the table of a $PRF$ $F(K)$ with input and output size of $n$? Intuitively it sounds possible however I read ...
0
votes
0answers
41 views

Resynchronizing brute-force attack against stream ciphers

There is a stream cipher without any known cryptographic weaknesses. The attacker knows parts of the key so she can reduce the key-space to a size that can be practically brute-forced. However the ...
0
votes
0answers
40 views

Signature constructor using Self-signed certificate

I've the following scenario: One application signs JWT access/id tokens using the private key contained in a self-signed certificate, and then passes its public key to other parties to validate that ...
0
votes
0answers
50 views

Requested to encrypt data with AES256, digital certification, timestamped

at my job we have been tasked by gov to encrypt some data we send to them. The "law" says we have to do the title above, but they only need us to do the AES256 thing because the data is not really ...
0
votes
0answers
88 views

Key exchange using hash function

Consider two types of attackers on a key exchange (KE) protocol and subsequent communication between the parties which used this KE instance to establish a secure communication key. Attacker Eve ...
0
votes
0answers
51 views

Attack on key exchange with authentication

Suppose the honest parties - Alice and Bob - exchange public key in person/via telephone so that attacker can only eavedrop on the line. Alice has hashed the public key using a collision resistance ...

15 30 50 per page