3
votes
1answer
71 views

4 x E = D in Simplified AES how it's possible?

Can anyone explain how it's possible through hexadecimal or Binary 4 x E= D
0
votes
1answer
229 views

Help with RSA-2048 crypto ransom virus [closed]

The RSA-2048 Crypto Ransom Virus has devastated me, I tried the backup method, the previous version, the Shadow Explorer, it deleted all my restore points, Its took out 5 HDs and my USB pen that ...
45
votes
1answer
3k views

Why does my SSH private key still work after changing some bytes in the file?

I (for a test) just randomly altered a private RSA key by opening it up in Vim and changing a few bytes. It is the private part of an SSH key pair used for logging in on a remote system. Puzzlingly, ...
4
votes
0answers
70 views

Secure entropy extractor for thermal noise collected from camera input?

I have read this paper (pdf) which talks about measuring the entropy of thermal noise collected from camera input. They estimate the minimum entropy at about 4 bits per pixel. Probably estimating 1 ...
0
votes
1answer
103 views

What is a branch number in the PAEQ algorithm?

I'm reading an article about authenticated encryption algorithm - PAEQ. It uses a permutation function AESQ, which has transormations from AES. And there is written about MegaSBoxes, which contain 4 ...
-1
votes
1answer
197 views

I homebrewed an algorithm. Is it secure?

This is a bit of a cross-posted question which I first asked at StackOverflow, however I was not satisfied with stackoverflow, so I came here for an in depth answer. I, as they say, "rolled my own ...
4
votes
3answers
123 views

Why are there $2^{56}$ possible DES keys when there are 64 key bits?

On forums I read DES has $2^{56}$ possible keys so it takes x times to brute force it with hardware x. But there are 64 total bits of which are 8 parity bits. But those parity bits are a ...
14
votes
3answers
2k views

Webcam random number generator

I have a question about random number generators. I have read from a real random number generator, based on a webcam ("randcam"). My problem is, that I do not really understand how the generation of ...
4
votes
2answers
152 views

How secure would hand ciphers be using a Block Cipher Mode?

I've been looking into different ciphers that require very minimal computation power (calculator, deck of cards, index cards and a pencil), i.e. hand ciphers. For the most part all methods typically ...
1
vote
1answer
51 views

TPM authorization Digest calculation

I am going through Steven Kinney's book; "Trusted Platform Module Basics", and pp 90 - 92 discuss how to calculate the authorization digest. He talks about 1H1, 2H1, 3H1, and 4H1 fields which I do not ...
-1
votes
1answer
43 views

Collision-Resistance Hash Function PRF

I am trying to solve the following question with an example/proof. The question is from Introduction to Modern Cryptography by Katz and Lindell. Any help would be appreciated.
2
votes
1answer
103 views

Doubling the block length of a given block cipher

IMHO the main essence of a Feistel cipher of block length $n$ is the working of a non-linear function $F$ that is applied to the two halves of the block of length $n/2$. Now suppose a certain block ...
3
votes
1answer
83 views

Known Plaintext Attack against 3-round SPECK48/96

I am attempting to break 3-round SPECK48/96 using a known-plaintext attack, provided with 10 PT-CT pairs. Here is a diagram: I have seemed to almost figure this out, but I cannot figure out how the ...
48
votes
7answers
36k views

Taking advantage of one-time pad key reuse?

Suppose Alice wants to send encryptions (under a one-time pad) of $m_1$ and $m_2$ to Bob over a public channel. Alice and Bob have a shared key $k$; however, both messages are the same length as the ...
2
votes
2answers
172 views

What values constitute failing for ENT tests?

The dieharder tests give a clear PASSED, WEAK, etc and I'm wondering what those thresholds ...
0
votes
0answers
16 views

How to generate a bilinear group of prime order p [duplicate]

I am trying to implement an IEEE Paper In Cryptography. I read many reference regarding an RSA key generation. But i am confused with above statement. Please someone explain me What it says with ...
4
votes
4answers
113 views

How to construct a collision resistant hash function that is not a one-way function?

How to construct a CRHF (collision resistant hash function) that is not a OWF (one-way function)? Not sure but I think it probably needs another CRHF?
3
votes
1answer
210 views

