Questions tagged [cryptography]

Questions about the construction and analysis of protocols and algorithms for secure computation and communication (including authentication, integrity, and privacy aspects).

30 questions with no upvoted or accepted answers
Filter by
Sorted by
Tagged with
5
votes
0answers
52 views

Correctness of a zigzag algorithm to find the most similar vector in a bounded integer lattice

I am currently working on an integer lattice problem, called the "most similar vector problem," and wondering if can be solved correctly by a simple "zig-zagging" algorithm. Given a real vector $u \...
4
votes
0answers
117 views

Optimal parallel-time repeated modular squaring circuit

Given a 4096-bit integer $x$ and a 4096-bit RSA modulus $N$ (of unknown factorisation) what is the fastest circuit to compute $x^{2^T} \mod N$ where $T=2^{40}$. That is, what is the fastest parallel-...
3
votes
0answers
60 views

creating new PRF from existing one

I have encountered a problem in class, tried solving it and faced a problem, I will include my ideas, and the problems i faced. Assume F is a PRF, 1.denote $P_k(x) = F_k(x) ⊕ F_k(1^n)$ for any $n ∈ ...
3
votes
0answers
258 views

How is Chinese Remainder Theorem used in the proof of correctness for RSA

Question At the very end of (most) proofs of RSA's correctness we have something like $$m^{ed}\equiv m\pmod p$$ $$m^{ed}\equiv m\pmod q$$ Therefore by the Chinese Remainder Theorem (CRT) $$m^{ed}\...
3
votes
0answers
71 views

Proof of correctness of the XL-algorithm for polynomial systems

Section 12.4 of G.V. Bard's Algebraic Cryptanalysis discusses the XL-algorithm (first reported by N.T. Courtois and A. Shamir in Efficient algorithms for solving overdefined systems of multivariate ...
2
votes
0answers
80 views

AKS primality test- Lemma 4.3, not following

I'm reading the AKS primality test paper as it is found here. I'm confused about a statement in Lemma 4.3: "Note that $(r, n)$ cannot be divisible by all the prime divisors of $r$ since otherwise $r$...
2
votes
0answers
45 views

Mersenne twister middle word

In some literature, as well as in Wikipedia, the middle term parameter m of Mersenne twister is called "number of parallel sequences". Why? What is meant here by "parallel sequences"?
1
vote
0answers
56 views

Absolute limit in Huffman encoding

I have computed the average code length using the Huffman encoding. Now, I am asked to compare the average code length with Absolute limit but I ain't sure about the absolute limit here is :( Could ...
1
vote
0answers
13 views

equivalent sub-keys in DES encryption

i am trying to understand the DES cryptosystem and was wondering: what would've happened if all of the sub-keys were equal? does it reduce the security? can we actually find the keys if we know all ...
1
vote
1answer
35 views

Underlying codes for Niederreiter cryptosystems

