1
vote
2answers
86 views

Weak and Strong Collision Resistance, again

Weak collision resistance (CR), or second-preimage resistance, is the property that given $x$ and $h(x)$ ($h$ a hash function) it's difficult to find $x' \neq x$ such that $h(x') = h(x)$. Strong CR, ...
2
votes
0answers
54 views

What is perfect collision-resistence in probability terms?

update: removed lots of stupidity... sorry. I didn't know I can be this stupid but I achieved it. 1. Goal Let $\mathcal{D}$ be the universal space of our plain data. Our goal is to find a function $...
1
vote
1answer
38 views

Is there any benefit to using a randomly chosen replacement strategy on a string before or after encrypting it?

This is more of a mental exercise for me than anything else. I've thought about doing something like this before, mostly to make a broken cipher a little more difficult to decrypt to plain text. I've ...
0
votes
1answer
34 views

SSL Traffic Inspection

Is the firewall decrypted my session? There is an error "Certificate Not Trusted" (Server Certificate changed to Firewall Cyberoam Certificate). Which public Key I got? Is Main server Public Key or ...
0
votes
2answers
61 views

Would a non-deterministic (read: randomized) compression algorithm be crypto-safe?

Would a compression algorithm that randomly shifts stuff around every iteration be TLS/crypto-safe? This randomization would prevent the same byte sequence from appearing twice in a row, thus making ...
4
votes
2answers
79 views

Does a key derivation function always generate an even distribution of bits in the resulting key?

I am a student of crypto. During our study course, we went into the AES-128 algorithm. All the examples given used an initial key k, 128 bits and we only briefly touched on the key derivation of ...
0
votes
0answers
26 views

Using Counters instead of MAC in CBC mode

I am wondering what are the implications of using a session counter appended to the end of a plaintext and then use a cipher in CBC mode to encrypt it vs. adding a HMAC or some form of keyed MAC to ...
0
votes
0answers
19 views

caesar cipher implemention and exection

I am trying to run one of the caesar cipher from https://competitions.cr.yp.to/caesar-submissions.html I have got the code for the cipher from https://github.com/floodyberry/supercop Can anyone help ...
2
votes
0answers
21 views

CRL number generation sequence

RFC 5280 states that the CRL number should be monotonically increase. I have seen this common practice of incrementing the CRL number by 1, everytime a new CRL is generated. But can i use epoch time ...
4
votes
1answer
35 views

Is it okay to use a variable-time RSA implementation to verify TLS certificates?

RSA as implemented by OpenSSL et al. needs to protect against side channel attacks, at a big performance penalty. However, TLS certificate validation involves no secrets. Therefore, I should be able ...
2
votes
2answers
108 views

Implementing RSA with small integers in CUDA

I have found some researches dedicated for speeding-up RSA calculations using CUDA. But I am wondering how they do that, given that the biggest unsigned int that could be declared in CUDA is 64 bit. ...
3
votes
0answers
58 views

Perfect secrecy is maintained for other plaintext prob distributions?

Suppose a cryptosystem achieves perfect secrecy for a particular plaintext probability distribution. Prove that perfect secrecy is maintained for any other plaintext probability distribution. Having ...
4
votes
1answer
92 views

How does a company like Apple keep its keys safe? [closed]

Whatever key is used to sign new iOS updates (for example) must be incredibly well-protected. How does a huge corporation like Apple keep those 4096 bits safe?! Same goes for SSL keys for websites ...
-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) ·(...
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 ...
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
208 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
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 ...
-2
votes
1answer
59 views

Affine Cipher - Greatest Common Divisor

Really simple question regarding the Affine Cipher. Can someone tell me how $3^{-1}$ is supposed to result in 9 in the following explanation below?
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 ...
0
votes
1answer
176 views

Cube-Root attack - RSA with low exponent

I have this RSA public key ...
1
vote
2answers
60 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
166 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
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 ...
3
votes
1answer
75 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
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 ...
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
61 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
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 ...
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 ...
1
vote
0answers
61 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
111 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
117 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
55 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
77 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
85 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
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
83 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
89 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
49 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
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 ...
3
votes
3answers
101 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?

15 30 50 per page