All Questions
0
votes
0answers
13 views
One time Pad Adversary
I like know Why $Pr[\mathsf{PRIV_{EAV}}(\Pi,A,n)=1] = 1/2$, when $\Pi$ is a One Time Pad. I trying:
$$Pr[\mathsf{PRIV_{EAV}}(\Pi,A,n)=1] = Pr[b'=0|b=0]Pr[b=0] + ...
2
votes
1answer
63 views
0
votes
1answer
55 views
Physical Level Encryption
What types of algorithms that are capable of signing a message are out there that run on a physical level, e.g. lacking the infrastructure of a standard PC, no memory, processor or motherboard in the ...
1
vote
1answer
61 views
Are there any hand ciphers not obsoleted by computer cryptanalysis?
Computerized cryptanalysis has obviously made formerly "secure" hand ciphers like Playfair, Four Square, and the Hill Cipher obsolete because they can be defeated in seconds. But is there a hand ...
1
vote
1answer
39 views
Is this algorithm secure?
I recently found this site, proposing a hashing algorithm for passwords.
They describe the following:
pad the password on both sides with SHA1(email) to ...
1
vote
3answers
69 views
Is Base64(SHA1(GUID)) still unique like the original GUID?
Basically what the title is; GUIDs are unique by design. If you run the GUID through SHA1 and then Base64 the hash, will the resulting string have the same guaranteed uniqueness as the GUID, or not?
0
votes
2answers
52 views
Why this k parameter is in unary in adversary PPT algorithm? [duplicate]
While reading some text on cryptography, I found that algorithm $A$, that the adversary (called Eve by convention) runs to break the cipher message, needs two parameters, candidate message ($y$) and ...
-4
votes
1answer
33 views
How to calculate cycles per byte [closed]
I have this data:
processor clock frequency: 2,1 ghz
message length: 16 byte
Speed: 4,3 Mbytes/s
how can calculate cycles and cycles per byte?
1
vote
1answer
70 views
Polynomial multiplication and division in 2^128
I want to multiply and divide polynomials, and implement the extended Euclidean
algorithm for polynomial greatest common divisors, over a Galois Field of size $2^{128}$. Moreover, I want to use the ...
2
votes
1answer
74 views
Alternatives to HMAC + CBC?
I'm looking at using HMAC + CBC. The combination looks like this:
ciphertext = AES256(text, k1)
data = HMAC-SHA256(iv | ciphertext, k2) | iv | ciphertext
Where:
...
2
votes
2answers
49 views
What are the potential security impacts of using CRAM-MD5 for Emails, when not using an SSL connection?
Background: My current server-provider tells me it's no problem to store the passwords in plain-text in the database, saying he has to do so because they use CRAM-MD5 for email authentication. But ...
2
votes
1answer
61 views
How does OAEP improve the security of RSA?
The heart of OAEP algorithm used for RSA encryption are the cryptographic hash functions $H$ and $G$.
Does everybody (so also an adversary) know these functions?
If YES: How does it help the ...
3
votes
1answer
54 views
When truncating an AES MAC value by “w” , how do I justify that “w” is still negligible?
I'm taking an online class on cryptography at corsera.org / Stanford, and the professor is explaining that it's OK to truncate an AES MAC to $w$ bits as long as $1/2^w$ is still negligible (say $w ...
16
votes
1answer
334 views
Selective format-compliant JPEG encryption?
I am working towards building a format-compliant encryption system for pictures. The aim of it is to be able to obscure specific areas of a picture (i.e. faces, car license numbers...) while keeping ...
1
vote
1answer
88 views
Is this a sensible cryptographic protocol intending to reduce the impact of compromised security?
I'm in the process of designing a cryptographic protocol which will reduce the impact an attacker will have if they gained root access to a server storing data.
The basic crux of it is that keys ...
0
votes
2answers
81 views
Generate fixed length cipher text from arbitrary length plaintext
Using an encryption algorithm like AES, is it possible to generate a fixed length cipher text no matter how long the plain text becomes?
2
votes
2answers
107 views
Generating IV in TLS 1.2
I'm writing a TLS 1.2 implementation (in C#) using a custom protocol.
My question is how to generate the IV attached to each message, I don't want to use RandonNumberGenerator because I've heard it ...
1
vote
2answers
106 views
Help me describe/identify this challenge-response protocol/algorithm?
My area of expertise is reverse engineering, specifically embedded systems. I do attack cryptographic systems, but this largely involves key recovery or exploiting the implementation.
I was asked to ...
0
votes
2answers
148 views
SHA-1:Is there any mathematical result that gives us the minimum number of 1's in a 160-bit SHA-1 hash output?
Is there any mathematical result that gives us the minimum number of 1's in a 160-bit SHA-1 hash output? What is the probability that a 160-bit SHA-1 hash output contains at least 128 1's?
3
votes
1answer
153 views
Understanding Feldman's VSS with a simple example
I'm trying to understand Feldman's VSS Scheme. The basic idea of that scheme is that one uses Shamir secret sharing to share a secret and commitments of the coefficients of the polynomial to allow the ...
1
vote
2answers
60 views
Is Functional Encryption about Access Control over encrypted data alone?
Informally, In functional encryption system , a decryption key allows a user to
learn a function of the encrypted data. But all i see is that the function acts as an access control over the data.
...
1
vote
2answers
89 views
True random numbers generated by sensors
Is using sensor raw data a good way of generating true random numbers? I mean using an IPhone's gyro/accelerometer raw output as a base for generating an array of true random numbers.
2
votes
1answer
1k views
How to solve MixColumns
I can't really understand MixColumns in Advanced Encryption Standard, can anyone help me how to do this?
I found some topic in the internet about MixColumns, but I still have a lot of question to ...
-4
votes
0answers
28 views
pseudo random sequence and permutation functions [closed]
Iam doing my Master thesis in enhancing of an encryption algorithm by using of a pseudo random sequence generators to create a 16*16 shared table and apply a permutation function on it. one of the ...
0
votes
0answers
29 views
calculating beta for elgamal elliptic curves
Suppose we use elgamal elliptic curves for secure communication. Bob selects a prime $p$, an elliptic curve $E$, a point $\alpha$ on $E \pmod p$, and a secret integer $f$. Suppose that Bob has ...
0
votes
0answers
34 views
SHA-1: Is there any mathematical result that gives us the minimum number of 1's in a 160-bit SHA-1 hash output? [duplicate]
Is there any mathematical result that gives us the minimum number of 1's in a 160-bit SHA-1 hash output? What is the probability that the 160 bit result contains at least 128 1's?
0
votes
1answer
139 views
Anonymity in end to end encryption
Considering a scenario of anonymous data transfer between seller and buyer using proxies. If we consider that there are three proxies that are being selected by buyer to obtain data from different ...
0
votes
3answers
276 views
Is AES really used for Top Secret stuff?
I've read almost everywhere that AES-256 can be used for Top Secret material (in the US). Is it really used or is it some kind of decoy to hide the more advanced algorithm they might use ?
2
votes
1answer
240 views
Partial collisions for md5
Let $h$ be a bitstring and let $P(h, n)$ be the n-bit prefix of $h$. A partial collision of length $n$, for a hash function $H$ is a pair $(x,y)$, such that $P(H(x),n)=P(H(y),n)$.
What is known about ...
-1
votes
0answers
37 views
How to decipher this morse-like code message? [closed]
I found this little string that looks like Morse Code, but instead of dots (dits) has hearts symbols, I tried to change the hearts for dots, but I was not able to get any redable text.
...
0
votes
1answer
26 views
PKCS#11: Which CKK_types are supported by CKM_PKCS5_PBKD2?
On Solaris there's a function pkcs11_PasswdToKey() which is a wrapper of C_GenerateKey(). I made a simple test and it turned out ...
3
votes
2answers
172 views
Is there a way to do fair exchange between two parties who don't trust each other?
Let's suppose we have an Alice who knows a secret key A, and Bob who knows key B. Using their own keys, they each encrypt a message (Alice encrypts $m_A$, Bob encrypts $m_B$) with their own key, and ...
0
votes
1answer
55 views
What is a fair exchange scheme?
The Wikipedia entry Fair exchange has only two lines, and the only paper I can find describing such a protocol is extremely complicated.
Is this a new field in cryptology or can someone give an ...
0
votes
1answer
58 views
Encrypting a broadcast channel
We're building a data service that is expected to go out through a single "fat pipe" channel. The design requirement says that the data in the channel must be protected by authentication and ...
3
votes
1answer
107 views
Using an MD5 hash as a password
Suppose Alice is using a password prompt that only accepts up to 32 characters for any particular password.
Memorization of long strings of random characters is not one of Alice's strengths, so she ...
10
votes
2answers
837 views
Why is H(k||x) not a secure MAC construction?
If H(m) is a secure hash function, can't we implement a MAC using H(k||m)?
However, it seems the more widely used MACs, such as NMAC and HMAC (both originally defined in Keying hash functions for ...
1
vote
2answers
77 views
CSPRNG in JavaScript using Audio and Video
I ported GnuPG to Javascript using Emscripten (not released yet).
Now I need a good replacement for /dev/random//dev/urandom.
...
2
votes
1answer
62 views
Why is the discrete log problem easy when the exponent comes from a binomial distribution?
I read in http://epubs.surrey.ac.uk/7219/2/esorics06.pdf that in exponential El Gamal the discrete log problem for recovering $m$ from $g^m$ can be made tractable when $m$ is drawn from a binomial ...
3
votes
1answer
90 views
Trying to better understand the failure of the Index Calculus for ECDLP
So I'm going to give you guys my understanding and then if you would be so kind as to tell me where I'm off the mark (hopefully I'm not completely wrong).
So basically the index calculus for the ...
19
votes
10answers
2k views
Now that quantum computers have been out for a while, has RSA been cracked?
D-wave systems has released a commercially viable quantum computer. This means; in theory, that all asymmetric encryption algorithms, such as RSA are now useless, due to the speed at which quantum ...
0
votes
2answers
68 views
random number generator 10-side dice alternative
A lot of sites like this one Here, refer to 10-side dice to generate random number for otp. I was thinking about new ways to generate random numbers,letters and passwords. here what I got.
to ...
2
votes
4answers
137 views
Increased CRC collision probability when adding bits to input message
The Scenario
I have a message string I need to transport over a wireless network that may be unreliable. This message string is about 100 bits long, and is packaged with an 8-bit CRC. When the ...
1
vote
2answers
84 views
Why is the following RSA PRNG cryptographically secure?
One requirement states that the generator has to withstand the next-bit test.
Consider the following PRNG, where we calculate next output $x_i$ via the formula
$x_i = x_{i-1}^ e\mod n$.
I can see ...
1
vote
3answers
661 views
Does encrypting twice using the same block cipher produce a security weakness?
If I use the output of a cipher, for example a block cipher such as AES and encrypt it again with the same algorithm, I read that this introduces weaknesses into the overall security of the system.
...
0
votes
1answer
103 views
Designing a security system from scratch with a custom protocol, suggestions needed
For the reasons I cannot go into details, I need to design my own protocol and overall security system which will be used to establish secure data exchange between various devices (most notably ...
4
votes
1answer
146 views
Why xor the message into the state for sponge hashes?
Sponge hashes like Keccak(SHA-3) and CubeHash, xor a message block into part of the internal state. Why use a reversible operation like xor for that, instead of replacing that part of the state with ...
6
votes
3answers
153 views
What kind of adversary is the cloud?
I just started some work on computation over encrypted data in the cloud. We're still in the early planning stages, and to really understand the kind of security we can offer I need to determine what ...
-3
votes
1answer
68 views
Can someone help with the following hashes? [closed]
Here are a couple of hashes. I feel it should be easy (simple base conversions?) to decode them but I haven't succeeded so far. Can someone help?
...
-5
votes
0answers
57 views
Crypting text cheating wife on iphone [closed]
Wife received text looks like Chinese with boxes
I am new to cheating with adware and crypting
And embedding can I buy a service or app and cut and paste or copy these texts and they are
Sent back ...
1
vote
2answers
85 views
Combining LFSRs for Stream Ciphers: Why do we need high non-linearity?
Linear Feedback Shift Registers (LFSRs) can be excellent (efficient, fast, and with good statistial properties) pseudo-random generators. Many stream ciphers are based on LFSRs and one of the possible ...
