2
votes
0answers
90 views

Key Recovery Smart-Vercauteren SWHE

In the article (https://eprint.iacr.org/2009/571.pdf, pag 8) of Smart and Vercauteren, it is mentioned that the recovery of the private key is an instance of the small principal ideal problem. But I ...
0
votes
1answer
74 views

white-box cryptography and its applications [closed]

I am a programmer who is doing research into whitebox cryptography. What I hope to do is to use WBC for an DRM application however as some of us may know, WBC is theoretically impossible therefore I ...
1
vote
3answers
114 views

Programming language for modular arithmetic over large numbers [closed]

I'am trying to implement algorithms on integer factorization.This involves dealing with integers of 200-500 digits and doing modular arithmetic over them.Which programming language has inbuilt support ...
1
vote
2answers
171 views

What cryptanalysis is possible against two independent keystreams XORed against plaintext?

If a wise person was unsure about which commercial cryptography standards are truly secure from the fascist powers that be, it would seem the obvious option for companies and individuals is to now use ...
0
votes
0answers
67 views

Simplifying the zero-knowledge proof example? [duplicate]

There is this http://en.wikipedia.org/wiki/Zero-knowledge_proof#Abstract_example. Now I'm curious about this. Why is it not possible for Victor to stand at the entrance and watch Peggy take one path ...
0
votes
2answers
174 views

Factors of RSA modulus

In the article A Method for Obtaining Digital Signatures and Public-Key Cryptosystems, the original RSA article, it is mentioned that Miller has shown that n (the modulus) can be factored using any ...
1
vote
2answers
167 views

Combining a keystream generator with a block cipher

I understand that: A stream cipher's security is diluted if the same key is used more than once. This is fixed by using an additional initialization vector in the keystream's computation. A block ...
0
votes
0answers
27 views

How to find the factors of the modulus? [duplicate]

In the article "A Method for Obtaining Digital Signatures and Public-Key Cryptosystems", the original RSA article, it is mentioned that Miller has shown that n (the modulus) can be factored using any ...
1
vote
1answer
148 views

ASN.1 encoding off RSASSA-PSS default parameters

I am not totally sure the question belongs to crypto and not stackoverflow but nevertheless... The problem is the encoding of the RSASSA-PSS default algorithm identifier parameters in an X509 ...
1
vote
2answers
119 views

The perfect way of using IV in CTR mode

I understand that it is necessary to use the same IV for both encryption and decryption in the CTR mode. I'm thinking about the case when I concatenate the secret ...
1
vote
1answer
105 views

What is the importance of adding round key in AES

I know this may not be the place to ask this but I have found it difficult to find an answer to this question. I know the steps of the AES encryption algorithm but I am finding it difficult to ...
0
votes
4answers
149 views

Comparison among algorithm based on key length

Some months ago I found in some paper that we cannot compare symmetric algorithm with asymmetric algorithm based on the key length and more important we cannot compare asymmetric algorithm using only ...
3
votes
1answer
369 views

Difference between Hash function and Random Oracle

Going through the blog post, I was under the impression that any cryptographic scheme which makes use of hash function is said to be using random oracle. But, I have come across one construction of ...
0
votes
2answers
97 views

Automated testing of cipher security for import/export compliance [closed]

What do we know about systems that automatically test and grade cipher security. The application in mind would be for checking for compliance with import/export regulations. I imagine a system that ...
0
votes
1answer
43 views

Can one deduce the symmetric key size used to encrypt a given a piece of ciphertext?

Assume an attacker captures a piece of ciphertext encrypted with a symmetric key. He knows all the details of the algorithm used to encrypt except for the size of the key used in this case. Can he ...
0
votes
1answer
58 views

Integrity protection in wireless sensor networks [closed]

I have done a lab about wireless sensor nodes and got in touch with encryption for the very first time. There are some questions on my sheet, especially on integrity protection (the attacker wants to ...
0
votes
1answer
90 views

Using hash of plaintext as nonce in NaCl secretbox- bad idea?

I need a nonce to encrypt my stuff using NaCl secretbox. I will be transmitting the nonce along with the ciphertext, which I have been told is OK to do. It occurs to me that one could simply use the ...
0
votes
2answers
151 views

Where are the ChaCha20 test vectors/examples?

I see in the Salsa20 specification there are test examples throughout the document to help an implementer make sure every function works as designed. Consequently the whole algorithm would work ...
5
votes
0answers
296 views

Why is EdDSA collision-resilient with SHA-512?

In the Bernstein et al. paper about EdDSA, the authors claim EdDSA is resilient against collisions (i.e. it can still be secure even if the hash function used isn't collision-resistant), drawing on a ...
0
votes
1answer
70 views

What is the difficulty of DLP in GF(P^Q) with a subgroup with a prime order of L

Given a finite field GF(P^Q), having a subgroup with a prime order of L (P,Q,L are all primes), how difficult is it to find the discrete log, is it related to P and Q or is it related to L, or to ...
4
votes
1answer
205 views

Isn't the security of EC curve 25519 126 bits?

The security of the EC25519 is given as 128 bits, but since the order of the group is 252 bits shouldn't the security be 126 bits? Given as half the magnitude of the underlying field, since DLP ...
3
votes
1answer
78 views

Is changing $H(R\mathbin{\Vert}A\mathbin{\Vert}M)$ to $H(R\mathbin{\Vert}A\mathbin{\Vert}H(M))$ in EdDSA secure?

EdDSA calculates $s=(r+H(R\mathbin{\Vert}A\mathbin{\Vert}M)\cdot a)\bmod\ell$ and $r=H(h\mathbin{\Vert}M)$, with $H$ being the hash function (SHA2/512); $B$ being the generator; $A$ being the public ...
2
votes
1answer
49 views

Effect of CFB IV reuse

If an Initialization Vector (IV) is reused (under the same encryption key) in Cipher Feedback Mode (CFB), what is the effect upon security? I know there is some negative effect upon security, but I ...
1
vote
4answers
128 views

Difference between Pseudorandom Function vs randomly chosen function

I am currently going through a course in cryptography. In this, I stumbled upon Pseudorandom Functions. I got a little idea of Pseudorandom Generators which map an input string (key) to an extended ...
0
votes
3answers
76 views

private keys for multiple devices [closed]

I have an architecture where: a user can have multiple devices (phones) the server needs to broadcast the payload to all devices through the same channel (basically, all devices listen and receive ...
0
votes
1answer
106 views

How to implement the Salsa20 hash function?

I am currently implementing Salsa20 from the specification as an exercise in learning and self-flagellation. I have Sections 1-7 passing the test examples provided. I am now stuck on Section 8, The ...
-1
votes
2answers
107 views

Is there a client-side program to cryptography a HTML page and decode if correct password is writen? [closed]

I want to know if there is an easy way to do this: create a complete HTML page cryptography the text content (image is not important) ask user some password check the password with a cryptographed ...
1
vote
1answer
128 views

Strength of RSA with OAEP

In our current system we use an encryption solution based on RSA with OAEP padding. Key size is optional but default 2048. What is the general strength of RSA with OAEP? Are there know attacks that ...
0
votes
1answer
46 views

Unique assignment of X.509 certificate to each client

I'm trying to implement a short scale electronic voting application in a domain comprised of no more than 100 clients. System administrator is able to create new election instances and each client is ...
1
vote
1answer
33 views

Question about key verification

I am studying for network security exam. And in the slide about Key Management, under a heading Key Verification I see this: Key Verification Almost all cryptographic algorithms have some weak keys ...
0
votes
1answer
125 views

How much (home PC) CPU time is required to generate a prime number of a given size?

How much CPU time is required on a typical home computer to generate a prime number of size 100 bit, 200 bit , 512 bit and 1024 bit using given random bits of the respective sizes? Please note that ...
-1
votes
2answers
125 views

Remove padding (CBC) from decrypted text [closed]

I have a bit problem with padding. Everything goes fine when I encrypt the text BUT when I decrypt I see some extra characters. Sometime's one character sometimes more and I dont know how to remove ...
1
vote
3answers
91 views

Possible to use an accumulator to “license” or restrict the qty of certificates being used?

Suppose in a future version of x509 PKI, it is possible to limit the quantity of certificates being used, what would that look like? Here is a concept that won't work in the real world, but ...
-1
votes
1answer
109 views

Problem with implementing DES in python

i'm implementing DES in python and i've stumbled upon a problem i can't really find the problem, after debugging it i narrowed it down to this function, can anyone tell me if i'm implementing the DES ...
-1
votes
1answer
124 views

Which block cipher mode does the experts use? [closed]

I want to know which "block cipher mode of operation" does the experts use? I don't want to use ECB or CBC because add padding and padding mess up my code. So which one does the experts use. /Thanks ...
0
votes
1answer
161 views

How secure is file header encryption for large files?

I'm having trouble location information about whether or not encrypting a file's header is good enough. The files in question are media files that range in size from 500mb to 4GB. If I had no ...
1
vote
1answer
143 views

Montgomery Algorithm

I'm trying to undestand how it works and how to implement the algo described in this paper. The paper shows a methods to compute a modular multiplication where it is used multiplier with a resolution ...
-1
votes
1answer
122 views

subgroup of quadratic residue

if a number is said to be a subgroup of a quadratic residue of Z∗p, can I affirm that it is a generator of a cyclic group ? ie, say i am looking for a number which is an element of order q in Z*p, ...
0
votes
2answers
59 views

Discrepancy with reported key size for EDE ciphers in Qualys SSL Labs

The following two cipher suites were reported by Qualys SSL Labs as being 112-bit: SSL_CK_DES_192_EDE3_CBC_WITH_MD5 TLS_RSA_WITH_3DES_EDE_CBC_SHA However, all other references I can find say that ...
1
vote
1answer
196 views

What is the algorithm behind PasswordDeriveBytes?

Microsoft has created an implementation of PBKDF1 in the PasswordDeriveBytes class. It can however generate more bytes than PBKDF1, which is limited to the number ...
0
votes
0answers
67 views

Are there any known inverse hash lookups for the zero string?

Just wondering, are there any known inverse hashes / hash lookups in common hashes (md5, sha1, sha2, etc.) for the zero string hash value? (i.e. bytes 0x00 00 00 00 00 ...) Or more specifically, for ...
0
votes
1answer
79 views

Entropy in relation to computer security [closed]

I am going over some lecture notes and my lecturer is off sick, so not sure where to turn. There is this equation that I cannot understand as it's given with a couple of examples. I was hoping ...
2
votes
3answers
185 views

Key derivation of public key without knowledge of private key

I'm looking for a convenient way to share a set of public keys across multiple services, while preserving privacy by preventing these services from tying the identity of these public key sets together ...
0
votes
0answers
141 views

Variant of the Decisional Bilinear Diffie Hellman problem

I am working on a cryptographic scheme and I need to rely on the following problem, which I have nicknamed the "Hybrid Decisional Bilinear Diffie Hellman (hDBDH)" problem: Let $e: \mathbb G_1 ...
0
votes
1answer
117 views

CBC with a fixed or random IV

I have two probably quite naive questions: 1) Why, exactly, is it so bad to have a fixed (or predictable) IV in CBC mode? An example would be great! 2) Given 1), why is a random IV better? And if ...
0
votes
1answer
105 views

Hardness of problem related to bilinear pairings

Let $e: \mathbb G_1 \times \mathbb G_1 \rightarrow \mathbb G_T$ be an efficient bilinear pairing. Note that the pairing is symmetric (i.e., Type 1). The problem is, given $g \in \mathbb G_1$ and ...
0
votes
3answers
229 views

Random Galois fields

Note: I have now answered this by my own research and can generate random fields up to G(2^9) in reasonable time. I would need to find more speedups for larger fields. At this time G(2^8) takes a few ...
0
votes
1answer
102 views

Split 32-bit LFSR into two 16-bit LFSR which xor to same sequence [duplicate]

Today I was thinking about exactly this. Is it possible, for a 32-bit LFSR e.g. ...
-5
votes
1answer
42 views

Many Time Attack [closed]

How i can XOR these two cipher texts encrypted by using same key First ...
1
vote
1answer
91 views

Why are cryptographically secure hashes required for digital signing (RSA or DSA)?

I know that a cryptographically secure hashing algorithm is required for proper message signing (SHA-1, or I think SHA-2 is the current suggested algorithm). However, why does the hashing algorithm ...

15 30 50 per page