-4
votes
1answer
56 views

Perfect secrecy of affine cipher

Given any probability distribution P r on the set $\{k ∈ \mathbb{Z}_{26} : \gcd(k, 26) = 1\}$. Show that the Affine Cipher achieves perfect secrecy if the key (k, a) is used with probability $Pr(k) ·(...
4
votes
2answers
119 views

Using One Time Pad with a block cypher

The One Time Pad is often described with a xor cipher. This is nice to show the theoretical strengths of the one time pad but not so great in real world scenarios where key reuse is a danger. So Is ...
2
votes
1answer
47 views

reconstructing data on a noisy channel?

I have an interesting situation where I have a block cipher and a noisy channel. The interesting thing is that I happen to know much about the data. The cipher is a balanced Feistel network, and for ...
2
votes
1answer
206 views

Client Puzzles and HMAC

I'm learning about client puzzles for DoS (Denial of Services) Protection, and I came across this question. For each request, the server sends the client a freshly generated random challenge r and ...
-3
votes
1answer
54 views

How does the math part of RSA work? [duplicate]

I understand the theoretical part of RSA (the concept of public and private keys), but I don't understand the mathematical part. Can anyone please explain it to me in simple terms? Thanks.
1
vote
1answer
46 views

Is it possible to brute force a single smaller variable in $\operatorname{HMAC-SHA512}(k, a\ ||\ b\ ||\ c\ ||\ d)$?

Given $c' = \operatorname{HMACSHA512}(k, a\ ||\ b\ ||\ c\ ||\ d)$ and the 32-bit integers $a$, $b$, $c$, and $d$ is it feasible to alter $b$ and produce a valid MAC under the unknown key? I ...
3
votes
2answers
26 views

X509 converted to Encrypted and Signing keys

We have proprietary tool which takes a p12 file and generates a .key file. Inside the key file, I see two PEM formatted sections: Encrypting Certificate and Signing Certificate. When I open them on my ...
1
vote
1answer
38 views

Government root SSL certificate possible vulnerabilities [closed]

I'm writing an article about new government law in Kazakhstan. The law was accepted in December, but now one of our providers announced information for small and medium business how to install ...
0
votes
1answer
50 views

Is sharing the RSA public key secure?

I am trying to understand how RSA public key cryptography works. I have the following questions: Are any attacks / compromises possible if a server sends its public key $(n,e)$ in the clear to a ...
2
votes
3answers
160 views

What is the difference between substitution cipher and block cipher?

I'm studying(and clearing my head) about block cipher. I started from Caesar Cipher which can be considered as a kind of substitution cipher (if my understanding is right). And an ideal substitution ...
1
vote
0answers
70 views

Differential bound of the S-Box in GOST R34.11-2012

In Russian GOST R34.11-2012 LPS-transformation is used. LPS gets all of its non-linearity from the 8-bit S-box S, which apparently has been designed to offer resistance against classical methods of ...
3
votes
1answer
91 views

What is the intuition for ECDSA?

I understand DH and ElGamal and RSA encryption/signatures. But when I look at ECDSA (or plain DSA), it seems like the formulas are just pulled out of thin air. I can verify that the algebra used in ...
6
votes
1answer
111 views

Encoding scalar values to points on Ed25519

I'm interested exploring key derivation and threshold signature protocol that require point arithmetic (addition) on the private scalar values and $S$ values of the signatures in ed25519. ...
1
vote
1answer
94 views

Really simple RSA style public private key generator

I am giving a talk to high school students and would love to do a real life encryption/decryption demonstration. I am not too familiar with the maths but is it possible to create like a 5-10 bit ...
1
vote
1answer
82 views

Better security than SHA1 for signature?

An application that I maintain uses Sparkle Update to update itself. I expect attacks from high level attackers (China, USA's NSA, etc.) and have some questions about how secure the cryptography ...
5
votes
1answer
515 views

One-Way property of Random Oracle

I'm currently working on a proof in the Random Oracle model, and could not find the formal argument on why the random oracle is one-way (i.e. for an Oracle $O$, it is easy to calculate $x=O(n)$, but ...
3
votes
1answer
53 views

Difference between Constructor and Destructor terms

I was thinking that in the formal model (or symbolic model?) the destructor terms were used to model processes that could abort generating some errors or something like that. But then, I realized that ...
1
vote
1answer
80 views

Determine whether a given function is a pseudorandom generator/function

I am trying to solve the following three tasks (for exam practice, not as a homework): Define $𝐺 : \{0,1\}^* \rightarrow \{0,1\}^*$ by $G(x_1,...,x_n) = 𝑥_1 \oplus 𝑥_2,𝑥_1,⋅⋅⋅,x_n.$ Prove that ...
1
vote
1answer
60 views

Non-Degeneracy of the Weil pairing

In this YouTube video, Dan Boneh mentions that if both points are defined on the base field then the pairing is degenerate. Why is that? And specifically is this true if I use the Weil Pairing?
1
vote
0answers
60 views

Fast algorithm for reduction modulo a prime [closed]

If the prime is $p=2^a\cdot3^b+1$ , is there any fast reduction technique modulo this prime?
3
votes
3answers
100 views

In an A5/1 stream cipher, why do the registers have a stepping probability of 3/4

I know that the probability of each register to step is 3/4 but I have yet to find an explanation of why. Can anyone explain this to me?
0
votes
0answers
21 views

How were the diffusion statistics for norx calculated?

I was reading the norx specification and came across this section, which provides some kind of statistics about the diffusion of the norx round function. However, I don't see how these values were ...
6
votes
1answer
84 views

Are CSPRNGs quantum-resistant?

It's fairly well known that Shor's algorithm kills RSA, DSA, ECDSA, DH, ... and that symmetric ciphers (AES and 3DES) and hashes (SHA-2, SHA-3) are safe as long as you double your key size / output ...
1
vote
1answer
113 views

HMAC-SHA1 vs. AES

This might be a very silly question, but I am a total novice in encryption. I don't know where to start searching for an answer to this problem. I am building applications using a proprietary ...
4
votes
1answer
156 views

Yubico's take on U2F key wrapping

I've been reading up on Yubico's implementation of U2F. What I understand so far is that two things are calculated. So upon registration first you calculate a private key by $PrivateKey = HMAC(AppID+...
3
votes
0answers
73 views

How common are weak RSA keys?

There exist certain attacks that can be used against RSA keys whose prime factors are of specific forms, such as one by Coppersmith. How common are these RSA keys? If you generate primes randomly, ...
2
votes
0answers
69 views

how to verify subset of hashes from hash list

I need to verify a couple hashed (SHA256) integers from a list of approximately 50 hashed integers in a message. The list can be divided into groups. The (plain) integer data is not in the message, ...
1
vote
2answers
611 views

How many oracle calls to break an affine cipher in a chosen plaintext attack?

Assuming the ability to launch Chosen Plaintext Attacks (CPA), how many oracle calls does an attacker need to break the affine cipher? How does it work?
3
votes
1answer
67 views

Affine cipher and plaintext attacks, how to find the base modulo?

Last year, a question concerning plaintext attacks was posted at Mathematics.SE: “Plaintext attacks: affine cipher”. I have no problem to see how to solve it when we are given two ciphertexts and $(...
0
votes
0answers
19 views

Problem with braking SASAS type of encryptions

I am reading the paper Structural cryptanalysis of SASAS. I understood it till the section Recovering of layers S1 and S3 on page 6. However because of my limited understanding of mathematics, I am ...
1
vote
0answers
15 views

IX509Extension XCN encoding?

I understand from reading MSDN that the X509 v3 extensions must be handcrafted. This involves the CRL, AIA, name and policy constraints, policy mapping, private key usage period, and subject ...
1
vote
1answer
154 views

ABE Schemes - Access Structures & Performance

I'm reading this article, CP-ABE with constant-size keys for lightweight devices and in the Table 1, are there these access structure: Threshold, Tree, ($n$,$n$)-Threshold, LSSS, AND gates. I have 2 ...
0
votes
0answers
19 views

is it possible to reverse engineer the key on a AES-256 encryption? [duplicate]

If I have the original text and the encrypted one, is it possible to reverse engineer the key? And more importantly is it doable ? I tryed to look up the algorithm but i'm way too rusted and with no ...
1
vote
0answers
48 views

Is it possible to create a detection oracle for all block cipher modes? — ciphertext-only cryptanalysis

I have made an ECB/CBC detection oracle, and am now trying to make a detection oracle that can differentiate between CBC/CFB/OFB/CTR/etc. I can already tell ECB apart from the others due to this ...
0
votes
0answers
86 views

Difference between AES-CCM and AES-CCM*

I'm trying to understand the different between AES-CCM and AES-CCM* (as defined in IEEE Std 802.15.4™‐2011, Annex B). I see that there are more restrictions on L and M and also M=0 is allowed: L = 2 ...
0
votes
0answers
38 views

timing attack ecdsa scenario in software implementation

Timing attack ecdsa in software with standalone program is it possible? There is paper discuss timing attack ecc in client server scenario in openssl,but i still dont understand it. Any body can ...
0
votes
2answers
124 views

Is this method of encryption theoretically unbreakable?

I implemented a Stream Cipher using Cryptographically Secure Random Numbers for the key values. The key stream was as long as the plaintext stream. This key data set won't be reused. Have I met all ...
1
vote
0answers
71 views

How to calculate min entropy of the output of PRNG?

As min entropy of a random variable provides the maximum probability of getting the desired realization of the random variable, which is the most conservative way of measuring the uncertainty of ...
1
vote
3answers
137 views

List of post quantum cryptography protocols [closed]

What are the post quantum cryptography protocols that have been proposed until now? I know about McEliece cryptosystem, and LWE scheme. What are the others? Can you provide me a list or a website ...
1
vote
1answer
40 views

What is the last value in a cipher suite?

I understand that a cipher suite should contain the MAC algorithm at the end. So ECDHE-RSA-AES128-SHA256 should use SHA256 in HMAC for the MAC. But what about the ...
3
votes
1answer
49 views

Bitwise operation question with shifting involved

I am trying to find a value of X (32 bits) such that ((X XOR a)+b)<<3 = (X+c) XOR d. <<3 means shift left 3 bits. a,b,c and d are all constants which have been determined elsewhere. ...
0
votes
2answers
46 views

How to find element g order q, given 2 large primes p and q where q|p-1

i have calculated 2 large primes, $p$ (minimum 2048 bits) and $q$ (minimum 224 bits), where $p-1 \mod q = 0$ by using SageMath. $p = $...
1
vote
1answer
430 views

Decrypting an Affine Cipher with known characters

I am trying to cryptanalyse multiple cipher–texts that I know are encrypted by different Affine ciphers. I have already analysed the frequency that each character occurs, and compared it to a ...
0
votes
1answer
273 views

Affine cipher: calculate the key from a known plaintext/ciphertext pair

Suppose I have a ciphertext that I know is encrypted using an affine cipher in $\mathbb{Z}_{26}$. The plaintext begins with es and the corresponding ciphertext is <...
-1
votes
1answer
453 views

Prove that the affine cipher over Z26 has perfect secrecy if every key is used with equal probability of 1/312

Prove that the affine cipher over Z26 has perfect secrecy if every key is used with equal probability of 1/312. Just some guidance/help with this problem would be greatly appreciated not sure how to ...
1
vote
1answer
808 views

Cryptanalysing Affine cipher

I am trying to cryptanalyse a cipher–text encrypted by Affine cipher. The encryption formula is: $c = f(x) = (ax+b)\bmod m$, where $a$ and $b$ are unknown constants; $x$ is a plain-text symbol, and $...
5
votes
1answer
309 views

Affine Cipher over an Affine cipher

I would like to know your view about the title, encrypting a plain text with an affine cipher then encrypting that ciphertext once more using the same cipher, but of course different keys. Would it be ...
1
vote
2answers
83 views

Decrypt affine cipher given encryption key [duplicate]

i have a ciphertext C=TLNJG formed using the equation c=(7p+11) mod 27,c equivalent to numerical equivalent character of ciphertext and p the plaintext how do i ...
3
votes
1answer
3k views

Knowing the key, how do I decrypt the affine cipher?

I have an encryption function $$E(p) = (ap + b) \mod{26}$$ where the parameters are $a=7$, $b = 10$, and $p$ is the plaintext letter. I was asked to decrypt the ciphertext ...
1
vote
1answer
52 views

How to compute the discrete logarithm of Diffie-Hellman with a composite modulus?

Imagine $n = pq$ with $p-1 = 2 p_1 p_2$ and $q-1 = 2 q_1 q_2$. I can compute the discrete logarithm of $y = g^x \pmod{n}$ by computing the discrete logarithm of $y$ modulo $p$ and $q$. But then how ...

15 30 50 per page