|
Web
Education
Viewing 1-5 of 5 total results
A Secured Smart Card using a Pseudorandom Affine ...
The proposed LIRKES needs a strong pseudorandom permutation (PRP) as its basic building block, so we introduce a new symmetric-key block cipher, with variable block and key lengths, referred to as PATFC (Pseudorandom Affine Transformation based Feistel Cipher), appropriate for software and hardware implementations....
EHAB, YASIEN, and FURUKAWA A Secured Smart Card Using a ...
The proposed LIRKES needs a strong pseudorandom permutation (PRP) as its basic building block, so we introduce a new symmetric-key block cipher, with variable block and key lengths, referred to as PATFC (Pseudorandom Affine Transformation based Feistel Cipher), appropriate for software and hardware implementations....
Papers from EPRINT 2004
In~\cite{B02} it was proved that 20 out of 64 PGV-hash functions~\cite{P94} based on block cipher are collision resistant and one-way-secure in black-box model of the underlying block cipher. Here, we generalize the definition of PGV-hash function into a hash family and we will prove that besides the previous 20 hash functions we have 22 more ...
Computer Security Final Flashcards | Quizlet
•Construct an affine transformation that maps 4 letter blocks to other 4 letter blocks HOWDY DOO becomes HOWD YDOO replace A=00, B=01, etc. HOWD YDOO becomes 07142203 24031414 The largest value that can appear in a block of 4 is ZZZZ = 25252525. So use modulo 25252526 Encipher: C ≡ mP + b (mod 25252526) Decipher: P ≡ m' (C-b) (mod 25252526)
Wireless Security and Cryptography: Specifications and ...
Currently, the only known secure SSSC is to use a block cipher in a 1-bit CFB mode (see [4]). This method is inefficient since it requires a block cipher call per bit of encryption. There have been other direct proposals of SSSC. Unfortunately, all such proposals have turned out to be insecure.
|
