Volume 7, Issue 2

 

ارسال های اخیر

  • Cryptanalysis of some first round CAESAR candidates 

    Alizadeh, J.؛ Aref, M. R.؛ Bagheri, N.؛ Sadeghi, H. (Iranian Society of Cryptology, 2015-07-01)
    ΑΕS _ CMCCv₁, ΑVΑLΑNCHEv₁, CLΟCv₁, and SILCv₁ are four candidates of the first round of CAESAR. CLΟCv₁ is presented in FSE 2014 and SILCv₁ is designed upon it with the aim of optimizing the hardware implementation cost. ...

  • A collusion mitigation scheme for reputation systems 

    Niknafs, M.؛ Dorri Nogoorani, S.؛ Jalili, R. (Iranian Society of Cryptology, 2015-07-01)
    Reputation management systems are in wide-spread use to regulate collaborations in cooperative systems. Collusion is one of the most destructive malicious behaviors in which colluders seek to affect a reputation management ...

  • Enhancing privacy of recent authentication schemes for low-cost RFID systems 

    Baghery, K.؛ Abdolmaleki, B.؛ Akhbari, B.؛ Aref, M. R. (Iranian Society of Cryptology, 2015-07-01)
    Nowadays Radio Frequency Identification (RFID) systems have appeared in lots of identification and authentication applications. In some sensitive applications, providing secure and confidential communication is very important ...

  • Efficient implementation of low time complexity and pipelined bit-parallel polynomial basis multiplier over binary finite fields 

    Rashidi, B.؛ Rezaeian Farashahi, R.؛ Sayedi, S. M. (Iranian Society of Cryptology, 2015-07-01)
    This paper presents two efficient implementations of fast and pipelined bit-parallel polynomial basis multipliers over GF (2m) by irreducible pentanomials and trinomials. The architecture of the first multiplier ...

  • Editorial 

    Jalili, R. (Iranian Society of Cryptology, 2015-07-01)
    From the Editor-in-Chief

  • Computationally secure multiple secret sharing: models, schemes, and formal security analysis 

    Mashhadi, S. (Iranian Society of Cryptology, 2015-07-01)
    A multi-secret sharing scheme (MSS) allows a dealer to share multiple secrets among a set of participants. in such a way a multi-secret sharing scheme (MSS) allows a dealer to share multiple secrets among a set of participants, ...

  • EEH: AGGH-like public key cryptosystem over the eisenstein integers using polynomial representations 

    Ebrahimi Atani, R.؛ Ebrahimi Atani, Sh.؛ Hassani Karbasi, A. (Iranian Society of Cryptology, 2015-07-01)
    GGH class of public-key cryptosystems relies on computational problems based on the closest vector problem (CVP) in lattices for their security. The subject of lattice based cryptography is very active and there have ...