Filters








179 Hits in 6.7 sec

A natural language approach to automated cryptanalysis of two-time pads

Joshua Mason, Kathryn Watkins, Jason Eisner, Adam Stubblefield
2006 Proceedings of the 13th ACM conference on Computer and communications security - CCS '06  
Pe rm iss ion is gra nte d to me mb ers of INC ITS , its tec hn ica l co mm itte es , an d the ir as so cia ted tas k gro up s to rep rod uc e thi s do cu me nt for the pu rpo se s of INC ITS sta nd ard  ...  Pe rm iss ion is gra nte d to me mb ers of IN CI TS , its tec hn ica l co mm itte es , an d the ir as so cia ted tas k gro up s to rep rod uc e thi s do cu me nt for the pu rpo se s of IN CI TS sta nd  ...  Pe rm iss io n is gr an te d to m em be rs of IN CI TS , its te ch ni ca l co m m itt ee s, an d th ei r as so cia te d ta sk gr ou ps to re pr od uc e th is do cu m en t fo r th e pu rp os es of IN CI  ... 
doi:10.1145/1180405.1180435 dblp:conf/ccs/MasonWES06 fatcat:azg5dme5c5dulnd3v53hczxloe

A Generic Genetic Algorithm to Automate an Attack on Classical Ciphers

Anukriti Dureha, Arashdeep Kaur
2013 International Journal of Computer Applications  
The underlying objective of this paper is to automate the process of cryptanalysis in order to render salvage of time, and resources available, preserve population diversity, minimize the convergence rate  ...  While numerous algorithms have been proposed to automate this process for variegated ciphers, these approaches are yet isolated from each other.  ...  Hence, a need to foster effective mechanisms to facilitate cryptanalysis of a cipher by procuring salvage of time and resources is intuited.  ... 
doi:10.5120/10687-5588 fatcat:pngoquvegfgqnjoogmin4aeyha

On the Construction and Cryptanalysis of Multi-Ciphers [article]

Arush Chhatrapati
2021 IACR Cryptology ePrint Archive  
Following a brief overview of classical cryptography and steganography, we consider strategies that can be used to creatively combine these two fields to construct multi-ciphers.  ...  Note that in the full version of the paper, which can be accessed here, we include three full-length sections on background related to the field of classical cryptography, the cryptanalysis of classical  ...  approaches at the time.  ... 
dblp:journals/iacr/Chhatrapati21 fatcat:jk7ysj4zzze2vhelqcs44rnzt4

Keynote Speakers Biographies and Abstracts

2008 2008 International Conference on Computational Intelligence for Modelling Control & Automation  
Today, half a century later, we have translation software, but nothing that approaches the level of human translation.  ...  One of them read "Electric brain capable of translating foreign languages is being built."  ...  ; and (b) providing a capability to compute with natural language descriptions of perceptions.  ... 
doi:10.1109/cimca.2008.227 fatcat:7duvmjrj4nhy5cbvd6txoglfee

Toward Human Level Machine Intelligence - Is It Achievable? The Need for a Paradigm Shift

Lotfi Zadeh
2008 IEEE Computational Intelligence Magazine  
Today, half a century later, we have translation software, but nothing that approaches the level of human translation.  ...  One of them read "Electric brain capable of translating foreign languages is being built."  ...  ; and (b) providing a capability to compute with natural language descriptions of perceptions.  ... 
doi:10.1109/mci.2008.926583 fatcat:wno4ooqxlze3za2rmuz6erljwu

Security Margin Evaluation of SHA-3 Contest Finalists through SAT-Based Attacks [chapter]

Ekawat Homsirikamol, Paweł Morawiecki, Marcin Rogawski, Marian Srebrny
2012 Lecture Notes in Computer Science  
We use a new toolkit which greatly simplifies the most arduous stages of this type of cryptanalysis and helps to mount the attacks in a uniform way.  ...  Our attacks use a method called logical cryptanalysis where the original task is expressed as a SATisfiability problem.  ...  As a vast majority of modern ciphers and hash functions (in particular, the SHA-3 contest finalists) has an iterative design, this approach can be applied naturally.  ... 
doi:10.1007/978-3-642-33260-9_4 fatcat:teb6vpzj5ned3kwchv5udq2qwq

Translation of Algorithmic Descriptions of Discrete Functions to SAT with Applications to Cryptanalysis Problems [article]

Alexander Semenov, Ilya Otpuschennikov, Irina Gribanova, Oleg Zaikin, Stepan Kochemazov
2020 arXiv   pre-print
We describe how cryptanalysis problems are reduced to SAT in such a way that it should be perceived as natural by the cryptographic community.  ...  In the present paper, we propose a technology for translating algorithmic descriptions of discrete functions to SAT. The proposed technology is aimed at applications in algebraic cryptanalysis.  ...  We are grateful to anonymous reviewers for their valuable comments that made it possible to significantly improve the quality of the present paper.  ... 
arXiv:1805.07239v5 fatcat:qrgcbbnag5a53davdbexvxbio4

Translation of Algorithmic Descriptions of Discrete Functions to SAT with Applications to Cryptanalysis Problems

Alexander Semenov, Ilya Otpuschennikov, Irina Gribanova, Oleg Zaikin, Stepan Kochemazov
2018 Logical Methods in Computer Science  
We describe how cryptanalysis problems are reduced to SAT in such a way that it should be perceived as natural by the cryptographic community.  ...  In the present paper, we propose a technology for translating algorithmic descriptions of discrete functions to SAT. The proposed technology is aimed at applications in algebraic cryptanalysis.  ...  We are grateful to anonymous reviewers for their valuable comments that made it possible to significantly improve the quality of the present paper.  ... 
doi:10.23638/lmcs-16(1:29)2020 fatcat:fuji3nvk75ggzb5535kccwdmbu

