Zobrazeno 1 - 10
of 441
pro vyhledávání: '"Pseudorandom permutation"'
Publikováno v:
Advances in Mathematics of Communications. 17:771-798
A tweakable enciphering scheme (TES) is a length preserving (tweakable) encryption scheme that provides (tweakable) strong pseudorandom permutation security on arbitrarily long messages. TES is traditionally built using block ciphers and the security
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::254f9fc3f9d042a4651583dabd5d049c
https://doi.org/10.3934/amc.2021021
https://doi.org/10.3934/amc.2021021
Publikováno v:
IACR Transactions on Symmetric Cryptology, Pp 105-142 (2017)
CAESAR has caused a heated discussion regarding the merits of one-pass encryption and online ciphers. The latter is a keyed, length preserving function which outputs ciphertext blocks as soon as the respective plaintext block is available as input. T
Externí odkaz:
https://doaj.org/article/f946a7eba8454b0e9dd5786a781d86a5
Publikováno v:
Dianxin kexue, Vol 32, Pp 82-87 (2016)
As APT（advanced persistent threat）attacks are increasingly frequently,higher requirements for the detection of APT attacks were proposed.It was an effective method to early discover the attack behavior of APT based on homologous behavior analysis
Externí odkaz:
https://doaj.org/article/223c7ca9c45c4a53a560c1cc20dad297
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Autor:
Paul Crowley, Eric Biggers
Publikováno v:
IACR Transactions on Symmetric Cryptology, Vol 2018, Iss 4 (2018)
We present HBSH, a simple construction for tweakable length-preserving encryption which supports the fastest options for hashing and stream encryption for processors without AES or other crypto instructions, with a provable quadratic advantage bound.
Externí odkaz:
https://doaj.org/article/f1dc249c33e744ba8252a5e0a5bc1466
Autor:
Arsalan Vahi, Somaye Jafarali Jassbi
Publikováno v:
Wireless Personal Communications. 114:2283-2314
This paper presents a new hybrid encryption algorithm with 16-bit block size and a 128-bit initialization vector, referred to as SEPAR, and it is suitable for IoT devices. The design idea of this algorithm combines pseudorandom permutation and pseudo
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::14ab47d71b3b001a1d8d48809fda5a35
https://doi.org/10.1007/s11277-020-07476-y
https://doi.org/10.1007/s11277-020-07476-y
Autor:
B. N. B. Ray, Rashmita Padhi
Publikováno v:
Digital Democracy – IT for Change ISBN: 9789811627224
In this paper, we study a particular class of symmetric algorithms that aim to ensure confidentiality by using a functionality that is tweakable enciphering scheme. A tweakable enciphering scheme is a length preserving encryption protocol which can e
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::87e23c94d3255bd863b56d1b2d5787f5
https://doi.org/10.1007/978-981-16-2723-1_11
https://doi.org/10.1007/978-981-16-2723-1_11
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783030920777
Lecture Notes in Computer Science
Lecture Notes in Computer Science
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::007d57e47362809a23b2015b822edfcb
https://doi.org/10.1007/978-3-030-92078-4_14
https://doi.org/10.1007/978-3-030-92078-4_14
Autor:
Lei Wang, Yasir Nawaz
Publikováno v:
Symmetry; Volume 11; Issue 12; Pages: 1485
Designing a secure construction has always been a fascinating area for the researchers in the field of symmetric key cryptography. This research aimed to make contributions to the design of secure block cipher in the ideal cipher model whose underlyi
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::416d723bc2c25ee039237dc6dbc7591c
Autor:
Hong-Gang Hu, Ping Zhang
Publikováno v:
Journal of Computer Science and Technology. 33:1261-1277
This paper describes a generalized tweakable blockcipher HPH (Hash-Permutation-Hash), which is based on a public random permutation P and a family of almost-XOR-universal hash functions $$ \mathcal{H}={\left\{ HK\right\}}_{K\in \mathcal{K}} $$ as a t
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::5a5d8e5cc191e9ba5c25d683de0986b2
https://doi.org/10.1007/s11390-018-1886-4
https://doi.org/10.1007/s11390-018-1886-4