1
vote
0answers
71 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 ...
0
votes
1answer
189 views

Cube-Root attack - RSA with low exponent

I have this RSA public key ...
1
vote
2answers
61 views

Using same encryption key in different schemes

Is it safe to encrypt possibly same plaintexts with 2 different algorithms using same secret encryption key? This question is similar to this question except they use 2 keys. More formally: $E_k(m) = ...
2
votes
3answers
206 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 ...
3
votes
2answers
27 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 ...
3
votes
1answer
92 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 ...
3
votes
1answer
77 views

How can I formally verify fuzzy commitment scheme based security protocol?

I am currently working on designing a security protocol which involves usage of fuzzy commitment schemes, for. eg Reed-Solomon codes which allows us to tolerate a certain level of error. I was ...
1
vote
1answer
101 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
86 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 ...
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 ...
1
vote
1answer
67 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?
4
votes
2answers
122 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 ...
5
votes
1answer
516 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 ...
1
vote
0answers
67 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?
4
votes
1answer
118 views

Understanding Hellman's TMTO

I am trying to understand the basic TMTO by Diffie Hellman as described here. I am having trouble understanding this passage here: Hellman had the idea of storing the dictionary in the form of ...
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 ...
1
vote
1answer
132 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
58 views

VIC cipher author known?

Does anybody know if the design of VIC cipher is attributed to anybody? I've tried Google and found nothing. There are quite a few sites describing the method in detail, a few implementing it ...
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, ...
1
vote
1answer
81 views

Are developers expected to implement Diffie-Hellman key exchange themselves?

I noticed that the GO standard library has some really nice functions for performing AES encryption / decryption in various modes. However, I couldn't (yet) find anything for Diffie-Hellman key ...
6
votes
1answer
86 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 ...
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
19 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
84 views

Certificateless cryptography Implementation

Hello guys I am trying to implement Certificateless Cryptography algorithm with reference to this base paper. Right now I am trying to implement the code in java. ...
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 ...
0
votes
0answers
92 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 ...
1
vote
0answers
50 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
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
128 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 ...
3
votes
3answers
107 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?
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
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 ...
1
vote
1answer
97 views

Encrypting a string as smaller pieces vs. encrypting it as a whole

Is there any difference between these two ways to encrypt a string using FPE? Say the string has the format is specified by this rule First part is in the set $S = \{\text{AA,AB,AC,BA,BB,BC,CA,CB,CC}...
3
votes
1answer
52 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. ...
1
vote
3answers
144 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
2answers
137 views

Best non-digital cipher?

Is there an undisputed cipher that was considered the best before the computer age? (This is not suppose to be a discussion, it's either a yes or no.) Please give a brief description why it is yes ...
1
vote
1answer
82 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
43 views

Monoalphabetic cipher using different languages in the same plaintext

Today I learned the principle of the monoalphabetic cipher. It's simple to decrypt a ciphertext written all in the same language (english for example) because I can use the syntactic properties as ...
0
votes
2answers
47 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
2answers
89 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 ...
2
votes
0answers
54 views

Prove that the given scheme is CPA secure or not

Given: F is a length preserving PRP. Encryption scheme $\Pi$ for messages of n/2 bits where: $m\in\{0,1\}^{n/2}$ $k\in\{0,1\}^n$ Enc: Select a random string $r\in\{0,1\}^{n/2}$ and output $c\...
1
vote
1answer
43 views

Composite vs Prime Order Groups in Attribute Based Encryption

Reading about Accountability in ABE currently and the paper "White-box traceable ciphertext-policy attribute-based encryption supporting flexible attributes" when comparing its system with an existing ...
1
vote
2answers
55 views

Merkle signature scheme

I was browsing the Wikipedia article on Merkle signature schemes and noted that it says: The number of possible messages must be a power of two[…] Why is that? ...
1
vote
0answers
73 views

A topic for my master thesis on post quantum cryptography [closed]

I am a master´s student. I am interested to work on post quantum cryptography. None of my professors are offering any topic this year related to post quantum cryptography. However I have the freedom ...
1
vote
0answers
46 views

Rijndael variant using AES for key schedule?

The weakest part of Rijndael is considered to be the key schedule (I believe that this is true for all variants, including ones not standardized as AES). One solution to this problem is to use (...
1
vote
2answers
50 views

Tell where messages begin and end in a series of ciphertext blocks?

With block ciphers, I understand that the plaintext is first broken down into the right-sized blocks, padded, and then encrypted into the same number of cipher blocks. Once these blocks are sent over ...
3
votes
2answers
77 views

Non primitive lfsr sequence

Given a non-primitive LFSR sequence (i.e number of states is less than $2^n - 1$); how do we find out the the characteristic polynomial? Will Berlekamp-Massey algorithm work in this case? for example;...
6
votes
1answer
175 views

Is there any benefit to verifying PKCS#7 padding when using AES CBC and HMAC?

As I'm using HMAC to ensure integrity and authenticity of the ciphertext, is there any additional security benefit to verifying PKCS#7 padding when decrypting using AES CBC? A previous question asked ...
3
votes
1answer
54 views

Is rubberhose cryptanalysis a sidechannel - formally?

I recently was engaged in a discussion in Sec.SE where somebody used the term "sidechannel" to actually mean "circumvent the encryption". By what he said it was clear, that he wanted to not bother ...
2
votes
1answer
61 views

Why is $Mac_k(m_1||m_2) = ⟨F_k(m_1), F_k(m_1 \oplus \overline{m_2})⟩$ not a secure MAC?

I am preparing for an exam and trying to solve the following question I found on the internet: Let $F_k$ be a pseudorandom function. Show that the following MAC for messages of length $2n$ is ...

15 30 50 per page