Show/Hide Menu
Hide/Show Apps
Logout
Türkçe
Türkçe
Search
Search
Login
Login
OpenMETU
OpenMETU
About
About
Open Science Policy
Open Science Policy
Open Access Guideline
Open Access Guideline
Postgraduate Thesis Guideline
Postgraduate Thesis Guideline
Communities & Collections
Communities & Collections
Help
Help
Frequently Asked Questions
Frequently Asked Questions
Guides
Guides
Thesis submission
Thesis submission
MS without thesis term project submission
MS without thesis term project submission
Publication submission with DOI
Publication submission with DOI
Publication submission
Publication submission
Supporting Information
Supporting Information
General Information
General Information
Copyright, Embargo and License
Copyright, Embargo and License
Contact us
Contact us
Analysis of Ascon, DryGASCON, and Shamash Permutations
Date
2020-09-01
Author
Tezcan, Cihangir
Metadata
Show full item record
This work is licensed under a
Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License
.
Item Usage Stats
110
views
0
downloads
Cite This
Subject Keywords
Lightweight cryptography
,
Authenticated encryption
,
Cryptanalysis
URI
http://www.ijiss.org/ijiss/index.php/ijiss/article/view/762
https://hdl.handle.net/11511/90783
Journal
International Journal of Information Security Science
Collections
Graduate School of Informatics, Article
Suggestions
OpenMETU
Core
Optimization of Advanced Encryption Standard on Graphics Processing Units
Tezcan, Cihangir (2021-01-01)
Graphics processing units (GPUs) are specially designed for parallel applications and perform parallel operations much faster than central processing units (CPUs). In this work, we focus on the performance of the Advanced Encryption Standard (AES) on GPUs. We present optimizations which remove bank conflicts in shared memory accesses and provide 878.6 Gbps throughput for AES-128 encryption on an RTX 2070 Super, which is equivalent to 4.1 Gbps per Watt. Our optimizations provide more than 2.56x speed-up agai...
Analysis and Comparison of Fully Homomorphic Encryption Approaches Over Integers
Bozkurt, Cansu; Cenk, Murat; Betin Onur, Cansu; Department of Cryptography (2022-2-10)
The time period after the mid-20th century was named as information age or digital age. In that age, the world is being digitalized very fastly. The amount of data transferred and processed online is increasing rapidly. As a result, data protection became an essential topic for researchers. To process or make a computation on the encrypted data deciphering ciphertext first causes a security flaw. Homomorphic encryption (HE) algorithms were designed to make computations on data without deciphering it. Howeve...
Statistical analysis of block ciphers and hash functions
Sulak, Fatih; Doğanaksoy, Ali; Department of Cryptography (2011)
One of the most basic properties expected from block ciphers and hash functions is passing statistical randomness testing, as they are supposed to behave like random mappings. Previously, testing of AES candidate block ciphers was done by using the statistical tests defined in the NIST Test Suite. As some of the tests in this suite require long sequences, data sets are formed by concatenating the outputs of the algorithms obtained from various input types. However, the nature of block cipher and hash functi...
Analysis of recent attacks on SSL/TLS protocols
Özden, Duygu; Cenk, Murat; Department of Cryptography (2016)
Transport Layer Security(TLS) and its predecessor Secure Socket Layer(SSL) are two important cryptographic, certificate based protocols that satisfy secure communication in a network channel. They are widely used in many areas such as online banking systems, online shopping, e-mailing, military systems or governmental systems. Being at the center of secure communication makes SSL and TLS become the target of attackers and an important field of study for researchers. So many vulnerabilities and attacks towar...
A Survey on the provable security using indistinguishability notion on cryptographic encryption schemes
Ayar, Emre; Doğanaksoy, Ali; Koçak, Onur; Department of Cryptography (2018)
For an encryption scheme, instead of Shannon's perfect security definition, Goldwasser and Micali defined a realistic provable security called semantic security. Using indistinguishability notion, one can define security levels according to the polynomial time adversaries' capabilities such as chosen plaintext attacks (CPA) and chosen ciphertext attacks (CCA) for both symmetric and asymmetric encryption schemes in addition to the hard mathematical problems the algorithms based on. Precautions to prevent the...
Citation Formats
IEEE
ACM
APA
CHICAGO
MLA
BibTeX
C. Tezcan, “Analysis of Ascon, DryGASCON, and Shamash Permutations,”
International Journal of Information Security Science
, pp. 172–187, 2020, Accessed: 00, 2021. [Online]. Available: http://www.ijiss.org/ijiss/index.php/ijiss/article/view/762.