0
votes
0answers
4 views

Gaussian distribution in lattices

In many lattice based cryptosystems, gauusian distribution is used. Can u explain why only gaussian distribution is preferred?
0
votes
0answers
5 views

What does the probability subscript mean in Shannon's secrecy definition?

Shannon's secrecy can be defined as: $$P_M (M=m) = P_{SK,M}(M=m|E(SK,m)=c)$$ What does $P_M$ means? (same question for $P_{SK,M}$) I know that is the probability space M, M being the messages; I do ...
0
votes
0answers
5 views

What happens to NORX if the same (key, nonce, header data) triple is reused

As I understand it, reusing a (key, nonce, header data) triple in NORX leaks the XOR of the initial common prefix (but this is zero, so only its length is leaked) the XOR of the first distinct ...
0
votes
0answers
7 views

Fast hash for 64-bit inputs

I am looking for a fast hash (~few machine instructions) to be used for hash tables with 64-bit keys. I can't use SipHash as the hash function will be inlined in too many places and so the code size ...
0
votes
0answers
14 views

How to design a deliberately weak PRNG for experimentation?

I'm looking for a PRNG that is deliberately weak, that is, follows a set of rules stochasticly. For example: Encounters a set of bits that is a multiple of X, starts exhibiting bias, or starts to ...
0
votes
0answers
8 views

Dieharder text file for output of AES_CTR

I want to run Dieharder test suite on the output of AES_CTR. How should I form the text file consisting of the cipher text obtained from AES_CTR, to be run directly with Dieharder package for linux?
0
votes
0answers
14 views

RSA private key finding method

Bob uses RSA with p= 83 and q= 103. His public key is e = 445. Alice claims that she can calculate Bob's private key without using the definition d=e−1(mod φ(n))? But how?
-1
votes
0answers
11 views

why OCB over AES for authentication encryption?

why should anyone use OCB-offset code book over AES algorithm?
0
votes
1answer
11 views

Determining collision resistance of a function?

I am having trouble trying to understand if the function is collision resistant. As I understand it, preimage resistance means that it is hard for an adversary to find two messages that produce the ...
0
votes
0answers
3 views

Attribute based access control and role based, online bookstore example

I am asked to answer a question that says:One online book-store wants to grand access to clients regarding their subscription. There are 3 types of subscriptions A , B and C. Customers get access in ...
0
votes
0answers
8 views

How can I use PKCS5 (RFC 1423) padding in C# manually for AES Decryption?

My company has an old library that encrypted data for us. It is not able to be used in our new environment so I'm trying to write a decryption method for our old data. The encrypted data had a ...
0
votes
1answer
13 views

Multi Authority Attribute Based Encryption Library

Anyone aware of a library that has MA-ABE implemented in any language preferably python? P/S - I hope this is the right place to ask this. Apologies if not, then a redirect will be appreciated
0
votes
0answers
12 views

The sign of the correlation in linear approximation

${\text{Let }}g:{\{ 0,1\} ^n} \to {\{ 0,1\} ^n}$ be a round function of an $n$-bit iterated block cipher and let $K \in {\{ 0,1\} ^n}$ be a fixed round-key, and denote ${g_K}(x) = g(x \oplus K).$ ...
0
votes
0answers
19 views

Have ciphertext and key but need to figure out encryption method

So I have a block cipher (I think) that I need to break. I have the ciphertext and the key, but not the method of encryption, and was wondering if anyone could help me figure that out? The key is a 9 ...
0
votes
0answers
21 views

AES Twofish Serpent

AES-Twofish-Serpent how to create this combo encryption? I am using Linux Mint and i want to encrypt few big folders in one folder, but to be hiden.
-1
votes
0answers
13 views

M3 Bitlocker Recovery

Has anyone used this software? Is this a legitiamate solution? I am working on rolling out bitlocker encryption on some devices and I want to have a data recovery plan in place. I am looking for ...
-1
votes
0answers
26 views

What kind of obfuscation is used in this image? [on hold]

