Skip to main content

Questions tagged [cryptography]

Questions on the mathematics behind cryptography, cryptanalysis, encryption and decryption, and the making and breaking of codes and ciphers.

1 vote
1 answer
71 views

Elliptic curves and zero-knowledge constructions are not shown over non-prime finite fields. Why?

What are the reasons that cryptography-related constructions -- such as featured in excellent explainers on elliptic curves on RareSkills and Practical Cryptography for Developers, and all the ...
Jim's user avatar
  • 538
0 votes
1 answer
53 views

What background is needed to understand lattices?

I'm trying to read the paper Finding a Small Root of a Bivariate Integer Equation; Factoring with High Bits Known but the subject matter is over my head. I have an academic background in Applied ...
ender's user avatar
  • 23
0 votes
2 answers
131 views

What does "a key is uniform" mean in cryptography?

In the lecture on Coursera platform, the inequality below was shown: there exists an algorithm $A$ such that $$\underset{{k \overset{R}{\longleftarrow} \mathscr{K}}}{\operatorname{Pr}}\left[\left.A(G(...
Iris's user avatar
  • 29
0 votes
1 answer
120 views

What does $\mathbb{Z}_2^3$ mean? [closed]

What does $\mathbb{Z}_2^3$ mean? Is the subscript $2$ a modulo and the superscript $3$ dimensions of each element? I am studying lattice cryptography and set theory and I would like to know the how ...
smith33444's user avatar
0 votes
1 answer
58 views

Finding the period of the BBS sequence

Let $n=pq$, where $p,q$ are primes and $p \equiv q \equiv 3 \mod 4$. Choose an integer, $x_0$, such that $x_0$ and $n$ are co-primes. We define the sequence: \begin{align} x_i = x_0^{2^i} \mod n \end{...
Giorgos Mitropoulos's user avatar
0 votes
0 answers
120 views

Unexpected Result from Finite Field Calculations in GF(2^8)

I'm performing calculations within the finite field $GF(2^8)$ and I can't seem to get the expected results. This is my first time working with finite fields, so my understanding is quite basic. I ...
DurangoOlsen's user avatar
1 vote
1 answer
30 views

Distinct derivations of polynomial over finite field

I am a student studying algebra and cryptography. I wonder below question is possible. Can I make some polynomials $f(x)$ over finite field that all derivations $f^{(k)}(x)$ are distinct when x is ...
hhhbbb's user avatar
  • 13
0 votes
1 answer
71 views

Prove that if $e.d \equiv 1 \bmod (p-1)(q-1)$ then it’s impossible to have $e.d \equiv 1 \bmod pq$

I am studying R.S.A. cryptosystem and here is the question that came to my mind. Let’s pick $p, q$ to be two primes and $n = p * q$. From that we calculate Euler’s totient function: $$ \phi(n) = (p - ...
QuestionEverything's user avatar
0 votes
0 answers
51 views

Time to Find an Elementary Antiderivative of an Elementary Differential Form?

So, in encryption theory, a basic principle is that one has an operation that can be computed in a "forward direction" relatively quickly but for which computing in the "reverse ...
Jeffrey Rolland's user avatar
0 votes
0 answers
31 views

Testing a Pseudo-Random Number Generator Algorithm

I created a pseudo-random number generator that creates random bits from given numbers. For better visualization, suppose that we have inputs "a", "b", "ab", "abc&...
Severus' Constant's user avatar
2 votes
0 answers
93 views

About calculating isogeny between two elliptic curves

I'm trying to understand Vélu formulas for calculating isogenies. I took an elliptic curve $E: y^2 = x^3 + 3x + 5$ over $GF(7)$. So I've got the following points on this curve: \begin{equation} \{\...
tuner007's user avatar
0 votes
1 answer
229 views

Binary multiplication in Galois Field GF(2^8)

I am working on a project (high school), and I need to explain the process of AES MixColumns for one of the parts. I am trying to show an example of the matrix multiplication in MixColumns that uses ...
Jacob V's user avatar
0 votes
0 answers
44 views

Are high-dimensional versions of NTRU cryptosystem more secure?

The basis for this question is a 1-dimensional NTRU cryptosystem. After some literature inspection I have found out it can be also generalised into higher algebras: quaternions (QTRU) and octonions (...
maciek's user avatar
  • 239
0 votes
0 answers
47 views

ElGamal signature scheme problem and unsure whether my calculations are wrong or that's the answer.

Trying to solve problem with verifying a message through the ElGamal signature scheme and I end up getting two different values. I'm given a prime number $p = 881$, $e_1 = 3 d = 60$, random value $r = ...
jb1145's user avatar
  • 1
0 votes
1 answer
80 views

Clarification on Multiplication in $GF(2^3)$ vs. Boolean Algebra

While experimenting with finite fields, specifically $GF(2^3)$, I stumbled upon a puzzling situation when comparing multiplication operations to those in Boolean algebra. Let's take two elements $A$ ...
ZenithZero's user avatar

15 30 50 per page