-1
votes
2answers
219 views

Decrypting Triple-DES using 2 keys in crypto tools

I'm currently working on crypto tools to encrypt/decrypt 4 blocks of messages using Triple-DES with 2 keys. So, I've reached the final cipher text, but now I have to do the reverse and get the ...
-1
votes
1answer
48 views

Meet in the middle attack - message and key

I clearly understand the story of Alice and Bob: Alice and Bob are going to use double DES. They know the keys K1 and K2. Alice sends to Bob the encrypted message c= EK1(EK2(m)). Bob decrypts the ...
-1
votes
1answer
201 views

Is the random data at the end of my decrypted message supposed to be there?

This is my PKCS#5 & AES/ECB Python 3.3 code: ...
-1
votes
1answer
104 views

What parts of number theory does the RSA algorithm use?

It is said that the RSA algorithm uses number theory. What parts of number theory does it use? I know it uses modular arithmetic and Euler's totient theorem and function. Is that all?
-1
votes
3answers
398 views

Block Cipher vs Stream Cipher in Web Application [closed]

I'm doing research about "Cryptographic attack methods in Web Application" so I have some questions to ask you guys: Block Cipher vs Stream Cipher, which is more common used in Web Application? How ...
-1
votes
1answer
181 views

What are some of the major differences between PyNaCl and PyCrypto? [closed]

It seems like one can generate keys and encrypt data with both libraries. Is one better than the other? Do they attempt to solve different problems? Is one more secure than the other?
-1
votes
2answers
187 views

Perfect Secrecy, two Definitions

I'm reading the proof of the implication "Def 2.1 $\Rightarrow$ Def 2.4" in these slides about Adversarial Indistinguishability and Perfectly-Secret Encryption. I have a doubt in the slide 10. Here it ...
-1
votes
2answers
308 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 ...
-1
votes
2answers
297 views

Strong encryption done by hand [duplicate]

One of the distinguishing features of a good encryption algorithm, is that it is easy to encrypt, and hard to crack. Are there any that are easy enough for average folk to remember, and calculate by ...
-1
votes
2answers
866 views

Where to store the private key and the public key in a communication protocol

I want to create a simple secured connection protocol over TCP/IP. I just want to connect from my mobile device to a server securely. Firstly I thought to use an SSL connection, but I changed my ...
-1
votes
1answer
187 views

Because the algorithm is known, it is no longer a trade secret [closed]

In wiki about RC4 cipher they said, Because the algorithm is known, it is no longer a trade secret. Is that mean the cipher text will be more secure if the algorithm unknown to the attacker. ...
-1
votes
2answers
173 views

What is the advantage of an attacker over breaking a 4 digits PIN?

When a hardware system is protected by a 4 digits password, what is the advantage of the attacker into breaking that system? Isn't it $10*10*10*10=10^{4}$? If $\frac{1}{10^{4}}$ is the cost of such ...
-1
votes
1answer
45 views

How to calculate bit strength of Integer Factorization Cryptography (IFC) such as RSA using Python

I would like to know how to calculate the bit-strength of Integer Factorization Cryptography (IFC) such as RSA by using Python. I gathered it is based off the complexity of factorizing the modulus ...
-1
votes
1answer
48 views

Theory for pre-paid debit card: card-to-card transfer [closed]

In Sweden in the late 90's they deployed a electronic prepaid cash system system, and if I remember correctly you could transfer money between cards without online access. Wikipedia states that the ...
-1
votes
1answer
44 views

The improvement of the private key exponent in the M.Weiner Attack

I am working on attacks on RSA and came across the M. Weiner attack. The limit for $d$ in order for the attack to apply is $d <= (\frac{1}{3})N^{0.25}$. The paper states that Boneh and Durfee ...
-1
votes
1answer
40 views

Error propogation in CBC mode

Going through the wiki for modes of operation I see that the section error propogation says that an error in one block in the ciphertext in CBC mode only impacts two blocks. I do not quite get that. ...
-1
votes
2answers
39 views

How to make sure the pre-agreed information safe for DH-Key Exchange

The definition of DH key exchange was given as the method let two authenticate each other & exchange the crypto key over an insecure channel. DH-key-exchange was innovated to defence ...
-1
votes
1answer
62 views

