0
votes
2answers
8 views

DES generating the same ciphertext for different plaintexts and identical key

Is it possible to get the same output for DES while the inputs are different while using the same key? The key should not have to be a weak key. If yes could you give me a hint how to show how to do ...
0
votes
1answer
20 views

Is it required to transfer private key to programatically digital sign a Document remotely?

I'm trying to digitally sign a document which is uploaded by user. I want user to sign that document using his DSC. Do I have to : Transfer the file over network or Transfer the Private key of user to ...
1
vote
0answers
25 views

Is there a way to “shorten” a Merkle chain?

If I have a Merkle chain of 3 items, is it possible to create a zero knowledge proof of the existance of a correct chain between hash 1 and hash 3? Editing to clarify (Thanks Ricky), what I mean my a ...
3
votes
1answer
35 views

Power analysis and exponentiation by squaring

I am trying to understand how one can retrieve the secret exponent via a simple power analysis. Lets suppose that the exponentiation by squaring algorithm is implemented in its simplest form : ...
8
votes
1answer
481 views

What are the security implications of multiple hashing?

There are plenty of questions on this site about hashing passwords. However, none of them quite cover this topic. One of those links covers using multiple different hash algorithms; one covers general ...
7
votes
4answers
92 views

How are random numbers for RSA generated?

The RSA public key encryption requires two very large prime numbers as part of its encryption process that serve as secrets. These are typically generated with cryptographically secure random number ...
2
votes
2answers
62 views

Can I simulate iterated AES-ECB with other block cipher modes?

I am trying to write some code using the Web Crypto API (http://www.w3.org/TR/WebCryptoAPI/#algorithm-overview) which provides only some of the block cipher modes for AES, intentionally excluding ...
0
votes
0answers
26 views

what is wrong in my Rijndael that gives me this? [migrated]

I'm using the Rijndael classes from .net System.Security to Encrypt my RSA Keys this is how I set it up: ...
2
votes
1answer
54 views

Diffusion in Stream Cipher

The diffusion property of a cipher defined by Shannon refers to the ability of a cipher to cause a lot off bits in the cipher text to be modified, when even a single bit in the plaintext is flips. ...
0
votes
1answer
74 views

Prime Numbers in Discrete Log

I am implementing a security protocol based on discrete log. I came across the equation $p = kq + 1$. Understand that based on number theories that both $p$ and $q$ should be large enough to be ...
-1
votes
0answers
41 views

Is my itsdangerous replacement secure? [on hold]

I'm working on a library related to this question on StackOverflow. The purpose of the library is to address some of the limitations in itsdangerous, enumerated here. "I think I have done a good job", ...
-1
votes
0answers
54 views

How to verify the result of repeated squaring method

I am wondering that is there any way to check that the result of repeated squaring is correct or not Suppose we have a calculator (like Casio FX 570ES, ...), and we want to calculate x^d ≡ n If any ...
0
votes
1answer
46 views

Luby-Rackoff on Feistel ciphers

On page 46 of these lecture notes, it seems to say that if we have a Feistel cipher, and plaintexts $(L_0, R_0)$ and $(L_0^*, R_0^*)$ with corresponding encryptions, then we can determine the key? But ...
3
votes
2answers
83 views

Why would an Initialization Vector be supplied externally?

My software uses a 3rd party encryption appliance. One of the capabilities they allow is for the client software to supply an IV. Why would they not generate a random number on their own to use as ...
0
votes
0answers
20 views

AFV11 scheme simplification

I tried to implement AFV11 scheme http://eprint.iacr.org/2011/410 and faced with performance issues. In order to reduce this issue I have made some simplifications to the scheme. Does the following ...
-2
votes
1answer
57 views

Which Block cipher mode should I use? [on hold]

Which of the Block cipher mode is MOST secure? I dont care about the performance just the most secure
-2
votes
1answer
54 views

What is Initialization vector (IV) [on hold]

I am not the best cryptologer and therefore I have some questions so I learn more and get better. Heres the questions: What is Initialization vector (IV)? MUST I use it or not?
-1
votes
0answers
36 views

Example related to Algorithm to invert VMPC function

I am new with VMPC one way function. I understood the concept from vmpcfunction.com. But I can not understand algorithm of inverting VMPC function.I am not getting any example of it with detailed ...
0
votes
1answer
30 views

Encryption and HMAC in a PSKC file

This is the PSKC standard https://tools.ietf.org/rfc/rfc6030.txt In Section 6.1 6.1. Encryption Based on Pre-Shared Keys They have the following ...
1
vote
2answers
51 views

Chosen plaintext vs Chosen ciphertext

What is the difference between chosen plaintext and chosen ciphertext attack? In both of these adversary has access to paintext-ciphertext pairs.Then where lies the difference?
0
votes
1answer
58 views

Embedded devices Authentication, Integrity and Confidentiality

Embedded devices send messages to the server. The server occasionally sends messages to individual devices(Reboot, upgrade firmware etc) After some research this is my ad-hoc solution: 1) Each ...
1
vote
1answer
36 views

