All Questions
1
vote
2answers
237 views
Is there an algorithm for factoring N, which is just as simple as this one, but faster?
I found a simple algorithm for factoring semiprime numbers, you can read about it in Factoring Semiprimes and Possible Implications for RSA.
It basically works like this:
You reverse the digits in ...
-3
votes
0answers
64 views
Show that for all integers n>2, n does not divide n^2+2 [closed]
I believe this solution can be solved by induction, I just don't know how to phrase it recursively.
For all n>2, n^2+2 mod n ≠ 0
Base case n=3
3^2 + 2 =11
11 mod 3 = 2 ≠ 0.
Show that
(n-1)^2 +2 ...
0
votes
2answers
159 views
What's the difference between AES and earlier block ciphers?
Is there any difference except speed and key and block size from user's point of view?
Or does AES have something that ideal block cipher doesn't have?
2
votes
2answers
123 views
How to derive two keys from one password
What is the best way to generate two independent symmetric keys from one user-entered password or passphrase?
Would using both scrypt and pbkdf2 achieve this?
-2
votes
3answers
106 views
how much is secure to encrypt a password using itself (as encryption key) for storing it on a unsecure media?
I want to store a password securely on a storage (suppose in a usual unencrypted file).
I use this password as AES key to encrypt itself (using AES-ECB) & then store it on the media (the password ...
4
votes
2answers
900 views
Is the following statement about PRG true or false?
Is the following statement true?
If $G: \{0,1\}^k \rightarrow \{0,1\}^n$ is a PRG, then so is $G':\{0,1\}^{k+l} \rightarrow \{0,1\}^{n+l}$ defined as $$G'(x.x')=G(x).x'$$ where $x \in \{0,1\}^k$ and ...
1
vote
1answer
67 views
Elliptic Curve is DH function or PKI?
can we reuse same ECC key on TLS for long terms or it must be used just once? (i mean can we use ECC like RSA?)
is there patent free ECC implementation ?
1
vote
2answers
92 views
Is there any strong enough pen-and-paper or mind cipher?
Some ciphers are talked about here, but I don't see an answer, are they strong enough, or are non-computer ciphers more or less just a toy and one should abandon using them for practical purposes?
8
votes
4answers
1k views
How can rainbow tables be used for a dictionary attack?
I'm putting together a password policy for my company. I very much want to avoid requiring complex passwords, and would much rather require length.
The maximum length I can enforce is 14 characters. ...
6
votes
2answers
132 views
Have I understood pedersen commitment correctly?
I want to do a one-sided integer commitment scheme. I.e. the whole process must be non-interactive where I at one point first publicly reveal some data and then at a later time reveal the committed ...
-3
votes
0answers
38 views
DES chosen-plaintext attack in Windows [closed]
How do I do a DES chosen-plaintext attack in Windows?
0
votes
0answers
85 views
Adding and multiplication in jacobian coordinates
How can I derive formulas for adding and multiplication of 2 points in Jacobian coordinates $(x,y) = (\frac{X}{Z^2},\frac{Y}{Z^3})$ over an elliptic curve?
-2
votes
0answers
34 views
session keys in an online e-voting system [closed]
I do not have much knowledge about cryptography or public and private keys, and your help will be much appreciated. I am totally a beginner, and no one from my university can help me.
I am trying to ...
2
votes
1answer
94 views
Attacking historical ciphers methodology
It's more a theoretical question of how would you approach it. All you know about the ciphertext it's was generated with a historical cipher. The ciphertext appears to be random, BUT it's divided into ...
0
votes
1answer
42 views
recommendation for steganography tool? [closed]
I am trying to find a good and referenced steganography tool to make some tests, it its freeware it would be great. Does anyone knows any recommended tool for this task? I have found some free ...
9
votes
2answers
782 views
What is the most practical fully homomorphic cryptosystem?
Craig Gentry recently gave the first fully homomorphic cryptosystem. Quite a bit of work has been done since extending his work. It seems, however, that no system is practical for real world use.
...
3
votes
4answers
229 views
Knowing a valid salted hash for an unknown secret, is it possible to compute another valid hash?
$H(s,r)=d$ is a function that hashes the secret string $s$ with a salt $r$, and returns a digest $d$.
$r$ may be arbitrarily chosen and each $r$ returns a different $d$.
For any $d$, $r$ is known from ...
2
votes
3answers
163 views
Is it possible to work out the hash algorithm from a list of known message-hash pairs?
For example, in my situation I know hash(20) = 486e9638177faf1f34e49910491b77af.
I also know the hashes for all values from 0 to 20.
Is it possible to work out the ...
0
votes
3answers
87 views
Padding of Original Message in MD5
what should I do if my original message is greater than 64 bits? what is the process of padding in MD5?
As described in Internet Security: Cryptographic Principles, Algorithms and Protocols, page ...
2
votes
1answer
159 views
SHA256 HMAC brute force with chosen plaintext attacks
This is a follow up to Is It Possible To Reconstruct a Cryptographic Hash's Key
I am using a SHA-256 HMAC function on a single-word input: sha256hmac(privatekey,word) = output. The private key length ...
1
vote
2answers
382 views
Decrypt digital signature using RSA public key with openssl
I have a digital signature that was created using the following algorithm: a SHA-256 hash of the body of the message is calculated. It is then signed using an RSA private key and the result is ...
3
votes
2answers
187 views
toy hash algorithm
I'm looking for a toy hash function, where the idea is to have high school students break (i.e. find a collision) a hash function by hand, in order to teach them how one way functions and hashing ...
1
vote
1answer
104 views
Encrypt a single file, chunk-by-chunk, each chunk using different key (AES)
Encrypt a single file, chunk-by-chunk, each chunk using different key.
I am a security newbie (only took 2 security courses before)
But currently I am using this encryption method for my Android ...
1
vote
1answer
201 views
What does the expression $1^n$ mean as a function argument?
In a paper about predicate encryption or attribute based encryption, the setup function is mentioned with the $setup(1^n)$ or $setup(1^l)$. I want to know what is meant here.
Is it multiples of ones ...
-1
votes
2answers
55 views
Book Didactic Security Notions [closed]
I want study more about cryptography reading papers, but I have a problems to understand few concepts: security notions, random oracle model, IND-CCA, ... etc. I began study this concepts by internet: ...
1
vote
2answers
138 views
Is it worth applying a MAC on data in a HSM?
I'm building a basic HSM out of an Arduino, and am using the following scheme to store data:
Master symmetric key $k_m$ stored in firmware (secure bit set to prevent trivial extraction).
Secondary ...
2
votes
1answer
110 views
Why does key generation take an input $1^k$, and how do I represent it in practice?
In my lecture, the lecturer said:
Let $K$ be the key generation algorithm. Given a security parameter represented in unary, $1^k$, $K(1^k)$ will output a keypair $(pk; sk)$, known as the public ...
3
votes
1answer
137 views
Secure encrypt-then-sign with RSA
I understand that when you want to encrypt and sign data with RSA the generally recommended approach is sign-then-encrypt.
However, I have encrypted data that I need to sign, to prove the author of ...
5
votes
1answer
107 views
Proof that padded RSA is CPA-secure
I'm referring to page 383 of J. Katz and Y. Lindell's Introduction to Modern Cryptography. The book presents a padded RSA:
${\bf Key Generation:}$ same as Textbook RSA (given security parameter ...
-1
votes
0answers
56 views
Perfect secrecy Proof
A symmetric cryptosystem have perfect secrecy $\iff$ for all
distribution over the messages space, $M$, and for all $m0$, $m1$ (messages) and any ciphertext $c$,
$$P(c|m0) = P(c|m1).$$
I got ...
3
votes
2answers
225 views
Is it generally possible to employ brute force methods when the encryption scheme is not known? Why or why not?
Lets say you are presented with an encrypted string of bits or text, and no other information. What would be necessary before you could apply brute force methods to decrypting the string? How would a ...
-1
votes
1answer
39 views
Sematically Secure McEliece
I am read the Lemma 2 (pp13) in the paper [1]. Here a make a question Why "for any $Hash_z$ and any $Gen$"? The author of paper reply
The reason why "for any $Hash_z$ and any $Gen$" is that if ...
1
vote
1answer
67 views
How to compare two datasets „anonymously”?
Ok, I hope this question makes some sense because I am not so sure how to word it any differently… Imagine the following situation:
There are 10 defined colors (blue, orange, yellow etc.)
There are ...
0
votes
0answers
35 views
Interesting game: decipher the following sequence [closed]
Decode the following sequence:
KROWE
MOHSI
HTDEY
OJNEI
The original cipher is printed in such matrix format
0
votes
1answer
45 views
chaining rsa with ecies
In an answer to a previous question it was suggested that one way to protect your asymmetrically encrypted AES-256 keys, from say a solution to prime factorization, would be to chain asymmetric ...
1
vote
2answers
79 views
standard way to authenticate parties with public keys without certificates
Is there some standard protocol for mutual authentication of two parties when there is possibility to use public key cryptography? The problem is that two parties can use public key cryptography but ...
1
vote
1answer
42 views
Adversary Two Stages
I am read this paragraph and I have a doubt.
"An adversary to PKC $\Pi$ is given by two probabilistic polynomial
time algorithms, $A = (A1; A2)$. In the first stage, the "find"
stage, the ...
1
vote
1answer
86 views
Secure order preserving hash function
Is there a construction of an order preserving hash function that keeps the preimage property of a crypto hash function? By order preserving hash function (OPHF) i mean for $x<y$ then $OPHF(x) < ...
3
votes
2answers
124 views
what is the difference between Scrypt and PBKDF2
After reading these two resources I am wondering am I getting all the differences between Scrypt and PBKDF2 or am I missing something?
As far as I understood, the similarity is:
both are using ...
4
votes
1answer
163 views
Quality of randomness on a Linux system with haveged
Has anyone checked if using haveged, a Linux daemon which uses the HAVEGE algorithm, changes the non-deterministic properties of the random data from ...
1
vote
1answer
56 views
Counter Mode: static IV but different keys [duplicate]
Given we are using AES counter mode, suppose we randomly generate several keys, all of them are using same IV (say, zeros). Does this lead to any security issue?
I know that in CTR mode, same key-iv ...
0
votes
2answers
90 views
risk of attacker decrypting RSA ciphertext without public or private key
As I describe in my previous question I am trying to decide if it's worth it for me to use the Offline Private Key Protocol in creating some long term private archives, instead of just going with a ...
2
votes
0answers
96 views
LT codes with Homomorphic hashing
I have been working on a project implementing LT codes with Homomorphic hashing (inspired from http://blog.notdot.net/2012/08/Damn-Cool-Algorithms-Homomorphic-Hashing and ...
3
votes
1answer
53 views
Chosen ciphertext insecurity in an ElGamal variant
I'm trying to prove something and if I can show that there is a simple way to calculate $(g^a \bmod p)^k$ if I know both $g^k \bmod p$ and $g^a \bmod p$, then (I think) it will help me prove it, but ...
0
votes
1answer
48 views
Certificate == signed public key
For primes p and q used to create a keypair, I understand that the following operation is used to create a signature :-
M ^ d (mod N)
where d and N have their usual meanings and M is the message. In ...
6
votes
3answers
2k views
How to generate a list of unique random strings?
How would you generate a list of distinct random strings, where all strings are alphanumeric and have a fixed length?
1
vote
1answer
149 views
Simple example for CP-ABE (Ciphertext policy attribute-based encryption)
I'm currently working on Ciphertext Policy Attribute-Based Encryption (CP-ABE). So far I'm only using it with a basic understanding how it actually works. Now I want to understand it a bit better, but ...
1
vote
0answers
37 views
Parallelizing AES GCM in BouncyCastle [migrated]
I'm using AES-GCM with the BouncyCastle provider in Java and it works fine. The NIST documentation seems to suggest that GCM is an algorithm that allows parallelization -- however, on looking at the ...
4
votes
3answers
225 views
McEliece Cryptosystem Implementations
Are there any current implementations (language irrelevant) of the McEliece Cryptosystem?
I have been hunting around all day, and yet, have only found a few mathematical equations pertaining to the ...
2
votes
1answer
166 views
Are there any practical implementation of a homomorphic hashing or signature scheme?
A homomorphic hash function is a function $H : A \to B$ between two sets with some algebraic structure $(A, *)$ and $(B, \star)$ such that
$H$ is collision resistant, i.e. it is hard to find $x \neq ...