How do they implement MAC in TLS?

I recently read questions about "MAC then Encrypt/Encrypt then MAC" which made me curious about how they actually use the algorithm. MAC only calculated once either case (according to what I read). ...
-1
votes
1answer
149 views

cryptography and use of python programming language [closed]

why is it recommended to write cryptography programs ,for example crypt-analysis projects with python programming language? what is the advantages of python? why not use c or any other language?
-1
votes
1answer
47 views

What's wrong with this “order-preserving MAC” function?

Please note: this is purely a thought experiment and not intended for any real-world usage! I came up with a simple function $\mathrm{OPF}$ to map the integers $[0,C)$ (where $C$ is the "ChunkSize") ...
-1
votes
1answer
30 views

In Needham Schroeder key distribution what happens if responder's part is not encrypted in step 2 with Kbs but encrypted instead by Kab in step 3

The Needham-Schroeder protocol is: 1 A→S:A,B,Na 2 S→A:{Na,B,Kab,{Kab,A}Kbs}Kas 3 A→B:{Kab,A}Kbs 4 B→A:{Nb}Kab 5 A→B:{Nb−1}Kab Here Na and Nb are nonces. Kab is the key between a and b Kas is ...
-1
votes
1answer
115 views

Hash Based Encryption (fast & simple), how well would this compare to AES? [duplicate]

First of all, I know it's a very bad idea to invent your own encryption algorithm. It's better to use existing known, trusted, extensively tested and studied algorithms with a proven track record. The ...
-1
votes
1answer
40 views

Affine encryption function

Let $f(x) = ax + b$ be an affine encryption function. $a$ and the cardinal of the field of our keys $K$ (in English, 26) must be coprime so that the encryption ...
-1
votes
1answer
105 views

Regain 3DES ECB key, assuming I have both encrypted and decrypted text

Let's assume I've encrypted some text with some 24-byte key using 3DES ECB. Question: is it possible to regain the key if I have both encrypted and decrypted text? Excluding bruteforce.
-1
votes
1answer
76 views

Hypothetical question about AES output

Consider that you stumble upon 5 different AES output strings. One of these strings can be decrypted with a secret phrase, the other four strings are based on the real string but have had random parts ...
-1
votes
1answer
79 views

Assuming that we had a way of finding primes, could RSA be used without computers?

I once asked a question "Would RSA make sense if we used no computers?". The answer was negative, because finding primes that would make secure keys would prove too hard. Assuming that we had found ...
-1
votes
1answer
134 views

How do I cryptanalyze a password field?

In a PostgreSQL database, I can see the following fields in a table (for a specific record): User = administrator Password = "ceMv9Me6go" Now the following are true: The password length is not ...
-1
votes
1answer
741 views

Learning to encrypt/encryption algorithms [closed]

I am a beginning programmer interested in coding an application of my own to encrypt sensitive files of mine. For example: lists of passwords, bank accounts, Credit Card numbers etc. I was wondering ...
-1
votes
1answer
101 views

Why is it said that if we know few bits of pseudo random sequence we can predict the whole of it?

I am new to this cryptography and in the source from which i study it is said that if we know the first few bits of a pseudo random sequence we can predict the whole of it.How is it possible? The ...
-1
votes
1answer
352 views

How to calculate cycles per byte [closed]

Sometimes, websites and scientific papers that introduce and/or handle cryptographic algorithms also provide speed-analysis and tables comparing the individual performance of cryptographic ...
-1
votes
2answers
770 views

How does the rand() function in C work? [closed]