Edit: This is not off topic since I am not requesting analyzing or deciphering a block of data here. I'm NOT asking anyone to solve this, I'm looking for the name of the obfuscation technique used ...
1
vote
1answer
17 views

OpenSSL & TLS1.2 with aes-cbc and initialization vector

I'm trying to manually decrypt DTLS traffic using OpenSSL and TLS 1.2. The cipher suite im using is AES256-SHA256 as listed here. Im able to decrypt the packets with the key that the server and the ...
0
votes
4answers
74 views

How is a message digest decrypted?

Trying to get my head around digital signatures and hit a slight block. The book I am using gives the following information Device A hashes a message to create a message digest Device A encrypts ...
0
votes
0answers
29 views

What are the pre-requisites I need to be able to code Salsa20 in C#?

I've taken a basic course in Cryptography and we've learnt various algorithms and their usage. I've implemented RC4 and Triple DES in C# with ASP.NET. For a project that I am a part of, I need to ...
1
vote
1answer
42 views

Ciphertext with uneven letter distribution

I have a ciphertext encrypted with an unknown method. It is part of a challenge (personal quest), so I can not post it. The letter statistics is the following: ...
1
vote
0answers
18 views

How big window is secure and practical with TOTP? [migrated]

We are using Time-based One-time Password Algorithm (Google Authenticator) in our system. Since we currently don't allow any time window and code validity is just 30 seconds, we are constantly having ...
4
votes
2answers
49 views

Is reusing keys for CBC and CBC-MAC secure when using encrypt-then-MAC?

I know reusing keys is a bad idea, especially for CBC and CBC-MAC, but the example for why on Wikipedia seemed to use encrypt-and-MAC. It seems obvious that the last block of encryption will be equal ...
1
vote
2answers
32 views

Linear cryptanalysis complete key guessing

In linear crypt analysis, partial sub keys are guessed and verified for its correctness with the help of plaintext and ciphertext. From the partial sub key, how it is possible to guess the complete ...
0
votes
2answers
29 views

What is the time requirement for pairing computation and modular exponentiation?

I want to design a cryptographic protocol for encrypted search without pairing. I have seen some papers for protocols without pairing. How would I compare pairing computation and modular operations?
1
vote
1answer
36 views

Why does a fixed key not make MACs like CBC-MAC or GMAC into secure hash functions?

Why does setting the secret key to a fixed, public value not make MACs like CBC-MAC or EMAC into secure unkeyed cryptographic hash functions? In other words, why is the resulting hash function not ...
-2
votes
0answers
11 views

Please help me decrypt this Classical Cipher [on hold]

Can any one help me decrypt this message: noohaiisee spyg iOyh h ol ceet pbcuoonnss
0
votes
0answers
10 views

How do you apply bilinear mapping to attribute based encryption?

I'm new to both bilinear mapping and ABE. I have a vague idea of how bilinear mapping works now, but I don't understand how it applies to ABE. Can someone give me an example?
1
vote
0answers
14 views

Breaking Vigenere via Kasiski/Babbage method? (non-programmatic)

I'm really hoping someone can explain to me what is going on in the second major component of this form of analysis. If you wish, for convenience, here's a page that already has some ciphered text ...
-1
votes
1answer
22 views

Need CryptDeriveKey AES implementation in C#

I am integrating with 3rd party software that uses AES 128 encryption. I know this is not ideal, but the choice of encryption is up to the 3rd party software. I am using C#. My problem is in deriving ...
0
votes
0answers
23 views

Permuted Hash Table

Suppose we have a hash table, $HT$, consisting of $100$ bins.The hash table uses a hash function $H$ that is public. We all know that given value $a$ we can compute the address in the hash by ...
0
votes
0answers
24 views

Interesting Topics for Projects?

I hope this is not a off-topic question for the site, but I was wondering if I could get any recommendations for project topics in cryptography suitable for someone just learning basic material now. ...
0
votes
0answers
22 views

How to create Crypto based Project

I took Cryptography course last semester and It was very interesting. To have a more practical understanding, I thought I should create a mini project. Below is the ...
0
votes
0answers
17 views