test vectors for 3DES seem to in fact be testing DES - not 3DES

NIST SP 800-20 Appendix A has what presumably are supposed to be test vectors for 3DES except almost all of the test vectors utilize 8-byte keys and not the 24-byte keys that 3DES is supposed to have. ...
-4
votes
0answers
30 views

Research Topic - lattice theory and cryptography [on hold]

Am planning to do research and in the process of selecting a topic . Request you to tell if concept of Lattice theory- Boolean Algebra can be used in Cryptography. If yes please suggest areas which ...
2
votes
2answers
64 views

Security concern about reducing hash value using modulo operation

As stated in the title, what I am looking for is information about a "technique" that I would like to use in some of my algorithms. Sometimes I need to map a hash function's result into a range of ...
1
vote
2answers
100 views

how to let other people respond to emails only decrypt-able with my private key

First of all I have to say it's a homework question but since I have no one to consult with, I ended up here :) Suppose a case in which you are the manager of a company and all employees encrypt ...
3
votes
1answer
80 views

Second pre-image resistance vs Collision resistance

From Wikipedia: Second pre-image resistance Given an input $m_1$ it should be difficult to find another input $m_2$ such that $m_1$ ≠ $m_2$ and $\operatorname{hash}(m_1) = ...
1
vote
2answers
79 views

Significance of 3mod4 in squares and square roots mod n?

Why do most literature while discussing squares or square root modulo a prime P, consider P to be congruent to 3 mod 4?
-1
votes
1answer
48 views

Modular Reduction of polynomials in GF(2^m)

Hello I am having trouble understanding the algorithm implementation in hardware of the reduction process over galois fields of F(2^163) In the following process it ...
-1
votes
4answers
189 views

Do Brute-Force Attacks and Cryptanalysis refute Kerckhoffs's principle?

According to Kerckhoffs's principle "A cryptosystem should be secure even if everything about the system, except the key, is public knowledge." Now I want to throw in a provoking formula of mine which ...
-4
votes
0answers
53 views

Is this cyphering method a really durable breakthrough innovation ? or not [closed]

I know, Security Breakthrough Innovation is quite "a {m,b,t...}illion throws for one hit" Furthermore, I am not a Cryptopath. Nor a Professional Paranoid. The keys: - why byte? byte is the ...
-2
votes
0answers
22 views

Simple Encrypted Message, With Key Included [closed]

Hi minds of Stack Exchange, today I present you the mysterious message that has been troubling my mind for the past one hour: From: 25 - 5()1 - 31 - 15(-)d Grade: 55 - 2(-) Class: 44 - ...
3
votes
2answers
43 views

How many times can a key be used for HMAC-SHA256 before it needs to be rotated?

If I wanted to use hmac for proving that a value hadn't been tampered with, how many times can I use a key before it needs to be rotated?
0
votes
2answers
75 views

Brute force against computational security

One-time pad is secure under brute force with respect to either of the definitions \begin{align} \Pr[M = m] &= \Pr[M = m | C = c]\\ \Pr[C = c | M = m_0] &= \Pr[C = c | M = m_1] \end{align} ...
3
votes
1answer
58 views

Proving the existence of a pseudorandom function

