2
votes
1answer
27 views

PBKDF2 for login key, scrypt for encryption key

I need to derive two keys from a single password client side. One for in-browser login, the other for encryption. Is the following secure ? ...
-1
votes
0answers
36 views

Using the chinese remainder theorem as a part of the proof, show that 2^700 = 1 mod 3625 [closed]

Using the chinese remainder theorem as a part of the proof, show that 2^700 = 1 mod 3625 Using the chinese remainder theorem as a part of the proof, show that 2^700 = 1 mod 3625
2
votes
1answer
49 views

Why is C_digest defined in PKCS#11?

Digesting doesn't require any key and can be performed on the client side. Why does the PKCS#11 token interface standard have a C_digest method? For example, why should I send my data to a PKCS11 HSM ...
0
votes
0answers
38 views

What aspect of elliptic curve encryption paradigms makes them especially susceptible to quantum based attack algorithms?

This was a statement made during a talk at today's DFN-CERT conference but unfortunately it wasn't explained further. Can anyone shed light on why elliptic curves are susceptible to quantum based ...
-1
votes
2answers
169 views

How to choose an algorithm

I have some understanding of Cryptography and I would like to know if there is a tool or website to help me choose an algorithm based on my own needs (I'm being vague in purpose). I'm looking for a ...
-1
votes
3answers
45 views

Reduction of a modular exponentiation's base does not change the result

Can anyone help me to prove this property used in the RSA correctness theorem? $a^b\bmod{n}\equiv (a\bmod{n})^b\bmod{n}$ Specifically, here is what I have done: this is what i mean. i can't ...
0
votes
0answers
11 views

Getting Certificate KeyContainerName to initialize CspParameters [migrated]

How can I get the name of a Key Container that's in a smart card required for initialization of CspParameters? CspParameters^ cspa = gcnew CspParameters(ProviderType, ProviderName, keyContainerName, ...
0
votes
1answer
53 views

RSA Key composition

I'm trying to figure out how it is composed the RSA key. Follow what I know : For a RSA 2048, 2048 is the bit length of the module. The public key is composed by $(e,M)$ when $e$ is the public ...
1
vote
2answers
56 views

ECDSA Public key randomness

If I have a 256bit ECDSA public key how likely is it that the same public key will be generated by another person. Will it take on average 2^256 tries to generate same public key? If I xor the first ...
1
vote
2answers
67 views

AES GCM vs other encryption modes in embedded environment for network traffic

I'm doing a lot of research since I'm doing an internship for a company where I need to upgrade their security level. Their own protocol needs a cryptographic upgrade and I'm leaning towards AES since ...
0
votes
2answers
60 views

Solve the congruence using Pohlig-Hellman algorithm

Use the Pohlig-Hellman algorithm to compute a solution to: $3^x\equiv 2 \pmod {65537}$ My attempt: $p-1 = 65537-1 = 65536= 2^{16}$ $x= 2^0x_0+2^1x_1+2^2x_2+...+2^{15}x_{15}$ For $x_0$: ...
-3
votes
0answers
31 views

RSA key pair generator in “C” - HELP [closed]

So, here's my problem. Every single library i try to compile (OpenSSL, WolfSSl, PolarSSL) an other not very know gives me error on compiling to. Everthing gives the compiler a reason to just don't ...
-1
votes
0answers
33 views

Are RSA keys stronger than McEliece keys?

What the title asks. I'm currently of the opinion that differences in key size don't make either stronger or weaker than the other in this case.
-5
votes
1answer
19 views

encryption of message “DATACONFANTIALITY” with key playfair using playfair cipher

actually i have solved the above mentioned problem but i want to check weather it is correct or not. my question is that how to encrypt the message DATACONFANTIALITY using the playfair cipher where ...
-1
votes
0answers
30 views

Calculating hash of hash in C [closed]

I've been working with Openssl libcrypto for a long time and I'm quite familiar with it but now I've got a problem I cannot solve in my own, so I need your help. I'm creating a hash of a short string ...
1
vote
1answer
43 views

In a additive group is it hard to calculate $bg$ given $ag, g, abg$

The ECDH problem defined that given $g,ag,bg$ it is difficult to calculate $abg$. But it is also difficult to calculate $bg$ given $ag,g,abg$. where $g$ is generator and a,b are elements of group.
0
votes
1answer
31 views

If you know the messages, and the results of HMAC(key, message) can you find the key?

If the attacker has 1 billion 4KB (random-noise) messages and sha256-HMACs for those messages (all using the same key), can they calculate the key that was used, before the universe dies?
2
votes
2answers
88 views

Using hash for one time pad key

Recently I've been delving into security algorithms, I already knew some of the (easy) math behind AES and RSA and how to and not to implement it. But well, i got a bit bored so i thought I'd just do ...
4
votes
2answers
101 views

Randomness re-use in LWE encryption scheme

Let me describe the scheme first, it is the scheme proposed by O. Regev when he introduced the LWE assumption. $sk = \textbf{s} \in \mathbf{Z}_q^n$ $pk = \textbf{A}\textbf{s}+\textbf{e}$ where ...
0
votes
1answer
34 views

Is the result of HMAC-sha256 distinguishable from random noise?

Is if the result of HMAC-sha256 distinguishable from random noise? If so, given: a collection of 1000 keys, and 1000 messages of random noise, 100 signed by each of only 10 of those keys Can ...
0
votes
1answer
64 views

Reducing size of hash function

If I have some data I hash with SHA256 as hash=SHA256(data) and then copy only the first 8 bytes of the hash instead of the whole 32 bytes. How easy is it to find a ...
0
votes
0answers
23 views

Help with AES encryption with CryptoJS and OpenSSL [closed]

I can't get same result when encrypting using CryptoJS or Ruby's OpenSSL JS code ...
0
votes
0answers
39 views

Is Fermat's Little Theorem possible over additive group? [migrated]

As Fermat's Little Theorem is define over multiplicative group $a^{p-1} \mod p$ = $1 \mod p$. Is there something over additive group?
0
votes
2answers
136 views

AES ECB experiment

Generally speaking, ECB mode shouldn't be used. ECB seems to be more of a basic building block than anything else. Because I thought it would be interesting to experiment with encryption (this method ...
0
votes
2answers
51 views

Schnorr's identication protocol

Schnorr's identification protocol is said to be a honest verifier zero knowledge protocol. Does it imply it will not work if the verifier is dishonest? I'm wondering if this is the case, it would ...
1
vote
0answers
65 views

Zero Knowledge Non Interactive Proof with random oracle

I am trying to write an assay about Non Interactive Zero-Knowledge proofs and would like to take the simple discrete logarithm problem example fallowing the Feige-Fiat-Shamir heuristics. I understand ...
0
votes
1answer
17 views

Linear Recurrence, keystreams, and periods

I am trying to understand the following problem: Consider the following linear recurrence over $Z_2$ of degree four: $z_{i+4} = (z_{i+3} + z_{i+2} + z_{i+1} + z_{i}) \bmod 2$ i >= 0. ...
-2
votes
0answers
35 views

How do you encrypt text using an LFSR?

How do you go about encrypting text using an LFSR? Could somebody provide an explanation and possibly a small example please?
0
votes
1answer
17 views

Hill Cipher the point of a known plaintext attack question

Is the point of a known plaintext attack on a Hill Cipher to get the matrix key?
0
votes
0answers
27 views

Substitution-permutation network

Can anyone in 6th grade English explain the steps in the Substitution-permutation network algorithm or just point a link that does so? (which is included in many of the top modern algorithms) ...
-1
votes
0answers
31 views

The RSA algorithm imposes size restrictions on the object being encrypted [duplicate]

The RSA algorithm imposes size restrictions on the object being encrypted. RSA encryption uses the PKCS#1 standard with PKCS#1 block type 2 padding. The PKCS RSA encryption padding scheme needs 11 ...
-2
votes
0answers
29 views

Help me break cipher [closed]

I'm only given the following cipher-text and have to decode the message. If you figure it out, please post the answer and how you got it. Thanks, it helps! Note: the following is all one cipher-text ...
-3
votes
0answers
25 views

how do u find the encryption/hash technique used in a string ? [closed]

here I have a String %63%6f%6d%6d%65%6e%74%65%64%20%63%61%6c%6c%20%74%6f%20%64%65%66%69%6e%65%64%20%6c%65%74%6d%65%69%6e%61%67%65%6e%74%6a%61%78%28%29 how to find the hash/encryption technique used to ...
0
votes
1answer
66 views

Why don't PyCrypto and M2Crypto produce the same result as OpenSSL here (AES-128 ECB)

If I run the following, for openSSL: echo -n "0123456789abcdef0123456789abcdef" | openssl aes-128-ecb -nosalt -nopad | xxd and enter the key "YELLOW SUBMARINE", ...
0
votes
0answers
13 views

Best practise Managing Key Material Securely in Memory in android [migrated]

I am aware of the issue of user entered pass phrases being left in memory if stored in Java Strings (due to String being immutable). Which takes me onto using char arrays. However, I am wondering if ...
0
votes
0answers
32 views

BGV FHE scheme parameters

In their paper presenting the BGV scheme, the authors mentioned in section 4.4 that, for the RLWE variant, the ring degree d, dimension n and noise distribution do not necessarily vary with the ...
1
vote
1answer
61 views

Is CAST5 still a secure algorithm to use?

I just installed GnuPG for Windows. The documentation says the default symmetric cipher is CAST5. In PGP also, default cipher was CAST5. Is CAST5 secure to use? Any known attacks reported on this ...
4
votes
0answers
85 views

Anonymisation resilient to key leak

Problem statement Elbonian citizens have been issued a card holding a random $B_j\in\{0,1\}^b$, $0\le j<2^n$, $b\ge n+20$ (representative example $b=64$, $n=28$). The habit has grown to use this ...
0
votes
1answer
41 views

Convert numeric message from RSA ciphertext to alphabetic

I have a set of numeric values that are supposed to represent a message encoded via textbook RSA. For example: 60889 37946 13359 61629 35960 13747 I've decrypted ...
0
votes
1answer
78 views

Figure out the encryption being used [closed]

There is a web API (for a game) that sends and receives data encrypted in hex format. I'm interested in accessing the api outside of the game client (mobile app). When sending a request with an ...
0
votes
1answer
57 views

Why would using a random seed with other variables be bad for ecrypting if you can't guess the key?

I asked this on stack exchange with it being code based, but someone suggested to ask here. Basically, I've done a script in python and wanted an option to encrypt the input, but I couldn't get any ...
-1
votes
0answers
32 views

Worked example of McEliece Cryptosystem

I am trying to learn about the McEliece cryptosystem, unlike other more common systems, like RSA or El Gamal, educational literature such as the Handbook of applied cryptography doesn't contain worked ...
2
votes
1answer
77 views

Hash “Preimage by product” resistance

Let H() be a hash function that achieves collision resistance as well as first and second preimage resistance. Let's equip the output set of H of a multiplicative group structure, more precisely a ...
0
votes
1answer
29 views

Implications of reversing CBC encryption

What would be the security implications if we reverse CBC encyption? Here is a picture of CBC encryption: Here is a picture of CBC decryption: My guess is that the encryption would work if we ran ...
0
votes
0answers
44 views

How does double-encryption work with a client server model

With mobile applications like Accompli (now the base for the Android Outlook application), credentials are stored. Reading from the Accompli website: Each user’s credentials are double-encrypted ...
1
vote
1answer
22 views

LUKS multiple key slots - what's the intuition?

LUKS volumes have the ability to allow multiple independently usable passwords, as explained here: [https://code.google.com/p/cryptsetup/wiki/FrequentlyAskedQuestions] The intuition behind basic ...
0
votes
0answers
47 views

Full Domain hash library

I need to know if any of the well-known crypto libraries (openssl, crypto++) supports full domain hash function. If not, what library I can use?
1
vote
1answer
34 views

What is the polynomial to use in the Massey-Omura cryptosystem?

The Massey-Omura cryptosystem uses "multiplication over the finite field $GF(2^n)$. I'm just starting understand the idea of multiplying polynomials and I've searched for online calculators to use for ...
1
vote
0answers
41 views

Crypto hash function vs encryption algorithms

Why is a cryptographic hash function generally faster to execute in software than conventional encryption algorithms such as DES?
3
votes
1answer
78 views

What are the computational benefits of primes close to the power of 2?

Recently I was reading some article about the Bernstein's Curve25519. This is a particular Montgomery curve over $\mathbb{F}_q$ where $q = {2^{255}-19}$. What I missed or was unable to understand is ...

15 30 50 per page