Filters








15 Hits in 5.4 sec

The Round Functions of Cryptosystem PGM Generate the Symmetric Group

A. Caranti, F. Dalla. Volta
2006 Designs, Codes and Cryptography  
of G induced by the exact-transversal logarithmic signatures (also known as transversal group bases), generate the full symmetric group on G.  ...  In this paper we show that if G is a nontrivial finite group which is not cyclic of order a prime, or the square of a prime, then the round (or encryption) functions of these systems, that are the permutations  ...  These cryptosystems are based on certain round (or encryption) functions, the PGM transformations, which are the permutations on the set { 1, 2, . . . , |G| }, where G is a finite group, induced by exact-transversal  ... 
doi:10.1007/s10623-005-5667-z fatcat:tgdh4dcecnfhdfkcmxynwndnmm

Group theory in cryptography [article]

Simon R. Blackburn, Carlos Cid, Ciaran Mullan
2010 arXiv   pre-print
The paper gives a brief overview of the subject, and provides pointers to good textbooks, key research papers and recent survey papers in the area.  ...  This paper is a guide for the pure mathematician who would like to know more about cryptography based on group theory.  ...  Acknowledgements The third author was supported by E.P.S.R.C. PhD studentship EP/P504309/1.  ... 
arXiv:0906.5545v2 fatcat:hos33mtpa5fshh2rd6nkoyj4tq

A Symmetrical key Cryptography Analysis using Blowfish Algorithm

Priya Thakur, Anurag Rana
2016 International Journal of Engineering Research and  
This paper is about encryption and decryption of image using a symmetric key called as 64 bit blowfish is designed in the MATLAB software.  ...  Due to the growth of multimedia applications, the need of information security has been become a necessity in this modern technology.  ...  Key expansion generally used for generating initial contents of one array and data encryption uses a 16 round Feistal network [10] . All operations are XORs and additions on 32-bit words.  ... 
doi:10.17577/ijertv5is070276 fatcat:7252ggbannflrcib6sboefmshe

Quantum algorithms for typical hard problems: a perspective of cryptanalysis

Jingwen Suo, Licheng Wang, Sijia Yang, Wenjie Zheng, Jiankang Zhang
2020 Quantum Information Processing  
In typical well-known cryptosystem, the hardness of classical problems plays a fundamental role in ensuring its security.  ...  It illustrated the reason why some cryptosystems such as RSA and ECC are not resistant to quantum attacks, yet some of them like lattice cryptosystems remain intact facing quantum attacks.  ...  To view a copy of this licence, visit http://creativecommons.org/licenses/by/4.0/.  ... 
doi:10.1007/s11128-020-02673-x fatcat:xwzsxob33baftd27y555sihd5a

Digital Video Encryption Algorithms Based on Correlation-Preserving Permutations

Daniel Socek, Spyros Magliveras, Dubravko Ćulibrk, Oge Marques, Hari Kalva, Borko Furht
2007 EURASIP Journal on Information Security  
Experimental results are generated for a number of standard benchmark sequences showing that the proposed method, in addition to providing confidentiality, preserves or improves the compression ratio.  ...  The model relies on the encryption-compression duality of certain types of permutations acting on video frames.  ...  For instance, cryptosystem PGM (permutation group mapping) is based on logarithmic signatures of finite permutation groups [24] . Permutations are extensively used in analog video encryption.  ... 
doi:10.1155/2007/52965 fatcat:q3fongfflfedrh552nb3knbhue

Digital Video Encryption Algorithms Based on Correlation-Preserving Permutations

Daniel Socek, Spyros Magliveras, Dubravko Ćulibrk, Oge Marques, Hari Kalva, Borko Furht
2007 EURASIP Journal on Information Security  
Experimental results are generated for a number of standard benchmark sequences showing that the proposed method, in addition to providing confidentiality, preserves or improves the compression ratio.  ...  The model relies on the encryption-compression duality of certain types of permutations acting on video frames.  ...  For instance, cryptosystem PGM (permutation group mapping) is based on logarithmic signatures of finite permutation groups [24] . Permutations are extensively used in analog video encryption.  ... 
doi:10.1186/1687-417x-2007-052965 fatcat:ryyujcqpizd7faz6h64kb42rbu

Quantum algorithms for algebraic problems

Andrew M. Childs, Wim van Dam
2010 Reviews of Modern Physics  
the formidable task of building a large-scale quantum computer.  ...  Understanding what other computational problems can be solved significantly faster using quantum algorithms is one of the major challenges in the theory of quantum computation, and such algorithms motivate  ...  Acknowledgments We thank Sean Hallgren for discussions of algorithms for number fields.  ... 
doi:10.1103/revmodphys.82.1 fatcat:z6xqtmdvdffrdnyo26wsjp4vee

Privacy Preserving Face Recognition in Cloud Robotics: A Comparative Study