Malicious Code Detection: Run Trace Output Analysis by LSTM

Cengiz Acarturk, Melih Sirlanci, Pinar Gurkan Balikcioglu, Deniz Demirci, Nazenin Sahin, Ozge Acar Kucuk
2021 IEEE Access  
Malicious software threats and their detection have been gaining importance as a subdomain of information security due to the expansion of ICT applications in daily settings.  ...  The experiments showed that the ISM achieved an accuracy of 87.51% and a false positive rate of 18.34%, while BSM achieved an accuracy of 99.26% and a false positive rate of 2.62%.  ...  and benign executable files as two different natural languages.  ... 
doi:10.1109/access.2021.3049200 fatcat:if4bbuhilfhkvcpo4idckxe3wa

Linear Cryptanalysis for Block Ciphers [chapter]

Johannes Gehrke, Daniel Kifer, Ashwin Machanavajjhala, Arjen K. Lenstra, Phong Nguyen, Phong Nguyen, Daniele Micciancio, Scott Contini, Sabrina De Capitani diVimercati, Burt Kaliski, Stephen M Papa, William D. Casper (+13 others)
2011 Encyclopedia of Cryptography and Security  
Definition ℓ-diversity is a method for publishing data about individuals while limiting the amount of sensitive information disclosed about them.  ...  A few approaches are based on description logics [, ] . Entailment is not the only reasoning task relevant to logic-based authorization languages.  ...  The above approach provides good heuristic arguments for the strength of a cipher, but in order to rigorously prove the security against linear cryptanalysis, the designer also needs to take into account  ... 
doi:10.1007/978-1-4419-5906-5_589 fatcat:zn4blza5ezggzhayzeuxeix5oa

Automated Ciphertext—Only Cryptanalysis of the Bifid Cipher

António Machiavelo, Rogério Reis
2007 Cryptologia  
In this paper we describe a fully automated ciphertext-only cryptanalysis attack on the Bifid cipher, for which the original text language is known. We have implemented this attack using Python.  ...  We use an easily computable statistical function to find the period of the cipher, and then the key-table is generated in a fairly efficient way.  ...  Concluding remarks The method here presented, and its implementation as a computer program, permits to crack in an acceptable time any sufficiently large cryptogram, provided that the language of origin  ... 
doi:10.1080/01611190601134222 fatcat:u6yi5qrheva3xfcxx72usde5ce

A Powerful Genetic Algorithm to Crack a Transposition Cipher

Omar Alkathiry, Ahmad Al-Mogren
2014 International Journal of Future Computer and Communication  
of the most used words in the English language to evaluate the fitness of the keys in any generation, a dynamic selection method, and a variable generating number.  ...  Our experiments and results show mostly optimal solutions for the keys in linear time performance which is a dramatic improvement to the brute force algorithm that takes a factorial time to crack the key  ...  time and skim through the huge search space in a very fast and efficient manner, another advantage is the use of a dictionary of most common words in the English language in contrast to the bi-gram and  ... 
doi:10.7763/ijfcc.2014.v3.335 fatcat:44xyfrf2avdglnlxjp2g2iwjxa

When cryptography meets storage

Sarah M. Diesburg, Christopher R. Meyers, David M. Lary, An-I Andy Wang
2008 Proceedings of the 4th ACM international workshop on Storage security and survivability - StorageSS '08  
We also demonstrate how a simple application of Bloom filters can automatically extract plaintexts from two-time pads.  ...  In this paper, we empirically demonstrate two-time pad vulnerabilities in storage that are exposed via shifting file contents, in-place file updates, storage mechanisms hidden by layers of abstractions  ...  Peterson et. al for providing accesses to various to the AON secure deletion versioning file system code.  ... 
doi:10.1145/1456469.1456472 dblp:conf/storagess/DiesburgMLW08 fatcat:4kh76mwrqnaenhkyfjlsvmyaii

The BRUTUS automatic cryptanalytic framework

Markku-Juhani O. Saarinen
2015 Journal of Cryptographic Engineering  
We highlight that some of the CAESAR algorithms pose an elevated risk if employed in real-life protocols due to a class of adaptive-chosen-plaintext attacks.  ...  We have developed a testing framework, BRUTUS, to facilitate automatic detection of simple security lapses and susceptible statistical structures across all ciphers.  ...  This two-algorithm approach has been the predominant way of securing messages in popular Internet security protocols since mid-1990's.  ... 
doi:10.1007/s13389-015-0114-1 fatcat:nubvjj5p65ac5emvq3tdtfukg4

Cryptography Chaos Theory

Bulai Rodica, Victor Fanari
2018 Central and Eastern European eDem and eGov Days  
The attempts to develop new encryption ?lgorithms based on chaos theory have evolved gradually from simple solutions, which suppose the iteration of a din?  ...  In the last years, researchers have pointed out that there is a possible similarity between chaos and cryptography, many of the properties of chaotic dynamic systems having correlation among the cryptographic  ...  A CA (Cellular Automated) consists of a series of cells, each of which can be in one of a finite number of possible states, updated in a discrete time synchronously, according to a local and identical  ... 
doi:10.24989/ocg.v331.37 fatcat:iglsmmhtwzapzojdocuobg7olm
« Previous Showing results 1 — 15 out of 179 results