Scalable MD5 Crypt Cracker on PetaScale Supercomputer

2012 ◽  
Vol 532-533 ◽  
pp. 1080-1084 ◽  
Author(s):  
Zhi Cai Shi ◽  
Can Qun Yang ◽  
Qiang Wu
Keyword(s):  
Large Scale ◽  
Experimental Results ◽  
Brute Force ◽  
Full System ◽  
Computing Systems ◽  
Unix System ◽  
Cryptographic Algorithm ◽  
Brute Force Attack ◽  
Heterogeneous Programming ◽  
Password Cracking

MD5 Crypt is a cryptographic algorithm used commonly in UNIX system for authentication. Thanks to the additional randomization of the salt and complexity of the scheme, it makes the traditional password cracking techniques invalid on common computing systems so that the security of the system is guaranteed. As a result of the thriving of petaflops heterogeneous supercomputer system in recent decades, the security of MD5 Crypt is facing a threat of brute-force attack again. However, the complexity of heterogeneous programming and the sophistication of large-scale parallelism still hamper the password recovering. In this paper, we implemented brute-force attack of MD5 Crypt on Tianhe-1A，the world’s fastest supercomputer， by organizing the assignment between CPU and GPU reasonably and making several optimizations according to MD5 Crypt for GPU. Based on the experimental results, our algorithm achieves a great scalability. It checked more than 1.8 billion passwords in a second on the full system. Thus it issues a new challenge to the security of MD5 crypt for authentication.

scholarly journals A New Symmetric Key Cryptographic Algorithm using Paley Graphs and ASCII Values

2021 ◽  
Vol 297 ◽  
pp. 01046
Author(s):  
Zhour Oumazouz ◽  
Driss Karim
Keyword(s):  
Brute Force ◽  
Strong Regularity ◽  
Quadratic Residues ◽  
Cryptographic Algorithm ◽  
Paley Graph ◽  
Encryption And Decryption ◽  
Symmetric Key ◽  
Brute Force Attack ◽  
The Moment ◽  
Paley Graphs

The main objective of the study conducted in this article is to introduce a new algorithm of encryption and decryption of a sensitive message after transforming it into a binary message. Our proposed encryption algorithm is based on the study of a particular graph constructed algebraically from the quadratic residues. We have exploited the Paley graph to introduce an abstract way of encryption of such message bit according to the other message bits by the intermidiate study of the neighborhood of a graph vertex. The strong regularity of the Paley graphs and the unknown behavior of the quadratic residues will play a very important role in the cryptanalysis part which allows to say that the brute force attack remains for the moment the only way to obtain the set of possible messages.

scholarly journals Analysis Dictionary Attack Dan Modifikasi Password Cracking Serta Strategi Antisipasi

2017 ◽  
Vol 7 (1) ◽  
Author(s):  
Sayed Achmady
Keyword(s):  
Exhaustive Search ◽  
Brute Force ◽  
Dictionary Attack ◽  
Brute Force Attack ◽  
Password Cracking

Dalam konteks kriptanalisis dan keamanan komputer, dictionary attack adalah sebuah teknik untuk melawan cipher atau melawan mekanisme otentikasi dengan cara menentukan kunci dekripsi dengan mencari kemungkinan kombinasi kata yang terdapat di dalam sebuah kamus [1]. Pada dasarnya dictionary attack adalah pengembangan dari brute force attack, yaitu mencoba memecahkan kode dengan mencoba satu per satu kemungkinan secara berulang (exhaustive search). Akan tetapi dictionary attack bukan mencoba kombinasi satu per satu karakter yang tersedia seperti brute force, melainkan mencoba kombinasi kata yang paling mungkin berhasil dengan input sebuah “list of kata” yang dapat didefinisikan (disebut juga kamus), yang biasanya berasal dari daftar kombinasi kata-kata umum yang terdapat dalam kamus, misalnya kamus bahasa Inggris. Dictionary attack merupakan serangan yang sangat efektif untuk memecahkan kode dan sering digunakan hacker untuk membobol sistem keamanan yang berupa password, seperti akun email, akun jejaring sosial, halaman administrator situs web, dan lain-lain. Dictionary attack dianggap efektif karena memanfaatkan psikologi manusia, yaitu kebiasaan bahwa pengguna akun akan menggunakan kata-kata yang lumrah dan mudah diingat sebagai password suatu akun tertentu [2]. Selain itu, dictionary attack juga dikembangkan variasinya dan semakin tinggi efektivitasnya, sehingga hingga saat ini teknik ini masih sering digunakan untuk membobol password pengguna sebuah akun. jurnal ini membahas mengenai studi dictionary attack mengenai penjelasan singkat, prinsip kerja, dan bagaimana pengembangan dari dictionary attack dalam konteks penerapannya untuk membobol password sebuah akun tertentu. Variasi dari dictionary attack yang akan dibahas dalam makalah ini yaitu dictionary attack, hybrid dictionary attack, dan pre-computed dictionary attack. Selain itu, pada makalah ini akan dianalisis kelebihan dan kelemahan dictionary attack dan masing-masing modifikasinya, serta solusi yang dapat dilakukan dalam melawan dictionary attack. Kata kunci: Dictionary Attack, password, brute force, kamus, list of hash.