Niederreiter cryptosystem is usually described by a parity check matrix $H$ over $\mathbb{F}_{2^n}$. The minimum distance $d$ is given by $d := min\lbrace k \text{ such that there are $k$ linearly ...
1
vote
0answers
70 views

A tree-like data structure with rights delegation for distributed computing

Every actor can create a root node and delegate a right to add a child node. Every node contains name of its’ creator or who added it, and value S. Sum of all values S at the same level of the tree ...
1
vote
0answers
46 views

Is it possible to build a secure PRG from two functions one of them being a PRG?

Having two deterministic functions $G_1, G_2 : \left\{0,1\right\}^\lambda \rightarrow \left\{0,1\right\}^{\lambda+l}$, at least one of which is a secure PRG. Being $\alpha$ a constant, is it possible ...
1
vote
0answers
55 views

eVoting with Damgard-Jurik-Cryptosystem

I am trying to implement a secure elecetronic voting system. Therefore I found the Damgard and Jurik Cryptosystem. In their paper the authors describe a secure protocol for "A Length-Flexible ...
1
vote
0answers
61 views

On “practical” polynomial coefficients if P = NP

I got riddled by the following problem: Wikipedia states (without citation) Cryptography, for example, relies on certain problems being difficult. A constructive and efficient solution[Note 1] to an ...
1
vote
0answers
32 views

Generation of 11 bit random number

I need camera to sign one random line(there are something like 2000 lines) from the frame each second. At the beginning I have some 64 bits seed with high entropy from physical RNG and a secure ...
1
vote
0answers
28 views

Is there any knapsack-based cryptosystem that hasn't been broken?

I took part in the development of a knapsack-based asymmetric cryptosystem, and am currently planing to launch a campaign to promote it. Before we actually do, it occurred to me to research... what ...
0
votes
0answers
15 views

Is this Correct, the existence of cryptography requires $UP \cap Co-UP \not\subseteq BPP$

Is this Correct, the existence of cryptography requires $UP \cap Co-UP \not\subseteq BPP$? Or does it require $UP \not\subseteq BPP$?
0
votes
0answers
31 views

Books for learning Cryptocurrency

Please suggest a good for mathematical section of studying cryptocurrency.
0
votes
2answers
63 views

Undetectable error correcting codes

I have a 256 bit string (indistinguishable from random) which I wish to encode into a greater length string using an error correction code. The result must also be indistinguishable from random. It ...
0
votes
0answers
34 views

Asking for your help with LFSR, linear automaton

I am a software developer new to the site. I am currently learning about LFSR (linear feedback shift register). Every day I solve a question which is given to me, but today I am lost. I can not solve ...
0
votes
1answer
22 views

How to perform matrix multiplication in Mixing Columns step of AES?

I am studying AES and trying to implement it. But I am having difficulty understanding the Mixing Column step. In that step we have to perform matrix multiplication between the state matrix and ...
0
votes
0answers
16 views

Extracting text from a hidden image

Say i have cropped an image and have hidden some part of it, like shown below Is it possible for anyone to download this image and able to decipher what the hidden text is?
0
votes
0answers
29 views

Digitally signing a digital signature

I have the following question in a list of security exercises. What it can be the sense of digitally signing a digital signature? Sincerely I can't think of anything. Someone could answer?
0
votes
0answers
17 views

Abusing ElGamal in order to attack a known encrypted text

I saw a very interesting question regarding Elgamal cryptosystem that I don't know its answer. It is really interesting and I would be very happy if you could elaborate on it and explain the tricky ...
0
votes
0answers
22 views

learning the private key by reusing same random variable k in ELgamal

i wonder: if for some reason, someone, say alice, sends unencrypted messages to bob and signs it using elgamal signature, can oscar,the adversary, gain knowledge of the private key if alice reused the ...
0
votes
0answers
34 views

Is 'the bombe' technically a computer?what is technically meant to be a computer?

Some say that 'the bombe' created by Alan Turing is technically not a computer despite decrypting the codes. Why is it so? Is 'the bombe' technically a computer? First of all what is technically ...
0
votes
0answers
29 views

Secrecy rate of eavesdropper channel?

I want to find secrecy rate of a main channel in case of Gaussian broadcast channel. e.g. I have a single transmitter and a receiver where eavesdropper wants to eavesdrop the communication over ...
0
votes
0answers
51 views

What are some data mining algoritms used in finance?

I want to test the applicability of homomorphic encryption in the financial domain, as suggested in Can homomorphic encryption be practical ?. Now, I want to know what algorithms are used for ...
-1
votes
0answers
21 views

Are there any quantum resistant equivalents to RSA?

Are there any quantum resistant equivalents to RSA? Basically are there any methods of cyrtopgraphy that hame the same user as RSA but are resitant to quantum computers.
-2
votes
0answers
25 views

Solving subset-sum encryption (Princeton Creative Assignment)

The question: https://www.cs.princeton.edu/courses/archive/spring03/cs226/assignments/password.html Input files: ftp://ftp.cs.princeton.edu/pub/cs226/password/ The question asks to use a symbol table ...