I've been reading the Introduction to Modern Cryptography book by Katz and Lindell as part of my own learning and have come across this exercise which I am not sure how to approach. The exercise is: ...
0
votes
0answers
13 views

Modifying algebraic secrecy message to use digital certificates

I have the following message: sign((M’, T$_A$, sign((encrypt((encrypt(M, $K_{pbB}$), M’), K), T$_B$), $K_{sB}$)), $K_{sA}$) Sign is used for signature generation. Encrypt is used for ...
-1
votes
1answer
24 views

Synchronize one time password algorithm [closed]

I have an iOS application and php server . I have searched a round TOTP and found some open source about objective c and php . but when comparing between token from php and iOS application its ...
0
votes
1answer
51 views

Calculate number of chips to solve bit commitment using hash function

I have a problem that I don't know how to solve Assume that H is a cryptographic hash function with output size 80 bits. Assume that ABC123 is a specifically designed line of hardware chips for ...
1
vote
1answer
40 views

Associative but NOT Commutative Reducing Function Construction with Existing Hash Function(s)

Is it possible to construct a binary reducing function based on any existing cryptographic hash function satisfying the associative property but not the commutative property? So formally: Using an ...
0
votes
0answers
40 views

Obliviously computing the Least common multiple of two poylnomials

Consider I have two polynomials $f_1$ and $f_2$ of the same degree. I want to secure them (using any kind of encryption except FHE) and outsource them to an untrusted server. I want him to compute the ...
5
votes
2answers
73 views

power consumption in a XOR

I'm trying to understand how a XOR affect traces of power consumption in a Differential Power Analysis on smartcards. What's the difference in energy radiated in a $1 \oplus 1$ and in a $0 \oplus 1$? ...
2
votes
1answer
62 views

Encrypting decryption key

What's that property called when a scheme is secure even if you encrypt the decryption key? Some schemes have problems when your plaintext is the decryption key (or just the key if symmetric).
3
votes
1answer
44 views

PBKDF vs HKDF for pretty long key

I'm developing a messenger application with encrypted chats. In the first version of the app I've used PBKDF2 (10000 iterations, SHA1, random salt) to extend a short user password and generate keys ...
1
vote
1answer
37 views

Is AES-GCM length extension attack possible using authenticated decryption?

I am looking to encrypt a piece of data using AES-GCM with a full 16-byte GCM Tag and send it over the network using UDP. Is it safe to assume using the AEAD nature of AES-GCM that performing ...
-1
votes
0answers
31 views

Program implementation and flaws [on hold]

I had written an email encryption program in Java almost an year ago. I want to improve upon it and need your help in determining any obvious flaws in implementation and functionality. About program ...
-1
votes
1answer
48 views

why choose one-time signature ,not directly publish message [closed]

why choose one-time signature for a message, not directly publish the message. Because we need to publish our public key on a reliable center (such as Trent), so why we directly publish message on a ...
2
votes
1answer
66 views

For which RSA moduli, precisely, is $e=d$ for all $e$?

This question shows that there are at least two valid RSA moduli $n$, namely $35$ and $91$, such that for any $e$ coprime to $\lambda(n)$, $$e^2\equiv1\mod\lambda(n)\text.$$ Reading the linked ...
0
votes
1answer
30 views

Specific example of a MAC in TLS?

This seems like quite a dumb question, but I really don't know if I'm finding a answer anywhere. I understand that if i access a website that is secured with TLS, we exchange ciphersuites and so on, ...
0
votes
1answer
57 views

Viability of an “Unconventional” Hashing Scheme?

I am playing around with the following hashing scheme: Start with a domain string (same for all users), Allow every user to mutate it in any way defining their own custom replacement rules, Append ...
7
votes
3answers
1k views

Why shouldn't I use ECB encryption?

I'm using Java to generate encrypted strings, and I get this warning at build time: ECB encryption mode should not be used So I'm wondering why I shouldn't use ECB and what I can use instead?
7
votes
0answers
97 views

How were shift amount constants in MD5 found?

The md5 specification gives a series of 4 rounds to execute over a 16-word block. Each round has a repeating sequence of 4 shift amounts (s in ...

15 30 50 per page