Why not use OAEP for signatures?

There seems to be a distinct lack of implementations of RSA signatures using OAEP to pad the digest. Other than the old, funky, padding schemes, it's PSS all the way. PSS seems to have the whiff of ...
2
votes
0answers
74 views

Problem with applying threshold scheme

For a report on threshold signature schemes, I have to explain a threshold signature scheme and give a simple example with numbers. A threshold signature scheme is a scheme in which a network of n ...
2
votes
1answer
123 views

How is a per round key generated in DES algorithm?

I am reading over a slide that I found online regarding the DES algorithm for encryption and I am a little confused about the per round key generation. From the slide below, I understand that each per ...
3
votes
4answers
400 views

Cryptography and FPGA

I see a lot of papers about FPGA implementations. For what kind of "concrete" application should we implement cryptographic algorithms on FPGA ? Which secured application require such a huge data ...
2
votes
3answers
131 views

Can spatial filters be used to factor composite numbers?

$Z=(N-XY)^2$ is a surface with absolute minima ($0s$) anywere $Y=N/X$. I know this question is naiive, but shouldn't it be possible to apply a lossy compression filter to this function which ...
3
votes
0answers
61 views

How to attack polyalphabetic affine cipher with only ciphertext?

How to attack polyalphabetic affine cipher with only the ciphertext? A polyalphabetic affine cipher can be seen as the composition of an affine cipher ($p \mapsto c \equiv a \times p + b \pmod{26})$ ...
0
votes
0answers
74 views

How to check if a function is significant or not?

f(n) = 1 / ( log n ) ^ 1/2 I know that this function is not negligible because it will never converge to zero even for large values of n. Now my question is, how ...
4
votes
2answers
88 views

Research for video game: Novice cryptography concepts [closed]

I'm making a video game which has some basic cryptography as a main base for puzzle design. I'm hoping players will get great puzzle challenge and learn a few cryptography concepts through playing the ...
0
votes
1answer
62 views

Hardware optimized stream ciphers?

As I understand it, ChaCha20 is slower than AES-CTR in hardware. Are there any hardware-optimized stream ciphers?
3
votes
3answers
114 views

Fast forwarding hash functions

We know that a good hash function is a one way/trapdoor function. Easy to calculate one way, harder to work out a previous state. I was wondering if anyone knew a good hashing system that allowed ...
0
votes
0answers
8 views

SAM module in Payment transactions & cryptogram key storing

As you know because of low security factors,General MCU's are not appropriate choice for storing Transaction or cryptograms keys.Therefor embedded systems developers used SAM modules for secure ...
5
votes
1answer
1k views

Confusing XOR notation in textbook sample solution

I am preparing for the midterm exam in my Data Security class so I am trying to read and understand the textbook's exercise questions. The sample solution at the end the textbook makes this problem ...
2
votes
1answer
223 views

Simple digital signature example that one could compute without a computer?

I am working on a document to explain Bitcoin to students. But I am having a hard time translating the principle described in §2 of the Bitcoin whitepaper in layman's terms. There is a great question ...
63
votes
8answers
6k views

Layman's explanation of encryption backdoors

Some times I read about "backdoors" in encryption algorithms in the media. I'd like to understand what such a backdoor actually consist of. Is it: a) a hidden weakness in the math formulas that ...
37
votes
7answers
33k views

Are there two known strings which have the same MD5 hash value?

Is there an example of two known strings which have the same MD5 hash value (representing a so-called "MD5 collision")?
15
votes
3answers
3k views

Is 80 bits of key size considered safe against brute force attacks?

I came across KATAN Family of Ciphers for small domain input blocks . They cipher arbitrary block lengths 32,48,64 but their key size 80 bits only. Is 80 bits of key size considered safe with ...
1
vote
0answers
24 views

Some confusions about Repeated Doubling Algorithm?

The following repeated point doubling algorithm is taken from the book Guide to Elliptic Curve Cryptography by D. Hankerson, A. Menezes, and S. Vanstone on page#93. Clearly, this algorithm is ...
12
votes
4answers
3k views