PARTIALLY PIPELINED VLSI IMPLEMENTATION OF BLOWFISH ENCRYPTION/DECRYPTION ALGORITHM

2010 ◽  
Vol 10 (03) ◽  
pp. 327-341 ◽  
Author(s):  
P. KARTHIGAIKUMAR ◽  
K. BASKARAN
Keyword(s):  
Scenario Analysis ◽  
Hardware Implementation ◽  
Third Party ◽  
Brute Force ◽  
Case Scenario ◽  
Worst Case ◽  
Quantum Transmission ◽  
Cryptographic Algorithm ◽  
Encryption Decryption ◽  
Brute Force Attack

Information security has always been important in all aspects of life as technology controls various operations. Cryptography provides a layer of security in cases where the medium of transmission is susceptible to interception, by translating a message into a form that cannot be read by an unauthorized third party. All non-quantum transmission media known today are capable of being intercepted in one way or another. This paper seeks to implement a novel partial pipelined, robust architecture of Blowfish algorithm in hardware. Blowfish algorithm has no known cryptanalysis. The best proven attack against Blowfish till date is an exhaustive brute-force attack. This makes Blowfish an attractive cryptographic algorithm since it is not susceptible to any reasonable attack. The hardware implementation of Blowfish would be a powerful tool for any mobile device, or any technology requiring strong encryption. The proposed design uses the core_slow library for worst-case scenario analysis and attains an incredible encryption speed of 2670 MBits/sec and decryption speed of 2642 MBits/sec. The area is 5986 LUT's and the power is a mere 77 mW.

scholarly journals An Image Encryption Scheme Using 2D Generalized Sawtooth Maps

2014 ◽  
Vol 12 (6) ◽  
pp. 3570-3579
Author(s):  
Ruisong Ye ◽  
Wenping Yu
Keyword(s):  
Statistical Analysis ◽  
Detailed Analysis ◽  
Image Encryption ◽  
Experimental Results ◽  
Encryption Scheme ◽  
Brute Force ◽  
Key Space ◽  
Image Pixels ◽  
Brute Force Attack ◽  
Gray Values

In this paper, a new image encryption scheme based on 2D generalized sawtooth map is proposed. Utilizing the chaoticnature of 2D generalized sawtooth maps, image pixel positions are scrambled and image pixels gray values are changedto encrypt the plain-images. Experimental results have been carried out with detailed analysis to demonstrate that theproposed image encryption scheme possesses large key space to resist brute-force attack and possesses good statisticalproperties to frustrate statistical analysis attacks.

scholarly journals Dekripsi Algoritma Rivest-Shamir-Adleman Dengan Komputasi Paralel Menggunakan Message Parsing Interface

2017 ◽  
Vol 8 (1) ◽  
Author(s):  
Evangs Mailoa
Keyword(s):  
Parallel Computing ◽  
Parallel Computation ◽  
Message Passing ◽  
Message Passing Interface ◽  
Prime Numbers ◽  
Brute Force ◽  
Cryptographic Algorithm ◽  
Large Numbers ◽  
Long Time ◽  
Brute Force Attack

