Zobrazeno 1 - 10
of 46
pro vyhledávání: '"Nilanjan Datta"'
Publikováno v:
IACR Transactions on Symmetric Cryptology, Vol 2023, Iss 4 (2023)
In CRYPTO’02, Liskov et al. introduced the concept of a tweakable block cipher, a novel symmetric key primitive with promising applications. They put forth two constructions for designing such tweakable block ciphers from conventional block ciphers
Externí odkaz:
https://doaj.org/article/95cd079e0afd4acb807ed70046ce93d3
Publikováno v:
IACR Transactions on Symmetric Cryptology, Vol 2023, Iss 1 (2023)
In CRYPTO’21, Shen et al. proved that Two-Keyed-DbHtS construction is secure up to 22n/3 queries in the multi-user setting independent of the number of users. Here the underlying double-block hash function H of the construction realized as the conc
Externí odkaz:
https://doaj.org/article/2a120f9653474709b5d409785ed2e0ce
Publikováno v:
IACR Transactions on Symmetric Cryptology, Vol 2021, Iss 4 (2021)
In CRYPTO’16, Cogliati and Seurin proposed a block cipher based nonce based MAC, called Encrypted Wegman-Carter with Davies-Meyer (EWCDM), that gives 2n/3 bit MAC security in the nonce respecting setting and n/2 bit security in the nonce misuse set
Externí odkaz:
https://doaj.org/article/f72e42b4173c42ecb7412ac4ef65fc1a
Autor:
Avik Chakraborti, Nilanjan Datta, Ashwin Jha, Cuauhtemoc Mancillas-López, Mridul Nandi, Yu Sasaki
Publikováno v:
IACR Transactions on Symmetric Cryptology, Vol 2020, Iss S1 (2020)
NIST has recently initiated a standardization project for efficient lightweight authenticated encryption schemes. SUNDAE, a candidate in this project, achieves optimal state size which results in low circuit overhead on top of the underlying block ci
Externí odkaz:
https://doaj.org/article/e95f774ff2534b17b227f67a50dbd242
Publikováno v:
IACR Transactions on Symmetric Cryptology, Vol 2020, Iss S1 (2020)
In CHES 2017, Chakraborti et al. proposed COFB, a rate-1 sequential block cipher-based authenticated encryption (AE) with only 1.5n-bit state, where n denotes the block size. They used a novel approach, the so-called combined feedback, where each blo
Externí odkaz:
https://doaj.org/article/132a87550a8c4a38a419e0063b4d865f
Autor:
Donghoon Chang, Nilanjan Datta, Avijit Dutta, Bart Mennink, Mridul Nandi, Somitra Sanadhya, Ferdinand Sibleyras
Publikováno v:
IACR Transactions on Symmetric Cryptology, Vol 2019, Iss 4 (2020)
Authenticated encryption schemes are usually expected to offer confidentiality and authenticity. In case of release of unverified plaintext (RUP), an adversary gets separated access to the decryption and verification functionality, and has more power
Externí odkaz:
https://doaj.org/article/65604ac7fd004dc2b23b95e8a0b19403
Autor:
Avik Chakraborti, Nilanjan Datta, Ashwin Jha, Cuauhtemoc Mancillas-López, Mridul Nandi, Yu Sasaki
Publikováno v:
IACR Transactions on Symmetric Cryptology, Vol 2019, Iss 4 (2020)
Owing to the growing demand for lightweight cryptographic solutions, NIST has initiated a standardization process for lightweight cryptographic algorithms. Specific to authenticated encryption (AE), the NIST draft demands that the scheme should have
Externí odkaz:
https://doaj.org/article/1d6bb83925fb44f89064f8dcef03c9ee
Publikováno v:
IACR Transactions on Symmetric Cryptology, Pp 268-305 (2017)
At CRYPTO 2011, Yasuda proposed the PMAC_Plus message authentication code based on an n-bit block cipher. Its design principle inherits the well known PMAC parallel network with a low additional cost. PMAC_Plus is a rate-1 construction like PMAC (i.e
Externí odkaz:
https://doaj.org/article/1d4ad0709a32461fb67c7f5c89d793bb
Publikováno v:
IACR Transactions on Symmetric Cryptology, Pp 143-161 (2017)
The authenticated encryption scheme COLM is a third-round candidate in the CAESAR competition. Much like its antecedents COPA, ELmE, and ELmD, COLM consists of two parallelizable encryption layers connected by a linear mixing function. While COPA use
Externí odkaz:
https://doaj.org/article/14b31f575cb44c1392dcf23f2522fc50
Publikováno v:
IACR Transactions on Symmetric Cryptology, Vol 2018, Iss 3 (2018)
SUM-ECBC (Yasuda, CT-RSA 2010) is the first beyond birthday bound (BBB) secure block cipher based deterministic MAC. After this work, some more BBB secure deterministic MACs have been proposed, namely PMAC_Plus (Yasuda, CRYPTO 2011), 3kf9 (Zhang et a
Externí odkaz:
https://doaj.org/article/a2c53832e7de4e1aa95b56b5f1b8a440