Poly1305 vs VMAC: is VMAC much better for long messages?

VMAC seems to me much more secure than Poly1305 on long messages (the security of the latter decreases linearly with increasing message length). Is this of practical relevance?
0
votes
1answer
39 views

AES128 Decryption in Objective-C just slightly off

I have been asked to integrate a home-grown CRM system with a 3rd-party data service provider (DSP). The DSP has encrypted the information they are providing. I only have their decryption ...
0
votes
1answer
33 views

RSA PKCS#1, v1.5 padding output

If I make use of RSA PKCS#1 in v1.5 what padding length is used. Basically, it is not allowed that the plaintext is bigger than the modulus. But what if the length in bits is the same (padding to ...
-2
votes
0answers
22 views

block cipher secure as ind - cpa

if we have the following block cipher found here http://imagebin.ca/v/2WGa2kAGEX3E, is it ind - cpa secure?
1
vote
1answer
24 views

Updating values authenticated by Merkle Tree

Assume we have 4 values: $v_1,v_2,v_3$ and $v_4$. We construct a Merkle tree on top of them such that the values are leaves of the tree. I send the values and the tree to an untrusted server. But I ...
0
votes
2answers
24 views

OpenSSL Signature different each time

I have a file that I am generating a signature for using OpenSSL, and each time I generate the signature, it is different to the last time. ...
1
vote
1answer
47 views

Is multiplicative blinding less secure than additive?

It's easy to see that additive blinding (e.g., $x+r$ for secret x and random r) is perfectly secure in a finite field (this is a one-time-pad) and statistically secure for $r$ uniformly distributed in ...
0
votes
0answers
21 views

Miller Algorithm of Weil Pairing implementation for Python2

I would like to implement miller algorithm for Python, but it cannot work correctly, Please help me. (1) Please tell me Miller algorithm's output of the following case. ...
6
votes
2answers
781 views

Is there a null HMAC?

I came up with this question while unit testing a function that includes an HMAC. What is the expected behavior of an HMAC with a well-defined key and a set of data with no elements in it? Is there ...
3
votes
1answer
63 views

What is wrong with simple concatenation in salted password hashes?

I once heard that if implementing a password hashing scheme, simply concatenating the password and salt together before hashing could lead to some subtle vulnerabilities, and I'm trying to figure out ...
2
votes
1answer
81 views

How to find roots of equation $f(x)=0 \pmod p $, where $p$ is prime number?

$f(x)$is any nth degree equation $n>0$, how to find roots of $f(x)$ over prime modulo.
2
votes
2answers
47 views

Research for video game: Novice cryptography concepts

I'm making a video game which has some basic cryptography as a main base for puzzle design. I'm hoping players will get great puzzle challenge and learn a few cryptography concepts through playing the ...
1
vote
1answer
29 views

Cardholder to Merchant SET Protocol

I have some doubts regarding the SET protocol. Let say the Alice payment information runs through a sha-1 hash function which is a one-way algorithm, irreversible to create a message digest. How do ...
3
votes
3answers
25 views

What are possible caveats when generating a group for use as parameters for Diffie-Hellman key exchange?

As reusing a widely used group for Diffie-Hellman key exchanges might lead to far easier third-party key discovery through precomputation for that specific group, I would like to know what can ...
1
vote
1answer
35 views

Compression in key generation of DES algorithm

Does anyone have a pseudo-code or an algorithm or even a diagram of the compression (pc2) of the DES algorithm? I can't find a relation between the bits that are dropped, even when I do it manually ...
0
votes
0answers
23 views

SET Protocol (SET)

I would like to know if the current SET protocol uses 3DES or AES other than DES and RSA? I have look into many articles but some of them were outdated.
3
votes
2answers
123 views

Why does a non-prime DH modulus creates a “NOBUS” backdoor

can't we do a nobus backdoor with DH modulus prime? Some have argued that with a prime modulus you can just get the order by doing p-1 and then factor it, thus it is easy to reverse. I argue that this ...

15 30 50 per page