0
votes
0answers
3 views

The length of the shortest vector in Lattice

In Micciancio and Regev's paper "Lattice-based Cryptography",the length of the shortest vector is at least min{q, 2^{2*squart(nlog_qlog_(dert))}} . I want to ask why the paper chose the latter as the ...
0
votes
0answers
3 views

Store and share data on web server

I'm developing an intranet for a company where admins are sharing a huge excel file containing all the necessary password, on the common TSE. I've managed making them encrypt it with a common password ...
2
votes
1answer
13 views

Proof that LFSR (with XOR feedback and nonzero seed) will never hit state of all 0s

Does anyone know a good proof that a LFSR (with XOR feedback and seeded with non-zero starting state) will never enter zero state? It is obvious that a zero state will always get stuck in a zero ...
8
votes
1answer
454 views

What exactly is a “garbled circuit”?

There are plenty of questions here about the details and how-to's of "garbled circuits", but I have not seen anything that defines what garbled circuits are. What exactly is a garbled circuit? What ...
0
votes
0answers
24 views

How can I find all points on an elliptic curve?

I have an elliptic curve $$y^2=x^3 + 8 \times x + 6 \mod 13$$ How do I find all the points on this EC? Also, could you give me more examples?
2
votes
1answer
25 views

Client side encryption / hashing of “person ID's” with password?

What we're looking for A solution where data is stored and retrieved (!) from a server using a person ID that can only be known at the client (form of ...
0
votes
1answer
33 views

IND-CCA Security of a encryption scheme which is combination of two schemes

I have two public key encryption scheme $\Pi_0$ and $\Pi_1$ and one of them is IND-CCA secure, another one is IND-CPA secure. Let $\Pi$ be a public key encryption scheme, which is a combination of $\...
0
votes
0answers
15 views

Decoding base64 with key [on hold]

I'm working on a program that scrapes video URLs from a website. The URLs seem to be coded in base64. Here's an example: ...
0
votes
1answer
18 views

Is there a TLS extension for generating unique IVs for AES GCM?

Since reusing IVs is death for AES GCM, it seems like using the fixed IV in the TLS connection state is a phenomenally bad idea. It wouldn't even seem to be a good idea to use the salt + counter ...
2
votes
1answer
15 views

Message expansion in NTRU: why is it $\log_p(q)$-to-$1$?

Suppose that we are working with the original version of NTRU with parameters $(N,p,q,k,d_f,d_g,d_\phi)$. In this case we are working with the original NTRU with the digital envelope and the ...
-1
votes
0answers
12 views

Cloning limitation of PCB [on hold]

Is it possible to clone the car key remote PCB? I am not sure wether that PCB cloned can copy the program from IC.
1
vote
1answer
16 views

What is the structure of a Server Key Exchange Message structure when using a psk identity hint?

I need to know the structure of a server key exchange message when using a psk identity hint. I know the general structure but I can't find an example of where the identity hint fits in. Thanks.
-1
votes
1answer
28 views

How to test digital signatures between two computers? [on hold]

I have to test a digital signature algorithm. I have two computers, one will be signer and the other one is verifier. I implemented both of these in C++ but I do not know how to test it. Computers are ...
3
votes
1answer
30 views

Is order of Correlation Immunity of AES S_box Zero?

I am working on AES S_box and trying to find out its properties like Correlation Immunity, Balancedness , Algebraic Degree , ANF form etc. These Papers 1, 2 give a nice definitions to above said ...
1
vote
0answers
19 views

where is ANS X9.31 used?

FIPS 186-4 mentions two standards for RSA: PKCS #1 and ANS X9.31. PKCS #1 is used with SSH, X.509, etc. What is ANS X9.31 used with? FIPS 186-4 has the following line: ANS X9.31, Digital ...
2
votes
1answer
67 views

Proof that a encrypted file has the same content as an (existing) original

Assume that Alice has a file F which she is going to send, in encrypted form, to Bob. Alice possesses F and the public encryption key K of Bob in form of an X509-certificate. She generates the file E ...
0
votes
0answers
8 views

Camellia Key Schedule Sigmas [migrated]

Camellia uses 6 sigmas in its key schedule with values ...
1
vote
0answers
48 views

Are there any digital signatures valid for multiple pieces of data?

Are there any digital signature algorithms that can be used to produce signatures valid for multiple pieces of data? For example: Pick a private key $k_{private}$, which has public key $k_{public}$. ...
3
votes
1answer
37 views

