Practical Issues in Modern Cryptography and Communications

2021 ◽  
pp. 165-182
Keyword(s):  
Modern Cryptography

scholarly journals Conjugacy Systems Based on Nonabelian Factorization Problems and Their Applications in Cryptography

2014 ◽  
Vol 2014 ◽  
pp. 1-10 ◽  
Author(s):  
Lize Gu ◽  
Shihui Zheng
Keyword(s):  
Performance Analysis ◽  
Quantum Algorithm ◽  
Integer Factorization ◽  
Algebraic Structures ◽  
Cryptographic Primitives ◽  
Factorization Problem ◽  
Integer Factorization Problem ◽  
Modern Cryptography ◽  
Nonabelian Groups

To resist known quantum algorithm attacks, several nonabelian algebraic structures mounted upon the stage of modern cryptography. Recently, Baba et al. proposed an important analogy from the integer factorization problem to the factorization problem over nonabelian groups. In this paper, we propose several conjugated problems related to the factorization problem over nonabelian groups and then present three constructions of cryptographic primitives based on these newly introduced conjugacy systems: encryption, signature, and signcryption. Sample implementations of our proposal as well as the related performance analysis are also presented.

Modern Cryptography

2020 ◽  
pp. 106-122
Author(s):  
Wayne Patterson ◽  
Cynthia E. Winston-Proctor
Keyword(s):  
Modern Cryptography

Computational Aspects of Digital Steganography

2011 ◽  
pp. 193-211
Author(s):  
Maciej Liskiewicz ◽  
Ulrich Wölfel
Keyword(s):  
Computational Complexity ◽  
Computer Science ◽  
Formal Analysis ◽  
Point Of View ◽  
Secret Data ◽  
Secure Systems ◽  
Computational Aspects ◽  
Computational Resources ◽  
Modern Cryptography ◽  
Digital Steganography

This chapter provides an overview, based on current research, on theoretical aspects of digital steganography— a relatively new field of computer science that deals with hiding secret data in unsuspicious cover media. We focus on formal analysis of security of steganographic systems from a computational complexity point of view and provide models of secure systems that make realistic assumptions of limited computational resources of involved parties. This allows us to look at steganographic secrecy based on reasonable complexity assumptions similar to ones commonly accepted in modern cryptography. In this chapter we expand the analyses of stego-systems beyond security aspects, which practitioners find difficult to implement (if not impossible to realize), to the question why such systems are so difficult to implement and what makes these systems different from practically used ones.

Parallel Optimization the AES Algorithm Based on MapReduce

2014 ◽  
Vol 644-650 ◽  
pp. 1911-1914
Author(s):  
Shao Min Zhang ◽  
Yu Fang Gan ◽  
Bao Yi Wang
Keyword(s):  
Big Data ◽  
Traditional Method ◽  
Cloud Storage ◽  
Parallel Optimization ◽  
Mapreduce Framework ◽  
Data Decomposition ◽  
Time Consumption ◽  
Aes Algorithm ◽  
Encryption And Decryption ◽  
Modern Cryptography

Considering the confidentiality and integrity of big data in cloud storage, a MapReduce-based AES parallelization scheme is designed by using MapReduce framework of the open source Hadoop in this paper. The scheme takes full advantage of MapReduce and modern cryptography technologies to parallelize AES encryption and decryption process, in the way of data decomposition, which speeds up the efficiency in the implementation of encryption and decryption. Meanwhile, mix plaintext, separate storage and other technical means are taken into account in this scheme to ensure the confidentiality and security of the key and the ciphertext. By analyzing the performance, it is proved that the time consumption of new scheme is significantly reduced comparing with the traditional method.

Crypto-tutor: An educational tool for learning modern cryptography

2016 ◽  
Author(s):  
Nikola Luburic ◽  
Milan Stojkov ◽  
Goran Savic ◽  
Goran Sladic ◽  
Branko Milosavljevic
Keyword(s):  
Educational Tool ◽  
Modern Cryptography

Chocolate Key Cryptography

2010 ◽  
Vol 104 (2) ◽  
pp. 100-104
Author(s):  
Dale J. Bachman ◽  
Ezra A. Brown ◽  
Anderson H. Norton
Keyword(s):  
Primary Component ◽  
Key Exchange ◽  
Diffie Hellman ◽  
Diffie Hellman Key Exchange ◽  
Modern Cryptography

This colorful illustration of a primary component of modern cryptography—the Diffie-Hellman key exchange—draws students into the secret world of message encoding and decoding.

Sign in / Sign up

Export Citation Format

Share Document