Chiranjeevi Karri, Omar Cheikhrouhou, Ahmed Harbaoui, Atef Zaguia, Habib Hamam
2021 Applied Sciences  
However, the transmission of data to the cloud servers exposes the data to security and privacy attacks. Therefore, encryption algorithms need to be set up.  ...  Real-time robotic applications encounter the robot on board resources' limitations. The speed of robot face recognition can be improved by incorporating cloud technology.  ...  Conflicts of Interest: The authors declare no conflict of interest.  ... 
doi:10.3390/app11146522 fatcat:k5iymfbg7nhyljtyoiry5yrjhq

Group theory in cryptography [chapter]

Simon R. Blackburn, Carlos Cid, Ciaran Mullan, C. M. Campbell, M. R. Quick, E. F. Robertson, C. M. Roney-Dougal, G. C. Smith, G. Traustason
Groups St Andrews 2009 in Bath  
The paper gives a brief overview of the subject, and provides pointers to good textbooks, key research papers and recent survey papers in the area.  ...  This paper is a guide for the pure mathematician who would like to know more about cryptography based on group theory.  ...  round functions.  ... 
doi:10.1017/cbo9780511842467.008 fatcat:kvpvtftl3nfyfozz6zgovrr53e

Quantum computing, phase estimation and applications [article]

Miroslav Dobšíček
2008 arXiv   pre-print
An iterative scheme for quantum phase estimation (IPEA) is derived from the Kitaev phase estimation, a study of robustness of the IPEA utilized as a few-qubit testbed application is performed, and an improved  ...  In this thesis, attention is paid to small experimental testbed applications with respect to the quantum phase estimation algorithm, the core approach for finding energy eigenvalues.  ...  groups (including the symmetric group [59, 60] ) require measurement across multiple copies of ρ H .  ... 
arXiv:0803.0909v1 fatcat:4wq5en5uk5hctablzj4hlwcrza

Simulation on quantum authentication

M. Dobšíček
2007 Physics of Particles and Nuclei Letters  
Recently, the field of unconventional computing has witnessed a huge research effort to solve the problem of the assumed power of computers operating purely according to the laws of quantum physics.  ...  Alternatively, quantum computing can be viewed as generalized probabilistic computing, where non-negative real probabilities are replaced with complex amplitudes.  ...  groups (including the symmetric group [59, 60] ) require measurement across multiple copies of ρ H .  ... 
doi:10.1134/s1547477107020148 fatcat:7okjg34l3jck3fvrpiay336mfy

Privacy, Discovery, and Authentication for the Internet of Things [article]

David J. Wu and Ankur Taly and Asim Shankar and Dan Boneh
2017 arXiv   pre-print
Automatic service discovery is essential to realizing the full potential of the Internet of Things (IoT).  ...  Our protocols provide private and authentic service advertisements, zero round-trip (0-RTT) mutual authentication, and are provably secure in the Canetti-Krawczyk key-exchange model.  ...  Opinions, findings and conclusions or recommendations expressed in this material are those of the authors and do not necessarily reflect the views of DARPA.  ... 
arXiv:1604.06959v3 fatcat:45marxb3xzekflyu35yx2b3uay

8th Conference on the Theory of Quantum Computation, Communication and Cryptography LIPIcs-Leibniz International Proceedings in Informatics

Simone Severini, Fernando Brandao, Simone Severini, Fernando Brandao, Reinhard Wilhelm
2013 ACM Classification 1998 E.3 Data Encryption, E.4 Coding and Information Theory, F. Theory of Computation   unpublished
The 8th Conference on the Theory of Quantum Computation, Communication and Cryptography was held at the University of Guelph, from the 21st to the 23rd May 2013.  ...  The TQC conference series focuses on theoretical aspects of these subfields.  ...  We would like to thank Jonas Anderson for useful discussions regarding the generalized hashing bound.  ... 
fatcat:dkr5qsnonjhwzl24nshxolze3q

The First Workshop on Information Hiding Techniques for Internet Anonymity and Privacy

Massimo Villari
INTERNET 2012 The Fourth International Conference on Evolving Internet IHTIAP 2012   unpublished
increasing the confidence of watermark detection, will also be embedded.  ...  In the detection phase, after SIFT, the template is first determined locally by adjusting the related affine parameters of the grid to match with the possible hidden template signal so that the watermark  ...  These PRNGs are everywhere in any secure Internet communication: in the keys generation of any asymmetric cryptosystem, in the production of any keystream (symmetric cryptosystem), the generation of nonce  ... 
fatcat:qde6lpe4engxxbzy7jry4w6iw4

9th Conference on the Theory of Quantum Computation, Communication and Cryptography

Steven Flammia, Aram Harrow
2014 unpublished
The 9th Conference on the Theory of Quantum Computation, Communication and Cryptography was held at the National University of Singapore, from the 21st to the 23rd May 2014.  ...  The TQC conference series focuses on theoretical aspects of these subfields.  ...  We introduce a natural generalization of the graph coloring game: the graph homomorphism game.  ... 
fatcat:xhlblcfn4zc3rinfgan4hfls7u