Abstract. Rivest-Shamir-Adleman algorithm is a cryptographic algorithm that is difficult to be dismantled. This is due to the difficulty of factoring large numbers modulus n into prime factors (p and q). The process of modulus factoring requires a very long time if solved by serial computation. Brute Force Attack method is used to find large prime numbers p and q with parallel computation. Applications for the factorization of prime numbers p and q are developed using Visual C ++ and Message Passing Interface, while the decryption process developed with Java. The results show a parallel computing process faster than a serial for factoring very large numbers n, and very slow if the n is too small.Keywords: Rivest-Shamir-Adleman Algorithm, Brute Force Attack, Message Passing Interface. Abstrak. Algoritma Rivest-Shamir-Adleman merupakan salah satu algoritma kriptografi yang sukar untuk dibongkar. Hal ini dikarenakan sulitnya memfaktorkan bilangan modulus n yang besar menjadi faktor-faktor prima (nilai p dan q). Proses untuk faktorisasi modulus n membutuhkan waktu yang sangat lama apabila diselesaikan dengan komputasi serial. Penelitian ini menggunakan metode Brute Force Attack untuk menemukan bilangan prima p dan q yang sangat besar yang dikerjakan secara paralel. Aplikasi untuk faktorisasi bilangan prima p dan q dikembangkan menggunakan Visual C++ memanfaatkan Message Passing Interface, sedangkan aplikasi proses dekripsi dengan Java. Hasil ujicoba menunjukkan proses komputasi paralel lebih cepat dibandingkan secara serial untuk memfaktorkan bilangan n yang sangat besar, dan menjadi sangat lambat apabila bilangan n terlalu kecil. Kata kunci: Algoritma Rivest-Shamir-Adleman, Brute Force Attack, Message Passing Interface.

scholarly journals Symmetric Cryptographic Framework for Network Security

2019 ◽  
Vol 8 (10) ◽  
pp. 3803-3808
Keyword(s):  
Network Security ◽  
Entropy Measure ◽  
Brute Force ◽  
Symmetric Encryption ◽  
Digital Environment ◽  
Differential Attack ◽  
Mean Values ◽  
Cryptographic Algorithm ◽  
Encryption Algorithms ◽  
Brute Force Attack

In this rapidly developing digital environment, a single cryptographic algorithm becomes inefficient and incapable to hold the secrecy of data. A symmetric cryptographic framework is proposed which provides the platform for using the existing and future algorithms in a secured manner. In this research paper, totally six algorithms have been taken into the framework, two algorithms for text, three algorithms for image, and one algorithm for video. The algorithms are grouped into the proposed symmetric encryption framework which provides better network security for the adopted environment. Cryptanalysis and brute force attack have been done to assess the strength of the algorithms incorporated in the framework. Character repetition frequency and brute force attack are analyzed for text encryption algorithms. Mean values, Entropy measure, Differential attack and brute force attack are analyzed and used to assess the reliability of the image and video encryption algorithms. The framework is designed in such a way to adopt the existing and future algorithms. The proposed framework provides a bridge to achieve quality, upgradability, maintainability, and longer usability in applied applications..

Cloud-Based Scalable Parallel Electromagnetic Tools for Full-System Simulation

2011 ◽  
Author(s):  
Vikram Jandhyala ◽  
Dipanjan Gope ◽  
Swagato Chakraborty ◽  
Xiren Wang
Keyword(s):  
Large Scale ◽  
Consumer Electronics ◽  
Boundary Element Methods ◽  
Public Cloud ◽  
Full System ◽  
Computing Systems ◽  
Parasitic Extraction ◽  
On Demand ◽  
Commodity Computing ◽  
Eda Tools

Large-scale public cloud commodity computing is a potential paradigm-shifter for EDA tools. However, to go beyond merely web-hosted software and to exploit the true power of on-demand scalable computing is as yet an unmet challenge on many fronts. In this paper, we examine one computationally expensive and rapidly growing area within EDA as a candidate for the cloud, namely parasitic extraction and electromagnetic field simulation. With the growing emphasis on multifunctional systems in consumer electronics around commodity chips, the need for scale and speed in such tools is paramount. We examine from three aspects the suitability of and modifications needed to accelerated multilevel algorithms in boundary element methods in order to ensure cloud deployment: scalability without hitting Amdahl’s law prematurely, fault tolerance with low time penalties in realistic computing systems, and encryption-free approaches to ensuring IP security.

scholarly journals A Survey on Machine-Learning Based Security Design for Cyber-Physical Systems

2021 ◽  
Vol 11 (12) ◽  
pp. 5458
Author(s):  
Sangjun Kim ◽  
Kyung-Joon Park
Keyword(s):  
Machine Learning ◽  
Physical System ◽  
Large Scale ◽  
Computing System ◽  
Future Research ◽  
Physical Security ◽  
Computing Systems ◽  
Physical Systems ◽  
Security Research ◽  
Simultaneous Control

