Related news


Published: 23/09/2018Rank estimation is an important tool for a sidechannel evaluations laboratories. It allows estimating the remaining security after an attack has been performed, quantified as the time complexity and ... Read moreSource: eprint.iacr.org

Published: 23/09/2018In this work, we study the fascinating notion of outputcompressing randomized encodings for Turing Machines, in a shared randomness model. In this model, the encoder and decoder have access to a shar ... Read moreSource: eprint.iacr.org

Published: 23/09/2018Hardware masked AES designs usually rely on Boolean masking and perform the computation of the Sbox using the towerfield decomposition. On the other hand, splitting sensitive variables in a multipli ... Read moreSource: eprint.iacr.org

Published: 23/09/2018Mixing Networks are protocols that allow a set of senders to send messages anonymously. Such protocols are fundamental building blocks to achieve privacy in a variety of applications, such as anonymou ... Read moreSource: eprint.iacr.org

Published: 23/09/2018This paper studies the security of Ring Oscillator Physically Unclonable Function (PUF) with Enhanced ChallengeResponse Pairs as proposed by Delavar et al. We present an attack that can predict all P ... Read moreSource: eprint.iacr.org

Published: 23/09/2018The problem of verifiable delegation of computation considers a setting in which a client wishes to outsource an expensive computation to a powerful, but untrusted, server. Since the client does not t ... Read moreSource: eprint.iacr.org

Published: 23/09/2018The problem of privatizing statistical databases is a wellstudied topic that has culminated with the notion of differential privacy. The complementary problem of securing these databases, however, ha ... Read moreSource: eprint.iacr.org

Published: 23/09/2018LowMC is a family of block ciphers designed for a low multiplicative complexity. The specification allows a large variety of instantiations, differing in block size, key size, number of Sboxes applie ... Read moreSource: eprint.iacr.org

Published: 23/09/2018Sanitizable signature schemes (SSS) enable a designated party (called the sanitizer) to alter admissible blocks of a signed message. This primitive can be used to remove or alter sensitive data from a ... Read moreSource: eprint.iacr.org

Published: 22/09/2018I am new to cryptography. My questions is this: I process packets on runtime. I do not have time for advanced encryption or decryption techniques that take a long time. As far as I know, going with OT ... Read moreSource: crypto.stackexchange.com

Published: 22/09/2018Alice and Bob decide to play rockpaperscissors in private(I'm not there), assume via an unsecured channel. : Alice should prove to me that Bob knows what she picked and Bob also should prove to me t ... Read moreSource: crypto.stackexchange.com

Published: 22/09/2018I have the homework to find to the public key (120, 3) the private key. I guess 120 is n and 3 will be e. So that $\lfloor\sqrt{120}\rfloor=10$ I can't find a matching prime number. So it gets more co ... Read moreSource: crypto.stackexchange.com

Published: 22/09/2018I've seen questions where people have asked if AESCBC mode is vulnerable to chosen ciphertext attacks if the IV is predictable. But is it guaranteed to be secure against chosen cipher text attacks i ... Read moreSource: crypto.stackexchange.com

Published: 22/09/2018There was a time when I wondered about multiplication as an encryption operation. That was when I was thinking in terms of modular multiplication. But how about based around simple multiplication. Pre ... Read moreSource: crypto.stackexchange.com

Published: 22/09/2018I was stamping a sha256 hash using Tieron's blockchainanchor packages , and on any block explorer I could see the hash as a data embedded in the transaction . However, when I started using Stampery A ... Read moreSource: crypto.stackexchange.com

Published: 22/09/2018Say Alice is the sender and Bob is the receiver. Alice has the public key of Bob and wants to send some data to Bob. How Alice will ensure that the public key she is having is really belongs to Bob? Read moreSource: crypto.stackexchange.com

Published: 22/09/2018I have the following hash function and I am trying to prove it is not preimage resistant def hash(message): key = [0x0f, 0xff, 0x00] for char in message: n = ord(char) key[0] ^= n key[1] &= n key[ ... Read moreSource: crypto.stackexchange.com

Published: 22/09/2018When using the PBKDF2, is one taking on significant risk if one chooses to lower the number of iterations and choose to have very long keys? Say, I want to use XOR to encrypt my data using a plaintext ... Read moreSource: crypto.stackexchange.com

Published: 21/09/2018Are there attacks which will return the RSA private key when the attacker knows the public key, plain text, and cipher text when no padding is used in the RSA algorithm? If yes, what are the known att ... Read moreSource: crypto.stackexchange.com

Published: 21/09/2018Below is the informal definition of PoK validity from Wikipedia: Validity requires that the success probability of a (polynomialtime) knowledge extractor E in extracting the witness, given oracle acc ... Read moreSource: crypto.stackexchange.com