I want to know how rand() works (even when I don't provide any seed how it produces PRNs?) thanks!
-1
votes
2answers
202 views

What are alternatives to the random oracle model for modelling hash functions? [closed]

I was looking for more realistic alternatives to the ROM for describing hash functions in theoretical proofs. I came across the common reference string model (where hash functions can be modeled as ...
-1
votes
1answer
122 views

Cryptographic Primitive Method

Is there any cryptographic primitive bijective (one-to-one and onto) function for creating cryptographic tools like symmetric encryption/decryption, Hash code generator, MAC, HMAC and Random number ...
-1
votes
1answer
38 views

PGP message integrity : How can receiver of an email check the integrity using the sender's public key?

PGP message integrity: Basically, only private key can decrypt message encrypted with public key. But in the message integrity service in PGP does the reverse, where the Hash of the message if ...
-1
votes
1answer
51 views

Pseudo Random Generator with fixed Hamming Weight [closed]

I'm searching for way to generate secure pseudo random sequence with a fixed Hamming weight using a seed. I found below code but I need a seed to generate a sequence ... (and need know if is possible ...
-1
votes
1answer
81 views

How Does Progressive Hashing Work?

Example: http://jsfiddle.net/KGtUE/ https://code.google.com/p/crypto-js/#Progressive_Hashing sha256.update("abc"); sha256.update("def"); sha256.update("ghi"); ...
-1
votes
1answer
49 views

How small are we talking about when defining the small public/private key exponent [duplicate]

I've been wondering about the 'small' part of the attacks on RSA, like the small public key exponent and the small private key exponent and what's not really clear is how small are we talking about? ...
-1
votes
1answer
70 views

Reverse engineering a single checksum byte [closed]

I am working to understand a system which saves a few bytes of data together with what appears to be a single checksum byte that provides a very naive guarantee that the data has not been tampered ...
-1
votes
1answer
53 views

How can the key size be calculated [closed]

If the decrypting key is 448, then what is the key size? Suppose I am encrypting a plain text with a key by choosing some random numbers between ...
-1
votes
1answer
121 views

PRG existance and P versus NP

how can we prove that if there is a secure PRG then P!=NP or in reverse order?(is there any reduction?) a secure PRG is a pseudo random generator that for every eficient (running in probabilistic ...
-1
votes
1answer
83 views

Symmetry for finite cyclic groups (Z/pZ)∗

How well is it known that for $i$ such that $1 \leq i \leq \frac{p − 1}2$: $$ g^{i+(p−1)/2} = g^{i−1+(p−1)/2} − g^i + g^{i−1} \pmod p $$ Whilst working in the finite cyclic group of prime moduli ...
-1
votes
1answer
76 views

PRF and hash functions

Is there a difference between PRF and a hash function? example: Creation of a secret key is using PRF and creating a secret key is using hash function.
-1
votes
1answer
233 views

How can I convert numbers into prime numbers?

I'm working with one-way accumulators, but I'm not knowledgable in cryptography. Is there an easy peasy way to hash numbers (or whatever) into prime numbers? Obviously I'd like it to be collision ...
-1
votes
1answer
51 views

Positioning of keys in encrypted text

I'm just looking at very simple encryption. I've noticed that the key is typically either at the front or at the back of the encrypted text. This is quite easy to break if you know the key. It can ...
-1
votes
1answer
65 views

encrypting data signals using the time variations between two independent coupling functions [closed]

There was a recent article about a new encryption technique that encrypts "using the time variations between two independent coupling functions". What is this technique they are referring to?
-1
votes
1answer
57 views

How to create PSK key? [closed]

I'd like to create a PSK key to use with TLS-RSA-PSK-WITH-AES-256-CBC-SHA - what is the format of this key?
-1
votes
1answer
128 views

Hash Based Encryption (fast & simple), how well would this compare to AES? [duplicate]

First of all, I know it's a very bad idea to invent your own encryption algorithm. It's better to use existing known, trusted, extensively tested and studied algorithms with a proven track record. The ...
-1
votes
1answer
108 views

Number of possible keys in a Play fair cipher [duplicate]

So for the play fair case, the number of possible keys is : 26x26 = 676 possible keys But if we consider the repeated letters, how many unique keys will the play fair have? I mean how will ...
-1
votes
1answer
65 views

Adding “salt” to “doHash” function in Java [closed]

For one of my university projects I am being asked to "Improve the code to satisfy the pre-image resistance requirement." Basically the program is a basic encryption server system, and when I type a ...
-1
votes
2answers
103 views

Need Help Reversing my Encryption Algorithm [closed]

So I wrote a simple encryption algorithm (Not very secure, just a starting point. I don't want criticism on it.) and I have been having trouble finding a way to decrypt the text. The algorithm is here ...

15 30 50 per page