Does there exist an indistinguishability formal proof obfuscator?

A formal proof obfuscator is a mapping $\mathcal{O}$ such that whenever $P$ is a formal proof of a theorem $T$, then $\mathcal{O}(P)$ is a distribution of formal proofs of the same theorem $T$. An ...
1
vote
1answer
56 views

Do the Syllae algorithm and Malaysian cipher from Rubicon exist?

In the first episode of a tv series Rubicon (exactly in 482 and 491 lines of an English subtitles) there is mentioned “Syllae algorithm” and “Malaysian cipher”. I could not find any details about ...
0
votes
0answers
26 views

Problem when programming Schnorr signature [on hold]

I have some questions about Schnorr signature implementation. I am trying to implement it in C++. I chose private signing key x and public verification key y = g^x. I have a message M, random number ...
1
vote
0answers
15 views

How are keys stored in a .keystore file or in a .jks file? [migrated]

I would like to know what is the structure of the keys stored inside a .keystore or a .jks file? by structure I mean are the keys stored in key value pairs? how are the passwords for several keys ...
0
votes
0answers
24 views

How can I convert an image into a long hexadecimal code and vice-versa? [on hold]

Title. Characters to fill required 30 characters minimum.
1
vote
3answers
89 views

Public key decryption mathematical analogy

To clarify, I'm talking about digital-signatures, not public key encryption. When I encrypt something with a private key, then it should be decryptable with a public key, as I've understood how ...
5
votes
1answer
93 views
+50

Applying machine learning algorithms to homomorphic encrypted data

I have a basic understanding of encryption and I got back to the topic because of an interesting site that encrypts financial data using homomorphic encryption (HE) and I would be happy for any input ...
-1
votes
0answers
48 views

what are the kind of mathematical proofs that i need to be familiarized with to understand (or do) cryptography? [on hold]

I know reductions are highly used to show that encryption schemes are secure under certain conditions, but i don´t know what other math proofs are needed. PD: English is not my native language so ...
3
votes
1answer
30 views

Using master password to encrypt and decrypt user credentials

I need a way to store third party credentials, and I want to avoid storing passwords in plain text. I can't use a hash because I will need to be able to get the raw password to log in to the third ...
1
vote
0answers
38 views

How would low-precision Gaussian sampling impact the security of BLISS?

For digital signature, I implemented BLISS in my cryptographic suite, and wrote the Gaussian sampler based on Lattice Signatures and Bimodal Gaussians. But unlike the reference implementation and ...
-1
votes
0answers
10 views

ocf-linux, Splitting large buffers into chunks < MAX_DATA_LEN [migrated]

I am using ocf-linux in an openwrt application and have run into OCF CRYPTO_MAX_DATA_LEN (64K-1) and E2BIG errors in CRYPTO_AES_CBC mode. As a consequence, I need to split the input buffer into ...
1
vote
3answers
91 views

Is there a PRNG algorithm that allows to switch between states directly, not calling next()?

Basically I need a function with the following interface: getRandomBytes(uint128 seed, uint64 state, uint16 byteCount) Consecutive calls with the same seed and ...
5
votes
2answers
113 views

Is it ever safe to use encryption with compression?

In the wake of compression-based side-channel attacks like CRIME and BREACH, are there any safe ways to combine compression and encryption? The JWE Specification was finalised almost 2 years after ...
0
votes
0answers
19 views

Is there any functional encryption scheme whose key generation circuit is in NC1?

To my best of knowledge, I have kown there exists randomized encoding scheme whose encoding circuit is in $NC^1$, fully homomorphic encryption scheme whose decryption circuit is in $NC^1$, and ...
3
votes
0answers
45 views

RAR brute force cracking speed

I have been playing around with cRARk and was astonished by the low speed. On a 2015 high-end GPU (GeForce 980 ti), it took roughly 4h 50min to test all passwords composed of an 8-character prefix and ...
0
votes
0answers
37 views

Independence of answers to queries sent to a random oracle

Assume we have an algorithm which asks random oracle $\mathcal{O}$ $Q$ queries $u_1, \ldots, u_Q$. All queries are unique, $u_i \neq u_j$ for $i \neq j$. Queries $u_i$ are random variables, too. What ...
1
vote
1answer
124 views

Do I need to prove this?

I am using ABE scheme that has already proven under BDHE assumption. Here is the scheme https://eprint.iacr.org/2008/290.pdf In the key generation algorithm, I want to tie the user secret key ...
2
votes
1answer
46 views