Why is the IV passed in the clear when it can be easily encrypted?

The initialization vector (IV) is exclusive or'd against the plain text before encryption for the first block sent in order to prevent an attacker from learning that duplicate message blocks are being ...
3
votes
0answers
76 views

Implementation specific differences between RDRAND and RDSEED

I've read Intel's The Difference Between RDRAND and RDSEED and Intel Digital Random Number Generator (DRNG) Software Implementation Guide, but I have some open questions that are specific to usage in ...
3
votes
3answers
375 views

For AES CBC, can I encrypt the IV with AES ECB and the same key and include it with the message?

Is it safe to use this process: Generate Key, IV Encrypt Message with Key, IV and AES CBC into EMessage Encrypt IV with ECB into EIV Send over EIV + EMessage Then the recipient Decrypt EIV with ...
-1
votes
1answer
49 views

Could someone explain the given algorithm?

The following snapshot of the algorithm is taken from the book Guide to Elliptic Curve Cryptography published by Springer 2004. I don't understand that why at the statement 9.1 if both $T_1$ and ...
1
vote
2answers
96 views

AES S-Box Affine Mapping - how to do it?

For the byte substitution layer in AES how do we determine B(i)? I follow how to use the multiplicative inverse table and using that to get B`(i), but how do I actually calculate the affine mapping? ...
0
votes
0answers
113 views

For each of the following modifications to the Merkle-Damgard transform, determine whether the result is collision resistant or not

$(a)$ Modify the construction so that the input length is not included at all (i.e., output $z_B$ and not $z_{B+1}=h^s(z_B||L)$). $(b)$ Modify the construction so that instead of outputting ...
1
vote
1answer
127 views

AES key and block size

I am trying to understand $AES$ and I wondered what happens in the case of a $128$ bit block size and a $256$ bit key. All documents I read about $AES$ told me the key expansions algorithm for $128$ ...
31
votes
6answers
7k views

Is there a simple hash function that one can compute without a computer?

I am looking for a hash function that is computable by hand (in reasonable time). The function should be at least a little bit secure: There should be no trivial way to find a collision (by hand). For ...
3
votes
2answers
92 views

Extend OTP on random data?

If Alice and Bob both start with a shared OTP $P_0$, which is 256-bytes long, and Alice wants to send a 512-byte message, would it be secure to send the first 256 bytes with standard OTP (...
-1
votes
1answer
80 views

Can we use merely permutation to hide a message?

This question is related to this: When all shares of a secret are given to adversary as a permuted matrix I think the below question is a simplified version of that. Assume we have a 40-bit ...
2
votes
0answers
37 views

What is the canonical way of creating merkle tree branches?

I'm currently looking into creating some compact merkle tree branches to prove that a given hash was included in a given merkle root. My initial thought was to list the leaf, the merkle root and all ...
4
votes
2answers
97 views

Is the RC4 keystream random or not?

I have cause to use the PRNG half of RC4, but am seriously confused as to the randomness of its output. (Only the PRNG half.) On the one hand, there is a large body of literature finding ever ...
1
vote
1answer
527 views

Precisely how does CBC mode use the initialization vector? [duplicate]

As I understand it, AES in CBC mode does an XOR of the 128-bit initialization vector and the first 128 bits of plain text. Is this correct? I am using the PHP 5.3 openssl extension in aes-256-cbc ...
1
vote
0answers
29 views

Data in frequency modulated audio [closed]

I'd like to have a peek at the firmware of a piece of Hardware. Its firmware is available as a .wav file to be uploaded via audio jack. https://drive.google.com/open?id=0B6S_PcWWM1YlQnNwT2FSMnFzVE0 ...
6
votes
1answer
81 views

KFB mode - key feedback

Please, could someone explain to me how the Key feedback mode (KFB) mode works and what the IV in output block stands for? And what properties does the "constant input" has to provide? Should it be ...
0
votes
0answers
40 views

Non CPA on custom MAC

While preparing for a crypto exam there is a task we don't really understand: task Let $E_K$ be a permutation $\{0,1\}^b \rightarrow \{0,1\}^b$ defined by a blockcipher with the key $K$. Let $M = ...

15 30 50 per page