Newest Questions

Ask Question
32,033 questions
Newest Active Bountied 1 Unanswered
0 votes
0 answers
2 views

This is a speculative question that may be hard to answer reliably. Apologies. According to a Techcrunch article linked here A stunning report in Forbes today detailed that the NSA’s rapidly ...
kodlu's user avatar
  • 25.6k
3 votes
0 answers
46 views

The intuition behind simulation-based security proofs comes from the following idea — if any party participating in a protocol or system can fully simulate the entire interaction process without ...
DSTBP's user avatar
  • 301
2 votes
0 answers
29 views

The 1999 paper "The Security of all RSA and Discrete Log Bits" by Hastad and Naslund here states that any block of $O(\log \log N)$ bits where $N=pq,$ of the encrypted RSA output is known to ...
kodlu's user avatar
  • 25.6k
2 votes
1 answer
107 views

I want to know what is the complexity of the lattice-reduction algorithm (used agains CKKS encryption algorithm) named Block Korkine-Zolotarev (BKZ) algorithm (Curtis et al., 2019)? ref: https://...
John's user avatar
  • 31
5 votes
1 answer
401 views

Luby and Rackoff have shown that a balanced Feistel scheme requires only 4 rounds and is "perfectly" secure as long as the round functions are "random enough". Has any work been ...
b degnan's user avatar
  • 5,324
2 votes
1 answer
189 views

Consider the discrete Log Problem w.r.t. prime $p$. Given $b, p, r$ find $x$ where: $b^x\bmod p=r$. We are promised that $b^{\frac{(p-1)}2}\bmod p=p-1$. Q1: What is the complexity of calculating the ...
TheoryQuest1's user avatar
  • 123
2 votes
1 answer
95 views

I'm working on a problem where an encryption scheme like OTP leaks the r-th bit of the key each query where r is a random integer. If an attacker can do an infinite number of queries before the ...
Rexurtiser Skyick's user avatar
  • 21
0 votes
0 answers
51 views

My problem is specific: basically I want to have a website that is a gallery of my photos and I want the user to be able to view them, but that is the only access the user has. If they attempt to save ...
alan's user avatar
  • 1
5 votes
0 answers
66 views
+50

I have a bivariate polynomial $f(x,y)\in\mathbb Z[x,y]$ of shape $$f(x,y)=ax^2+bxy+cy^2+dx+ey+f$$ where $abcdef\neq0$ $|x|<X$, $|y|<Y$, $XY<\frac{W^\frac12}{g(N)}$ where $W=\|f(xX,yY)\|_\...
Turbo's user avatar
  • 1,179
1 vote
1 answer
194 views

As the question states I want to be able to find the initial value for different byte inputs to give a CRC of 0. I have some of the initial values but need others. I/P = 0x00 INIT = 0x9bf1a90f I/P = ...
jon's user avatar
  • 11
3 votes
0 answers
40 views

I m looking for a way to perform pairings without final exponentiation or where the last step is easy to inverse (in order to perform pairing inversion through Miller inversion using https://eprint....
user2284570's user avatar
  • 323
4 votes
1 answer
303 views

Lattice-based schemes sometimes base their difficulty on the intractability of finding short solutions in under-determined linear systems. This assumes of course the underlying ring element is not bit-...
DannyNiu's user avatar
  • 11.4k
1 vote
0 answers
58 views

I am engaged in the translation of encrypted files. I have several files encrypted in the same way. The files consist of two parts: 48 byte header example - ...
Alba's user avatar
  • 11
0 votes
2 answers
102 views

Is there any respected mathematician who can correctly transform the double SHA proof-of-work (used in Bitcoin mining) into a satisfiability (SAT) problem, ensuring that the CNF conversion is done ...
pc gangroli's user avatar
  • 1
0 votes
0 answers
37 views

Could you please clarify whether a Beaver Triple is essentially a form of Functional Secret Sharing (FSS)? I feel that a Beaver Triple might be the key for the share of the multiplication function. If ...
DSTBP's user avatar
  • 301

15 30 50 per page
1
2 3 4 5
…
2136