Why is it so hard to make longer hashes?

I was reading this answer about why there is no such thing as a SHA-1024 hash: SHA-2 was built with state and word sizes to meet the security requirements on commodity computers (x86 and Alpha), ...
0
votes
0answers
33 views

How do Raptor (Fountain codes) encoding and decoding work? [on hold]

As described in this article, a Raptor code is a fountain code that encodes a message of $k$ symbols into a limitless sequence of encoding symbols, such that knowledge of any $k$ or more encoding ...
1
vote
2answers
37 views

Secure logical AND using Ishai-Sahai-Wagner Scheme

I want to try to implement a secure AND the way it was described here: https://eprint.iacr.org/2010/441.pdf It says that there are two bits a and b and that they have been split into d+1 shares. How ...
6
votes
2answers
145 views

RSA: revealing the modulus factorization by choosing a bad message

I started reading the book Cryptanalysis of RSA and its variants by M. Jason Hinek and I stumbled upon a phrase that intrigued me: plaintext messages that are relatively prime to the modulus (i....
1
vote
1answer
64 views

Given $ g^s, g^y , g^r, g^t, g^{st-rs}, g^{(yr+d)/t}$ , is it hard to distinguish $e(g,g)^{syr}$ from a random value?

Where $g$ is a group element in bilinear group $G$, $e(g,g)∈GT$ and $s, y, r, t, d$ are randomly chosen. I understand it is very similar to the conventional DBDH problem, but $g^t, g^{st-rs}, g^{(yr+...
2
votes
1answer
41 views

Given $g^a, Y$, is it hard to distinguish $e(g,g)^{ab}$ from a random value?

where $g$ is a group element in bilinear group $G$ $Y = M.e(g,g)^{ab}$ $M$ is a message Does anyone know the answer or suggest some material for reference? Many Thanks
2
votes
1answer
35 views

Using the Unix epoch as nonce

Since a nonce must be unique and that time only goes forward, is it safe to use the Unix epoch as nonce ? My use case is be AES w/ GCM which recommends a nonce length of 12B. Current Unix time can be ...
0
votes
1answer
34 views

How secure is encrypting with self-hash [duplicate]

I don't have much knowledge about cryptography beyond using libraries for it. So just wanted to understand if the following two cases differ sufficiently in security or is it just psychological: Say ...
0
votes
0answers
36 views

Is it possible to turn an image (e.g. a photo) into a cryptographic hash? [closed]

I am looking for a way to turn an image (e.g. a photo captured on a phone) into a cryptographic hash (e.g. SHA256). Is this possible? If so, how?
3
votes
1answer
84 views
+100

Is security against semi honest adversary inheritable?

I have a two party protocol, let's call it $M$. At some point, there are $k$ steps, each one involving an oblivious transfer protocol, which is known to be secure against semi honest adversaries. ...
0
votes
1answer
36 views

Decomposing an ideal in intersections

Let $R$ be an ring, and let $(a),(b)$ be the ideals generated by $a,b\in R^\times$ respectively. Let $c=a\cdot b$ and $(c)$ the ideal generated by $c$. I am supposing that, given $c$, it is ...
5
votes
0answers
62 views

Using a single Ed25519 key for encryption and signature

The libsodium documentation contains a function crypto_sign_ed25519_pk_to_curve25519 that converts an Ed25519 key into a Curve25519 one, so it can be used for both ...
1
vote
0answers
19 views

How long is the tag T in AES-GCM(Or: Can implementations freely choose t = len(T)?) [duplicate]

I've started to learn about GCM. In the paper I read on page 4 there is the equation: $$ T = \text{MSB}_t(\text{GHASH}(H, A, C) \oplus E(K, Y_0)) $$ It's clear to me that the function $\text{MSB}_t(S)...
2
votes
1answer
52 views

When is AES chosen instead of a stream Cipher (e.g., RC4) during an SSL connection?

During an SSL handshake, the browser sends a list of cipher suites to the server, from which the server selects one option. For data encryption, two of the several possibilities for the ciphers in ...
2
votes
2answers
35 views

Homomorphic Encryption operation for regression

I must be missing something, and I am sorry if this is a novice question... I have seen in places (eg. https://crypto.stanford.edu/~dwu4/talks/SecurityLunch0214.pdf page 13) that linear regression is ...

15 30 50 per page