0
votes
1answer
84 views

How does knowing the factorization of N can help to obtain the secret?

Assuming $x=a^2 \pmod n$ and knowing $x$, $p$, $q$ how is it possible to obtain $a$?
2
votes
1answer
25 views

Is this JS library using openssl genrsa -rand improperly?

pem, a JS wrapper around openssl, has the following code in it: var params = ['genrsa', '-rand', '/var/log/mail:/var/log/messages', keyBitsize ]; Am ...
2
votes
0answers
67 views

Exponentiation with fully homomorphic encryption [duplicate]

I have often heard that because a fully homomorphic encryption scheme allows for both additions and multiplications on encrypted data, most other operations can be simulated. I don't understand how ...
0
votes
1answer
30 views

Standard serialization format for libsodium-based messages

Does anyone know of a standardized serialization format which can be (or already is) widely used for encrypted messages? For a variety of reasons (mostly complexity, age and poor support across a lot ...
-1
votes
1answer
45 views

Explanation of multivariate cryptography [on hold]

How do the key generation, encryption, decryption, signing, and verification processes in multivariate cryptography work? How about an example or at least a simplified general one? Also, what is the ...
4
votes
2answers
62 views

Are there any known weaknesses with ElGamal algorithm?

I am working on a messaging system and plan to use ElGamal asymmetric encryption to protect the message contents during storage and transmission. (This would be in addition to TLS used during ...
0
votes
0answers
16 views

PHP: How to show supported client ciphers [closed]

How to print a list of ciphers offered in ClientHello? How does e.g. mikestoolbox.org or hotaru.thinkindifferent.net show which cipher is used / offered by client? Thanks for helping.
1
vote
1answer
48 views

Send an encrypted question and return answer without decryption

Oke bear with me for a minute. Once upon a time someone mentioned a hypothetical way where you would send an encrypted question to Google and Google would return an answer without decrypting it. As ...
3
votes
0answers
38 views

Are there any asymmetric composite order group bilinear pairings?

Are there any asymmetric composite order group bilinear pairings? Is there a drawback of asymmetric over symmetric bilinear pairings of composite order either in efficiency or in security ?
0
votes
0answers
8 views

Acceptably secure solution for users to log in with a short unique code only (no username) [migrated]

I am creating a website whereby users are given an account by invitation only, and are sent a unique code by post. Users can then log in (at least the first time) by entering the code only. The goal ...
-2
votes
1answer
59 views

Hashes and Ciphers [on hold]

So I'm brand new to cryptography, I'm confused on a few fundamental issues, and my normal avenues of research aren't bearing any fruit. I'm hoping someone can describe the relationship between ...
-2
votes
1answer
67 views

Vigenere ciphers : Need help for math analysis

I've been learning about Vigenere ciphers and then thought of another method to Encrypt and decrypt that. This's my method to encrypt : ...
2
votes
3answers
281 views

decrypt numbers multiplied by a certain floating point number

A friend has about 10K numbers in a an excel sheet. He wanted to encrypt these numbers in order to share the file with a 3rd party that will help him reorganize the tables. What he did, to hide the ...
-3
votes
0answers
40 views

websites to have people break encryptions [closed]

I have built an encrypted text editor and was wondering if there were sites out there that you could post encrypted text and have some actual smart people try and break it. I would like to test this ...
1
vote
2answers
65 views

Why can the last block contain a full block of padding in CBC Encryption?

I'm trying to understand the SSL Poodle Attack and I'm wondering why the last block of a CBC Record can be full of padding? Wouldn't that mean that the useful data was already a multiple of the key ...
9
votes
1answer
654 views

Why are the outputs of the md5sum tool and Crypto++'s MD5 different?

Could you please tell me what is the difference of coreutils' md5sum and sha*sum tools (...
0
votes
1answer
117 views

Multiple private keys for single public key

I am currently working in security in mobile ad-hoc networks. I have several clusters, and I want to send some data encrypted with its public key, from the cluster head to the cluster members. I ...
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
172 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
71 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
32 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
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
32 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
93 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
107 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
35 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
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
137 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
70 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
29 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 ...
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
33 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 ...

15 30 50 per page