A cyber-physical system (CPS) is the integration of a physical system into the real world and control applications in a computing system, interacting through a communications network. Network technology connecting physical systems and computing systems enables the simultaneous control of many physical systems and provides intelligent applications for them. However, enhancing connectivity leads to extended attack vectors in which attackers can trespass on the network and launch cyber-physical attacks, remotely disrupting the CPS. Therefore, extensive studies into cyber-physical security are being conducted in various domains, such as physical, network, and computing systems. Moreover, large-scale and complex CPSs make it difficult to analyze and detect cyber-physical attacks, and thus, machine learning (ML) techniques have recently been adopted for cyber-physical security. In this survey, we provide an extensive review of the threats and ML-based security designs for CPSs. First, we present a CPS structure that classifies the functions of the CPS into three layers: the physical system, the network, and software applications. Then, we discuss the taxonomy of cyber-physical attacks on each layer, and in particular, we analyze attacks based on the dynamics of the physical system. We review existing studies on detecting cyber-physical attacks with various ML techniques from the perspectives of the physical system, the network, and the computing system. Furthermore, we discuss future research directions for ML-based cyber-physical security research in the context of real-time constraints, resiliency, and dataset generation to learn about the possible attacks.

Computational fluid dynamics of rectangular external loop airlift reactor

2020 ◽  
Vol 18 (5-6) ◽  
Author(s):  
Shivanand M. Teli ◽  
Channamallikarjun S. Mathpati
Keyword(s):  
Large Scale ◽  
Lift Coefficient ◽  
Volume Ratio ◽  
Reynolds Stress Model ◽  
Airlift Reactor ◽  
Experimental Results ◽  
Turbulent Dispersion ◽  
Drag Forces ◽  
External Loop ◽  
Turbulent Models

AbstractThe novel design of a rectangular external loop airlift reactor is at present the most used large-scale reactor for microalgae culture. It has a unique future for a large surface to volume ratio for exposure of light radiation for photosynthesis reaction. The 3D simulations have been performed in rectangular EL-ALR. The Eulerian–Eulerian approach has been used with a dispersed gas phase for different turbulent models. The performance and applicability of different turbulent model’s i.e., K-epsilon standard, K-epsilon realizable, K-omega, and Reynolds stress model are used and compared with experimental results. All drag forces and non-drag forces (turbulent dispersion, virtual mass, and lift coefficient) are included in the model. The experimental values of overall gas hold-up and average liquid circulation velocity have been compared with simulation and literature results. It is seemed to give good agreements. For the different elevations in the downcomer section, liquid axial velocity, turbulent kinetic energy, and turbulent eddy dissipation experimental have been compared with different turbulent models. The K-epsilon Realizable model gives better prediction with experimental results.

scholarly journals Evaluation of recent advances in recommender systems on Arabic content

2021 ◽  
Vol 8 (1) ◽  
Author(s):  
Mehdi Srifi ◽  
Ahmed Oussous ◽  
Ayoub Ait Lahcen ◽  
Salma Mouline
Keyword(s):  
Recommender Systems ◽  
High Performance ◽  
Large Scale ◽  
State Of The Art ◽  
Experimental Results ◽  
Recent Advances ◽  
Research Gap ◽  
Text Preprocessing

AbstractVarious recommender systems (RSs) have been developed over recent years, and many of them have concentrated on English content. Thus, the majority of RSs from the literature were compared on English content. However, the research investigations about RSs when using contents in other languages such as Arabic are minimal. The researchers still neglect the field of Arabic RSs. Therefore, we aim through this study to fill this research gap by leveraging the benefit of recent advances in the English RSs field. Our main goal is to investigate recent RSs in an Arabic context. For that, we firstly selected five state-of-the-art RSs devoted originally to English content, and then we empirically evaluated their performance on Arabic content. As a result of this work, we first build four publicly available large-scale Arabic datasets for recommendation purposes. Second, various text preprocessing techniques have been provided for preparing the constructed datasets. Third, our investigation derived well-argued conclusions about the usage of modern RSs in the Arabic context. The experimental results proved that these systems ensure high performance when applied to Arabic content.

Sign in / Sign up

Export Citation Format

Share Document