In this paper we study of the MOR cryptosystem using camina group. We show that using the automorphism of the camina group one can build a secure MOR cryptosystem.
Image Encryption Using Advanced Hill Cipher AlgorithmIDES Editor
The Hill cipher algorithm is one of the symmetric
key algorithms that have several advantages in data
encryption. But, the inverse of the key matrix used for
encrypting the plaintext does not always exist. Then if the
key matrix is not invertible, then encrypted text cannot be
decrypted. In the Involutory matrix generation method the
key matrix used for the encryption is itself invertible. So, at
the time of decryption we need not to find the inverse of the
key matrix. The objective of this paper is to encrypt an
image using a technique different from the conventional Hill
Cipher. In this paper a novel advanced Hill (AdvHill)
encryption technique has been proposed which uses an
involutory key matrix. The scheme is a fast encryption
scheme which overcomes problems of encrypting the images
with homogeneous background. A comparative study of the
proposed encryption scheme and the existing scheme is
made. The output encrypted images reveal that the
proposed technique is quite reliable and robust.
LITTLE DRAGON TWO: AN EFFICIENT MULTIVARIATE PUBLIC KEY CRYPTOSYSTEMIJNSA Journal
In 1998 [8], Patarin proposed an efficient cryptosystem called Little Dragon which was a variant a variant of Matsumoto Imai cryptosystem C*. However Patarin latter found that Little Dragon cryptosystem is not secure [8], [3]. In this paper we propose a cryptosystem Little Dragon Two which is as efficient as Little Dragon cryptosystem but secure against all the known attacks. Like Little Dragon cryptosystem the public key of Little Dragon Two is mixed type that is quadratic in plaintext and cipher text variables. So the public key size of Little Dragon Two is equal to Little Dragon Cryptosystem. Our public key algorithm is bijective and can be used for both encryption and signatures.
Apresentação sobre Criptografia baseada em reticulados (lattices), realizada no contexto da disciplina de Post-Quantum Cryptography do PPGCC da UFSC.
Versão odp: http://coenc.td.utfpr.edu.br/~giron/presentations/aula_lattice.odp
Lattice-Based Cryptography: CRYPTANALYSIS OF COMPACT-LWEPriyanka Aash
Destructive and constructive methods in lattice-based cryptography will be discussed. Topic 1: Cryptanalysis of Compact-LWE Authors: Jonathan Bootle; Mehdi Tibouchi; Keita Xagawa Topic 2: Two-message Key Exchange with Strong Security from Ideal Lattices Authors: Zheng Yang; Yu Chen; Song Luo
(Source: RSA Conference USA 2018)
Image Encryption Using Advanced Hill Cipher AlgorithmIDES Editor
The Hill cipher algorithm is one of the symmetric
key algorithms that have several advantages in data
encryption. But, the inverse of the key matrix used for
encrypting the plaintext does not always exist. Then if the
key matrix is not invertible, then encrypted text cannot be
decrypted. In the Involutory matrix generation method the
key matrix used for the encryption is itself invertible. So, at
the time of decryption we need not to find the inverse of the
key matrix. The objective of this paper is to encrypt an
image using a technique different from the conventional Hill
Cipher. In this paper a novel advanced Hill (AdvHill)
encryption technique has been proposed which uses an
involutory key matrix. The scheme is a fast encryption
scheme which overcomes problems of encrypting the images
with homogeneous background. A comparative study of the
proposed encryption scheme and the existing scheme is
made. The output encrypted images reveal that the
proposed technique is quite reliable and robust.
LITTLE DRAGON TWO: AN EFFICIENT MULTIVARIATE PUBLIC KEY CRYPTOSYSTEMIJNSA Journal
In 1998 [8], Patarin proposed an efficient cryptosystem called Little Dragon which was a variant a variant of Matsumoto Imai cryptosystem C*. However Patarin latter found that Little Dragon cryptosystem is not secure [8], [3]. In this paper we propose a cryptosystem Little Dragon Two which is as efficient as Little Dragon cryptosystem but secure against all the known attacks. Like Little Dragon cryptosystem the public key of Little Dragon Two is mixed type that is quadratic in plaintext and cipher text variables. So the public key size of Little Dragon Two is equal to Little Dragon Cryptosystem. Our public key algorithm is bijective and can be used for both encryption and signatures.
Apresentação sobre Criptografia baseada em reticulados (lattices), realizada no contexto da disciplina de Post-Quantum Cryptography do PPGCC da UFSC.
Versão odp: http://coenc.td.utfpr.edu.br/~giron/presentations/aula_lattice.odp
Lattice-Based Cryptography: CRYPTANALYSIS OF COMPACT-LWEPriyanka Aash
Destructive and constructive methods in lattice-based cryptography will be discussed. Topic 1: Cryptanalysis of Compact-LWE Authors: Jonathan Bootle; Mehdi Tibouchi; Keita Xagawa Topic 2: Two-message Key Exchange with Strong Security from Ideal Lattices Authors: Zheng Yang; Yu Chen; Song Luo
(Source: RSA Conference USA 2018)
This is a presentation I gave as a short overview of LSTMs. The slides are accompanied by two examples which apply LSTMs to Time Series data. Examples were implemented using Keras. See links in slide pack.
This presentation is based on the paper :
"A Method for Obtaining Digital Signatures and Public-Key Cryptosystems" by R.L. Rivest, A. Shamir, and L. Adleman
This report to document the RSA code and how it works from encrypting certain message to how to decrypt it using general and private keys which will be generated in the given code.
LATTICE BASED TOOLS IN CRYPTANALYSIS FOR PUBLIC KEY CRYPTOGRAPHY IJNSA Journal
Lattice reduction is a powerful concept for solving diverse problems involving point lattices. Lattice reduction has been successfully utilizing in Number Theory, Linear algebra and Cryptology. Not only the existence of lattice based cryptosystems of hard in nature, but also has vulnerabilities by lattice reduction techniques. In this survey paper, we are focusing on point lattices and then describing an introduction to
the theoretical and practical aspects of lattice reduction. Finally, we describe the applications of lattice reduction in Number theory, Linear algebra.
The matrix in Hill Cipher was designed to perform encryption and decryption. Every column and row must be inserted by integer numbers. But, not any key that can be given to the matrix used for the process. The wrong determinant result cannot be used in the process because it produces the incorrect plaintext when doing the decryption after the encryption. Genetic algorithms offer the optimized way to determine the key used for encryption and decryption on the Hill Cipher. By determining the evaluation function in the genetic algorithm, the key that fits the composition will be obtained. By implementing this algorithm, the search of the key on the Hill Cipher will be easily done without spending too much time. Genetic algorithms do well if it is combined with Hill Cipher.
SECRYPT 2018 Presentation: 15th International Conference on Security and Cry...Mriganka Mandal
Title of the presentation: Cost-Effective Private Linear Key Agreement With Adaptive CCA Security from Prime Order Multilinear Maps and Tracing Traitors
Authors: Mriganka Mandal and Ratna Dutta
Accepted: SECRYPT 2018
Date and Venue: July 26 - 28, 2018 Porto, Portugal
Analysis and improvement of pairing free certificate-less two-party authentic...ijsptm
The predominant grid authentication mechanisms use public key infrastructure (PKI). Nonetheless,
certificate-less public key cryptography (CL-PKC) has several advantages that seem to well align with the
demands of grid computing. Security and efficiency are the main objectives of grid authentication
protocols. Unfortunately, certificate-less authenticated key agreement protocols rely on the bilinear
pairing, that is extremely computational expensive. In this paper, we analyze the recently secure certificateless
key agreement protocols without pairing. We then propose a novel grid pairing-free certificate-less
two-party authenticated key agreement (GPC-AKA) protocol, providing a more lightweight key
management approach for grid users. We also show, a GPC-AKA security protocol proof using formal
automated security analysis Sycther tool.
Close More Prospects With Edification That WorksKofi Ford
http://kofifordonline.com... Unfortunately, many overlook the power of edification in building their Direct Selling business. What they fail to realize is how beneficial edification is in their efforts in building their organization, duplicating their efforts and driving momentum.
This is a presentation I gave as a short overview of LSTMs. The slides are accompanied by two examples which apply LSTMs to Time Series data. Examples were implemented using Keras. See links in slide pack.
This presentation is based on the paper :
"A Method for Obtaining Digital Signatures and Public-Key Cryptosystems" by R.L. Rivest, A. Shamir, and L. Adleman
This report to document the RSA code and how it works from encrypting certain message to how to decrypt it using general and private keys which will be generated in the given code.
LATTICE BASED TOOLS IN CRYPTANALYSIS FOR PUBLIC KEY CRYPTOGRAPHY IJNSA Journal
Lattice reduction is a powerful concept for solving diverse problems involving point lattices. Lattice reduction has been successfully utilizing in Number Theory, Linear algebra and Cryptology. Not only the existence of lattice based cryptosystems of hard in nature, but also has vulnerabilities by lattice reduction techniques. In this survey paper, we are focusing on point lattices and then describing an introduction to
the theoretical and practical aspects of lattice reduction. Finally, we describe the applications of lattice reduction in Number theory, Linear algebra.
The matrix in Hill Cipher was designed to perform encryption and decryption. Every column and row must be inserted by integer numbers. But, not any key that can be given to the matrix used for the process. The wrong determinant result cannot be used in the process because it produces the incorrect plaintext when doing the decryption after the encryption. Genetic algorithms offer the optimized way to determine the key used for encryption and decryption on the Hill Cipher. By determining the evaluation function in the genetic algorithm, the key that fits the composition will be obtained. By implementing this algorithm, the search of the key on the Hill Cipher will be easily done without spending too much time. Genetic algorithms do well if it is combined with Hill Cipher.
SECRYPT 2018 Presentation: 15th International Conference on Security and Cry...Mriganka Mandal
Title of the presentation: Cost-Effective Private Linear Key Agreement With Adaptive CCA Security from Prime Order Multilinear Maps and Tracing Traitors
Authors: Mriganka Mandal and Ratna Dutta
Accepted: SECRYPT 2018
Date and Venue: July 26 - 28, 2018 Porto, Portugal
Analysis and improvement of pairing free certificate-less two-party authentic...ijsptm
The predominant grid authentication mechanisms use public key infrastructure (PKI). Nonetheless,
certificate-less public key cryptography (CL-PKC) has several advantages that seem to well align with the
demands of grid computing. Security and efficiency are the main objectives of grid authentication
protocols. Unfortunately, certificate-less authenticated key agreement protocols rely on the bilinear
pairing, that is extremely computational expensive. In this paper, we analyze the recently secure certificateless
key agreement protocols without pairing. We then propose a novel grid pairing-free certificate-less
two-party authenticated key agreement (GPC-AKA) protocol, providing a more lightweight key
management approach for grid users. We also show, a GPC-AKA security protocol proof using formal
automated security analysis Sycther tool.
Close More Prospects With Edification That WorksKofi Ford
http://kofifordonline.com... Unfortunately, many overlook the power of edification in building their Direct Selling business. What they fail to realize is how beneficial edification is in their efforts in building their organization, duplicating their efforts and driving momentum.
How to increase website conversions by applying the laws of great product designLindsay Bayuk
In this talk, Lindsay Bayuk from Pure Chat will cover the core concepts for building a great product and how to apply them to your WordPress site. Learn how to optimize your WordPress site and increase conversion with better targeting, positioning, messaging, personas and testing.
Wordcamp Salt Lake City 2015
https://www.purechat.com/
Retired chairman of Belfort Instrument Co., Bruce R. Robinson also oversaw corporate growth for SCIENTECH, Inc., and Utilipoint International, Inc. Bruce R. Robinson also continues as co-owner and Chairman of GAMMA Scientific Inc.
MESSAGE EMBEDDED CIPHER USING 2-D CHAOTIC MAPijccmsjournal
This paper constructs two encryption methods using 2-D chaotic maps, Duffings and Arnold’s cat maps
respectively. Both of the methods are designed using message embedded scheme and are analyzed for their validity, for plaintext sensitivity, key sensitivity, known plaintext and brute-force attacks. Due to the
less key space generally many chaotic cryptosystem developed are found to be weak against Brute force attack which is an essential issue to be solved. For this issue, concept of identifiability proved to be a necessary condition to be fulfilled by the designed chaotic cipher to resist brute force attack, which is a basic attack. As 2-D chaotic maps provide more key space than 1-D maps thus they are considered to be more suitable. This work is accompanied with analysis results obtained from these developed cipher. Moreover, identifiable keys are searched for different input texts at various key values.
The methods are found to have good key sensitivity and possess identifiable keys thus concluding that they can resist linear attacks and brute-force attacks.
Message Embedded Cipher Using 2-D Chaotic Mapijccmsjournal
This paper constructs two encryption methods using 2-D chaotic maps, Duffings and Arnold’s cat maps
respectively. Both of the methods are designed using message embedded scheme and are analyzed for
their validity, for plaintext sensitivity, key sensitivity, known plaintext and brute-force attacks. Due to the
less key space generally many chaotic cryptosystem developed are found to be weak against Brute force
attack which is an essential issue to be solved. For this issue, concept of identifiability proved to be a
necessary condition to be fulfilled by the designed chaotic cipher to resist brute force attack, which is a
basic attack. As 2-D chaotic maps provide more key space than 1-D maps thus they are considered to be
more suitable. This work is accompanied with analysis results obtained from these developed cipher.
Moreover, identifiable keys are searched for different input texts at various key values.
Evaluation of Performance Characteristics of Polynomial based and Lattice bas...IDES Editor
In order to achieve the security for the e-business
application, generally, the organizations follow the
cryptographic methods. The two widely accepted and used
cryptographic methods are symmetric and asymmetric. The
DES ideally belongs to the category of symmetric key
cryptosystem and RSA, NTRU[3] belongs to the category of
asymmetric key cryptosystem. NTRU (Nth degree truncated
polynomial ring units) is a collection of mathematical
algorithms based on manipulating lists of very small integers.
NTRU is the first secure public key cryptosystem not based on
factorization or discrete logarithmic problems. The keys are
generated by having small potent polynomials from the ring
of truncated polynomials. NTRU can also be implemented
using matrices instead of polynomials [4, 5]. We proceed with
the encryption and decryption of the plain text required by
implementing the algorithms of both the approaches of NTRU
cryptosystems. It is already shown that the matrix approach is
algorithmically better than the polynomial approach of NTRU
cryptosystem [5]. We propose and test both the methods for
variable sized text files, using polynomial and matrix
cryptosystems. This paper presents the comparative study of
polynomial NTRU and matrix NTRU algorithms for variable
sized text files as input. The final results were observed using
Mathematica5.1, analyzed and compared so as to identify which
method is appropriate to the business needs.
International Journal of Engineering Research and Applications (IJERA) is an open access online peer reviewed international journal that publishes research and review articles in the fields of Computer Science, Neural Networks, Electrical Engineering, Software Engineering, Information Technology, Mechanical Engineering, Chemical Engineering, Plastic Engineering, Food Technology, Textile Engineering, Nano Technology & science, Power Electronics, Electronics & Communication Engineering, Computational mathematics, Image processing, Civil Engineering, Structural Engineering, Environmental Engineering, VLSI Testing & Low Power VLSI Design etc.
An Efficient Approach for Enhancing the Security of Amazigh Text using Binary...Editor IJCATR
Now a day’s Cryptography is one of the broad areas for researchers. Due to its importance, several cryptography techniques
are adopted by many authors to secure the data, but still there is a scope to improve the previous approaches. The main of our research
is to develop a novel Approach for enhancing the security of Amazigh Text using binary tree. The plaintext considered is the
combination of Unicode characters. This paper contributes in the area of elliptic curve cryptography by encrypting data using matrix
approach and using the concept of tree traversal method for enhancing the security of the encrypted points. The security goals were
enhanced by making it difficult for attacker to predicate a pattern as well as speed of the encryption/decryption scheme. The results
show strength of the algorithm.
PEC - AN ALTERNATE AND MORE EFFICIENT PUBLIC KEY CRYPTOSYSTEMijcisjournal
In an increasingly connected world, security is a top concern for Internet of Things (IoT). These IoT devices have to
be inexpensive implying that they will be constrained in storage and computing resources. In order to secure such
devices, highly efficient public key cryptosystems (PKC) are critical. Elliptic Curve Cryptography (ECC) is the most
commonly implemented PKC in use today. In this paper, an alternate and a more efficient PKC, called the PEC (Pells
Equation Cryptography) has been proposed based on Pells equation: x
2 − D ∗ y
2 ≡ 1 (mod p). It is shown that scalar
multiplication in PEC is significantly more efficient compared to ECC. It is also shown that the Discrete Logarithm
Problem - computing the private key from the public key - in PEC is at least as hard as that of ECC.
CNIT 141 8. Public-Key Cryptosystems Based on the DLPSam Bowne
For a college course -- CNIT 140: "Cryptography for Computer Networks" at City College San Francisco
Instructor: Sam Bowne
More info: https://samsclass.info/141/141_F17.shtml
Based on "Understanding Cryptography: A Textbook for Students and Practitioners" by Christof Paar, Jan Pelzl, and Bart Preneel, ISBN: 3642041000
FAST DETECTION OF DDOS ATTACKS USING NON-ADAPTIVE GROUP TESTINGIJNSA Journal
Network security has become more important role today to personal users and organizations. Denial-of-
Service (DoS) and Distributed Denial-of-Service (DDoS) attacks are serious problem in network. The
major challenges in design of an efficient algorithm in data stream are one-pass over the input, poly-log
space, poly-log update time and poly-log reporting time. In this paper, we use strongly explicit construction
d-disjunct matrices in Non-adaptive group testing (NAGT) to adapt these requirements and propose a
solution for fast detecting DoS and DDoS attacks based on NAGT approach
NeuroCrypto: C++ Implementation of Neural Cryptography with Rijndael CipherSagun Man Singh Shrestha
This work is the software implementation of the concept of neural cryptography, which is a communication of two tree parity machines for agreement on a common key over a public channel. This key is utilized to encrypt a sensitive message to be transmitted over an insecure channel using Rijndael cipher. This is a new potential source for public key cryptography schemes which are not based on number theoretic functions, and have small time and memory complexities. This paper will give a brief introduction to artificial neural networks, cryptography and its types, which will help explain why the two communicating terminals converge to a common key in neural cryptography and will also cover the Rijndael (AES) cipher. This paper is intended to show that such neural key exchange protocol and AES encryption can be practically implemented in a high-level programming language viz. C++, which could be further extended in higher-level applications. Both CLI and GUI implementations of the software created using Visual C++ (.NET framework) are presented.
A NEW DATA ENCODER AND DECODER SCHEME FOR NETWORK ON CHIPEditor IJMTER
System-on-chip (soc) based system has so many disadvantages in power-dissipation as
well as clock rate while the data transfer from one system to another system in on-chip. At the same
time, a higher operated system does not support the lower operated bus network for data transfer.
However an alternative scheme is proposed for high speed data transfer. But this scheme is limited to
SOCs. Unlike soc, network-on-chip (NOC) has so many advantages for data transfer. It has a special
feature to transfer the data in on-chip named as transitional encoder. Its operation is based on input
transitions. At the same time it supports systems which are higher operated frequencies. In this
project, a low-power encoding scheme is proposed. The proposed system yields lower dynamic
power dissipation due to the reduction of switching activity and coupling switching activity when
compared to existing system. Even-though many factors which is based on power dissipation, the
dynamic power dissipation is only considerable for reasonable advantage. The proposed system is
synthesized using quartus II 9.1 software. Besides, the proposed system will be extended up to
interlink PE communication with help of routers and PE’s which are performed by various
operations. To implement this system in real NOC’s contains the proposed encoders and decoders for
data transfer with regular traffic scenarios should be considered.
A RESEARCH - DEVELOP AN EFFICIENT ALGORITHM TO RECOGNIZE, SEPARATE AND COUNT ...Editor IJMTER
Coins are important part of our life. We use coins in a places like stores, banks, buses, trains
etc. So it becomes a basic need that coins can be sorted, counted automatically. For this, there is
necessary that the coins can be recognized automatically. Automated Coin Recognition System for the
Indian Coins of Rs. 1, 2, 5 and 10 with the rotation invariance. We have taken images from the both
sides of coin. So this system is capable to recognizing coins from both sides. Features are taken from the
images using techniques as a Hough Transformation, Pattern Averaging etc.
Analysis of VoIP Traffic in WiMAX EnvironmentEditor IJMTER
Worldwide Interoperability for Microwave Access (WiMAX) is currently one of the
hottest technologies in wireless communication. It is a standard based on the IEEE 802.16 wireless
technology that provides a very high throughput broadband connections over long distances. In
parallel, Voice Over Internet Protocol (VoIP) is a new technology which provides access to voice
communication over internet protocol and hence it is becomes an alternative to public switched
telephone networks (PSTN) due to its capability of transmission of voice as packets over IP
networks. A lot of research has been done in analyzing the performances of VoIP traffic over
WiMAX network. In this paper we review the analysis carried out by several authors for the most
common VoIP codec’s which are G.711, G.723.1 and G.729 over a WiMAX network using various
service classes. The objective is to compare the results for different types of service classes with
respect to the QoS parameters such as throughput, average delay and average jitter.
A Hybrid Cloud Approach for Secure Authorized De-DuplicationEditor IJMTER
The cloud backup is used for the personal storage of the people in terms of reducing the
mainlining process and managing the structure and storage space managing process. The challenging
process is the deduplication process in both the local and global backup de-duplications. In the prior
work they only provide the local storage de-duplication or vice versa global storage de-duplication in
terms of improving the storage capacity and the processing time. In this paper, the proposed system
is called as the ALG- Dedupe. It means the Application aware Local-Global Source De-duplication
proposed system to provide the efficient de-duplication process. It can provide the efficient deduplication process with the low system load, shortened backup window, and increased power
efficiency in the user’s personal storage. In the proposed system the large data is partitioned into
smaller part which is called as chunks of data. Here the data may contain the redundancy it will be
avoided before storing into the storage area.
Aging protocols that could incapacitate the InternetEditor IJMTER
The biggest threat to the Internet is the fact that it was never really designed. For e.g., the
BGP protocol is used by Internet routers to exchange information about changes to the Internet's
network topologies. However, it also is among the most fundamentally broken; as Internet routing
information can be poisoned with bogus routing information. Instead, it evolved in fits and start,
thanks to various protocols that have been cobbled together to fulfill the needs of the moment. Few
of protocols from them were designed with security in mind. or if they were sported no more than
was needed to keep out a nosy neighbor, not a malicious attacker. The result is a welter of aging
protocols susceptible to exploit on an Internet scale. Here are six Internet protocols that could stand
to be replaced sooner rather than later or are (mercifully) on the way out.
A Cloud Computing design with Wireless Sensor Networks For Agricultural Appli...Editor IJMTER
The emergence of exactitude agriculture has been promoted by the numerous developments within
the field of wireless sensing element actor networks (WSAN). These WSANs offer important data
for gathering, work management, development of crops, and limitation of crop diseases. Goals of
this paper to introducing cloud computing as a brand new way (technique) to be utilized in addition
to WSANs to any enhance their application and benefits to the area of agriculture.
A CAR POOLING MODEL WITH CMGV AND CMGNV STOCHASTIC VEHICLE TRAVEL TIMESEditor IJMTER
Carpooling (also car-sharing, ride-sharing, lift-sharing), is the sharing of car journeys so
that more than one person travels in a car. It helps to resolve a variety of problems that continue to
plague urban areas, ranging from energy demands and traffic congestion to environmental pollution.
Most of the existing method used stochastic disturbances arising from variations in vehicle travel
times for carpooling. However it doesn’t deal with the unmet demand with uncertain demand of the
vehicle for car pooling. To deal with this the proposed system uses Chance constrained
formulation/Programming (CCP) approach of the problem with stochastic demand and travel time
parameters, under mild assumptions on the distribution of stochastic parameters; and relates it with a
robust optimization approach. Since real problem sizes can be large, it could be difficult to find
optimal solutions within a reasonable period of time. Therefore solution algorithm using tabu
heuristic solution approach is developed to solve the model. Therefore, we constructed a stochastic
carpooling model that considers the in- fluence of stochastic travel times. The model is formulated as
an integer multiple commodity network flow problem. Since real problem sizes can be large, it could
be difficult to find optimal solutions within a reasonable period of time.
Sustainable Construction With Foam Concrete As A Green Green Building MaterialEditor IJMTER
A green building is an environmentally sustainable building, designed, constructed and
operated to minimise the total environmental impacts. Carbon dioxide (CO2) is the primary
greenhouse gas emitted through human activities. It is claimed that 5% of the world’s carbon dioxide
emission is attributed to cement industry, which is the vital constituent of concrete. Due to the
significant contribution to the environmental pollution, there is a need for finding an optimal solution
along with satisfying the civil construction needs. Apart from normal concrete bricks, a clay brick,
Foam concrete is a new innovative technology for sustainable building and civil construction which
fulfills the criteria of being a Green Material. This paper concludes that Foam Concrete can be an
effective sustainable material for construction and also focuses on the cost effectiveness in using
Foam Concrete as a building material in replacement with Clay Brick or other bricks.
USE OF ICT IN EDUCATION ONLINE COMPUTER BASED TESTEditor IJMTER
A good education system is required for overall prosperity of a nation. A tremendous
growth in the education sector had made the administration of education institutions complex. Any
researches reveal that the integration of ICT helps to reduce the complexity and enhance the overall
administration of education. This study has been undertaken to identify the various functional areas
to which ICT is deployed for information administration in education institutions and to find the
current extent of usage of ICT in all these functional areas pertaining to information administration.
The various factors that contribute to these functional areas were identified. A theoretical model was
derived and validated.
Textual Data Partitioning with Relationship and Discriminative AnalysisEditor IJMTER
Data partitioning methods are used to partition the data values with similarity. Similarity
measures are used to estimate transaction relationships. Hierarchical clustering model produces tree
structured results. Partitioned clustering produces results in grid format. Text documents are
unstructured data values with high dimensional attributes. Document clustering group ups unlabeled text
documents into meaningful clusters. Traditional clustering methods require cluster count (K) for the
document grouping process. Clustering accuracy degrades drastically with reference to the unsuitable
cluster count.
Textual data elements are divided into two types’ discriminative words and nondiscriminative
words. Only discriminative words are useful for grouping documents. The involvement of
nondiscriminative words confuses the clustering process and leads to poor clustering solution in return.
A variation inference algorithm is used to infer the document collection structure and partition of
document words at the same time. Dirichlet Process Mixture (DPM) model is used to partition
documents. DPM clustering model uses both the data likelihood and the clustering property of the
Dirichlet Process (DP). Dirichlet Process Mixture Model for Feature Partition (DPMFP) is used to
discover the latent cluster structure based on the DPM model. DPMFP clustering is performed without
requiring the number of clusters as input.
Document labels are used to estimate the discriminative word identification process. Concept
relationships are analyzed with Ontology support. Semantic weight model is used for the document
similarity analysis. The system improves the scalability with the support of labels and concept relations
for dimensionality reduction process.
Testing of Matrices Multiplication Methods on Different ProcessorsEditor IJMTER
There are many algorithms we found for matrices multiplication. Until now it has been
found that complexity of matrix multiplication is O(n3). Though Further research found that this
complexity can be decreased. This paper focus on the algorithm and its complexity of matrices
multiplication methods.
Malware is a worldwide pandemic. It is designed to damage computer systems without
the knowledge of the owner using the system. Software‟s from reputable vendors also contain
malicious code that affects the system or leaks information‟s to remote servers. Malware‟s includes
computer viruses, spyware, dishonest ad-ware, rootkits, Trojans, dialers etc. Malware detectors are
the primary tools in defense against malware. The quality of such a detector is determined by the
techniques it uses. It is therefore imperative that we study malware detection techniques and
understand their strengths and limitations. This survey examines different types of Malware and
malware detection methods.
SURVEY OF TRUST BASED BLUETOOTH AUTHENTICATION FOR MOBILE DEVICEEditor IJMTER
Practical requirements for securely demonstrating identities between two handheld
devices are an important concern. The adversary can inject a Man-In- The-Middle (MITM) attack to
intrude the protocol. Protocols that employ secret keys require the devices to share private
information in advance, in which it is not feasible in the above scenario. Apart from insecurely
typing passwords into handheld devices or comparing long hexadecimal keys displayed on the
devices’ screen, many other human-verifiable protocols have been proposed in the literature to solve
the problem. Unfortunately, most of these schemes are unsalable to more users. Even when there are
only three entities attempt to agree a session key, these protocols need to be rerun for three times.
So, in the existing method a bipartite and a tripartite authentication protocol is presented using a
temporary confidential channel. Besides, further extend the system into a transitive authentication
protocol that allows multiple handheld devices to establish a conference key securely and efficiently.
But this method detects only the outsider attacks. Method does not consider the insider attacks. So,
in the proposed method trust score based method is introduced which computes the trust values for
the nodes and provide the security. The trust score is computed has a positive influence on the
confidence with which an entity conducts transactions with that node. Network the behavior of the
node will be monitored periodically and its trust value is also updated .So depending on the behavior
of the node in the network trust relation will be established between two nodes.
GLAUCOMA is a chronic eye disease that can damage optic nerve. According to WHO It
is the second leading cause of blindness, and is predicted to affect around 80 million people by 2020.
Development of the disease leads to loss of vision, which occurs increasingly over a long period of
time. As the symptoms only occur when the disease is quite advanced so that glaucoma is called the
silent thief of sight. Glaucoma cannot be cured, but its development can be slowed down by
treatment. Therefore, detecting glaucoma in time is critical. However, many glaucoma patients are
unaware of the disease until it has reached its advanced stage. In this paper, some manual and
automatic methods are discussed to detect glaucoma. Manual analysis of the eye is time consuming
and the accuracy of the parameter measurements also varies with different clinicians. To overcome
these problems with manual analysis, the objective of this survey is to introduce a method to
automatically analyze the ultrasound images of the eye. Automatic analysis of this disease is much
more effective than manual analysis.
Survey: Multipath routing for Wireless Sensor NetworkEditor IJMTER
Reliability is playing very vital role in some application of Wireless Sensor Networks
and multipath routing is one of the ways to increase the probability of reliability. More over energy
consumption is constraint. In this paper, we provide a survey of the state-of-the-art of proposed
multipath routing algorithm for Wireless Sensor Networks. We study the design, analyze the tradeoff
of each design, and overview several presenting algorithms.
Step up DC-DC Impedance source network based PMDC Motor DriveEditor IJMTER
This paper is devoted to the Quasi Z source network based DC Drive. The cascaded
(two-stage) Quasi Z Source network could be derived by the adding of one diode, one inductor,
and two capacitors to the traditional quasi-Z-source inverter The proposed cascaded qZSI inherits all
the advantages of the traditional solution (voltage boost and buck functions in a single stage,
continuous input current, and improved reliability). Moreover, as compared to the conventional qZSI,
the proposed solution reduces the shoot-through duty cycle by over 30% at the same voltage boost
factor. Theoretical analysis of the two-stage qZSI in the shoot-through and non-shoot-through
operating modes is described. The proposed and traditional qZSI-networks are compared. A
prototype of a Quasi Z Source network based DC Drive was built to verify the theoretical
assumptions. The experimental results are presented and analyzed.
SPIRITUAL PERSPECTIVE OF AUROBINDO GHOSH’S PHILOSOPHY IN TODAY’S EDUCATIONEditor IJMTER
The paper reflects the spiritual philosophy of Aurobindo Ghosh which is helpful in today’s
education. In 19th century he wrote about spirituality, in accordance with that it is a core and vital part
of today’s education. It is very much essential for today’s kid. Here I propose the overview of that
philosophy.At the utmost regeneration of those values in today’s generation is the great deal with
education system. To develop the values and spiritual education in the youngers is the great moto of
mine. It is the materialistic world and without value redefinition among them is the harder task but not
difficult.
Software Quality Analysis Using Mutation Testing SchemeEditor IJMTER
The software test coverage is used measure the safety measures. The safety critical analysis is
carried out for the source code designed in Java language. Testing provides a primary means for
assuring software in safety-critical systems. To demonstrate, particularly to a certification authority, that
sufficient testing has been performed, it is necessary to achieve the test coverage levels recommended or
mandated by safety standards and industry guidelines. Mutation testing provides an alternative or
complementary method of measuring test sufficiency, but has not been widely adopted in the safetycritical industry. The system provides an empirical evaluation of the application of mutation testing to
airborne software systems which have already satisfied the coverage requirements for certification.
The system mutation testing to safety-critical software developed using high-integrity subsets of
C and Ada, identify the most effective mutant types and analyze the root causes of failures in test cases.
Mutation testing could be effective where traditional structural coverage analysis and manual peer
review have failed. They also show that several testing issues have origins beyond the test activity and
this suggests improvements to the requirements definition and coding process. The system also
examines the relationship between program characteristics and mutation survival and considers how
program size can provide a means for targeting test areas most likely to have dormant faults. Industry
feedback is also provided, particularly on how mutation testing can be integrated into a typical
verification life cycle of airborne software. The system also covers the safety and criticality levels of
Java source code.
Software Defect Prediction Using Local and Global AnalysisEditor IJMTER
The software defect factors are used to measure the quality of the software. The software
effort estimation is used to measure the effort required for the software development process. The defect
factor makes an impact on the software development effort. Software development and cost factors are
also decided with reference to the defect and effort factors. The software defects are predicted with
reference to the module information. Module link information are used in the effort estimation process.
Data mining techniques are used in the software analysis process. Clustering techniques are used
in the property grouping process. Rule mining methods are used to learn rules from clustered data
values. The “WHERE” clustering scheme and “WHICH” rule mining scheme are used in the defect
prediction and effort estimation process. The system uses the module information for the defect
prediction and effort estimation process.
The proposed system is designed to improve the defect prediction and effort estimation process.
The Single Objective Genetic Algorithm (SOGA) is used in the clustering process. The rule learning
operations are carried out sing the Apriori algorithm. The system improves the cluster accuracy levels.
The defect prediction and effort estimation accuracy is also improved by the system. The system is
developed using the Java language and Oracle relation database environment.
Software Cost Estimation Using Clustering and Ranking SchemeEditor IJMTER
Software cost estimation is an important task in the software design and development process.
Planning and budgeting tasks are carried out with reference to the software cost values. A variety of
software properties are used in the cost estimation process. Hardware, products, technology and
methodology factors are used in the cost estimation process. The software cost estimation quality is
measured with reference to the accuracy levels.
Software cost estimation is carried out using three types of techniques. They are regression based
model, anology based model and machine learning model. Each model has a set of technique for the
software cost estimation process. 11 cost estimation techniques fewer than 3 different categories are
used in the system. The Attribute Relational File Format (ARFF) is used maintain the software product
property values. The ARFF file is used as the main input for the system.
The proposed system is designed to perform the clustering and ranking of software cost
estimation methods. Non overlapped clustering technique is enhanced with optimal centroid estimation
mechanism. The system improves the clustering and ranking process accuracy. The system produces
efficient ranking results on software cost estimation methods.
Welcome to WIPAC Monthly the magazine brought to you by the LinkedIn Group Water Industry Process Automation & Control.
In this month's edition, along with this month's industry news to celebrate the 13 years since the group was created we have articles including
A case study of the used of Advanced Process Control at the Wastewater Treatment works at Lleida in Spain
A look back on an article on smart wastewater networks in order to see how the industry has measured up in the interim around the adoption of Digital Transformation in the Water Industry.
About
Indigenized remote control interface card suitable for MAFI system CCR equipment. Compatible for IDM8000 CCR. Backplane mounted serial and TCP/Ethernet communication module for CCR remote access. IDM 8000 CCR remote control on serial and TCP protocol.
• Remote control: Parallel or serial interface.
• Compatible with MAFI CCR system.
• Compatible with IDM8000 CCR.
• Compatible with Backplane mount serial communication.
• Compatible with commercial and Defence aviation CCR system.
• Remote control system for accessing CCR and allied system over serial or TCP.
• Indigenized local Support/presence in India.
• Easy in configuration using DIP switches.
Technical Specifications
Indigenized remote control interface card suitable for MAFI system CCR equipment. Compatible for IDM8000 CCR. Backplane mounted serial and TCP/Ethernet communication module for CCR remote access. IDM 8000 CCR remote control on serial and TCP protocol.
Key Features
Indigenized remote control interface card suitable for MAFI system CCR equipment. Compatible for IDM8000 CCR. Backplane mounted serial and TCP/Ethernet communication module for CCR remote access. IDM 8000 CCR remote control on serial and TCP protocol.
• Remote control: Parallel or serial interface
• Compatible with MAFI CCR system
• Copatiable with IDM8000 CCR
• Compatible with Backplane mount serial communication.
• Compatible with commercial and Defence aviation CCR system.
• Remote control system for accessing CCR and allied system over serial or TCP.
• Indigenized local Support/presence in India.
Application
• Remote control: Parallel or serial interface.
• Compatible with MAFI CCR system.
• Compatible with IDM8000 CCR.
• Compatible with Backplane mount serial communication.
• Compatible with commercial and Defence aviation CCR system.
• Remote control system for accessing CCR and allied system over serial or TCP.
• Indigenized local Support/presence in India.
• Easy in configuration using DIP switches.
Industrial Training at Shahjalal Fertilizer Company Limited (SFCL)MdTanvirMahtab2
This presentation is about the working procedure of Shahjalal Fertilizer Company Limited (SFCL). A Govt. owned Company of Bangladesh Chemical Industries Corporation under Ministry of Industries.
Hybrid optimization of pumped hydro system and solar- Engr. Abdul-Azeez.pdffxintegritypublishin
Advancements in technology unveil a myriad of electrical and electronic breakthroughs geared towards efficiently harnessing limited resources to meet human energy demands. The optimization of hybrid solar PV panels and pumped hydro energy supply systems plays a pivotal role in utilizing natural resources effectively. This initiative not only benefits humanity but also fosters environmental sustainability. The study investigated the design optimization of these hybrid systems, focusing on understanding solar radiation patterns, identifying geographical influences on solar radiation, formulating a mathematical model for system optimization, and determining the optimal configuration of PV panels and pumped hydro storage. Through a comparative analysis approach and eight weeks of data collection, the study addressed key research questions related to solar radiation patterns and optimal system design. The findings highlighted regions with heightened solar radiation levels, showcasing substantial potential for power generation and emphasizing the system's efficiency. Optimizing system design significantly boosted power generation, promoted renewable energy utilization, and enhanced energy storage capacity. The study underscored the benefits of optimizing hybrid solar PV panels and pumped hydro energy supply systems for sustainable energy usage. Optimizing the design of solar PV panels and pumped hydro energy supply systems as examined across diverse climatic conditions in a developing country, not only enhances power generation but also improves the integration of renewable energy sources and boosts energy storage capacities, particularly beneficial for less economically prosperous regions. Additionally, the study provides valuable insights for advancing energy research in economically viable areas. Recommendations included conducting site-specific assessments, utilizing advanced modeling tools, implementing regular maintenance protocols, and enhancing communication among system components.
Immunizing Image Classifiers Against Localized Adversary Attacksgerogepatton
This paper addresses the vulnerability of deep learning models, particularly convolutional neural networks
(CNN)s, to adversarial attacks and presents a proactive training technique designed to counter them. We
introduce a novel volumization algorithm, which transforms 2D images into 3D volumetric representations.
When combined with 3D convolution and deep curriculum learning optimization (CLO), itsignificantly improves
the immunity of models against localized universal attacks by up to 40%. We evaluate our proposed approach
using contemporary CNN architectures and the modified Canadian Institute for Advanced Research (CIFAR-10
and CIFAR-100) and ImageNet Large Scale Visual Recognition Challenge (ILSVRC12) datasets, showcasing
accuracy improvements over previous techniques. The results indicate that the combination of the volumetric
input and curriculum learning holds significant promise for mitigating adversarial attacks without necessitating
adversary training.
Hierarchical Digital Twin of a Naval Power SystemKerry Sado
A hierarchical digital twin of a Naval DC power system has been developed and experimentally verified. Similar to other state-of-the-art digital twins, this technology creates a digital replica of the physical system executed in real-time or faster, which can modify hardware controls. However, its advantage stems from distributing computational efforts by utilizing a hierarchical structure composed of lower-level digital twin blocks and a higher-level system digital twin. Each digital twin block is associated with a physical subsystem of the hardware and communicates with a singular system digital twin, which creates a system-level response. By extracting information from each level of the hierarchy, power system controls of the hardware were reconfigured autonomously. This hierarchical digital twin development offers several advantages over other digital twins, particularly in the field of naval power systems. The hierarchical structure allows for greater computational efficiency and scalability while the ability to autonomously reconfigure hardware controls offers increased flexibility and responsiveness. The hierarchical decomposition and models utilized were well aligned with the physical twin, as indicated by the maximum deviations between the developed digital twin hierarchy and the hardware.
1. Scientific Journal Impact Factor (SJIF): 1.711
International Journal of Modern Trends in Engineering
and Research
www.ijmter.com
@IJMTER-2014, All rights Reserved 144
e-ISSN: 2349-9745
p-ISSN: 2393-8161
CAMINA GROUP FOR THE MOR CRYPTOSYSTEM
Akshaykumar Meshram1
, Dr. N.W.Khobragade2
Ph.D Scholar1
, Professor2
1, 2
Department of Mathematics, R.T.M. Nagpur University, Nagpur (M.S.), India
Abstract— In this paper we study of the MOR cryptosystem using camina group. We show
that using the automorphism of the camina group one can build a secure MOR cryptosystem.
Keywords- MOR cryptosystem, Camina group, Discrete Logarithm Problem, Diffie- Hellman
problem, ElGamal cryptosystem.
I. INTRODUCTION
The digital system has brought revolutionary changes in every walk of life. The data storage,
its processing and the outcome are the major stages in it. Naturally security of the same is a
quite concern in this matter.
Cryptography, which basically writing codes and solving codes, has worked out justifiable
solution to the problem of security of the digital data.
A Principal Goal of (Public Key) Cryptography is to allow two people to exchange confidential
information, even if they have never met and can communicate only viaa channel that is being
monitored by an adversary.
There are three cryptosystems widely in use today:
1) RSA(Ron Rivest, Adi Shamir and Leonard Adleman).
2) The El-Gamal or the Diffie-Hellman key exchange protocol over the multiplication group
of a finite field.
3) The El-Gamal or the Diffie -Hellman key exchange protocol over the group of points on an
Elliptic curve over a finite field.
The security type of the 1st
and 2nd
is the same. The best known attack against them, the index
calculus method, is sub-exponential in nature. On the other hand, the best known attack against
3rd
is exponential in nature. Today, some cryptographers try to build public key cryptosystems
based on non-abelian groups with the security expected at least as secure as Elliptic curve
cryptosystems.
Discrete Logarithm Problem (DLP) is the famous problem in cryptography. It is the complexity
of DLP, which is the base of most commonly, used cryptosystem like the ElGamal
cryptosystems over finite field or Elliptic curve cryptosystems. The algebraic groups used in
such cryptosystems are abelian (commutative). There are many ones based on DLP other than
ElGamal and Elliptic cryptosystems. Among them, we studied the MOR cryptosystem over the
automorphism group Aut(G) of a non-abelian group G.
2. International Journal of Modern Trends in Engineering and Research (IJMTER)
Volume 01, Issue 05, [November - 2014] e-ISSN: 2349-9745, p-ISSN: 2393-8161
@IJMTER-2014, All rights Reserved 145
II. PRELIMINARIES
Most of the definition used in these papers is standard.
2.1 Discrete Logarithm Problem {DLP}:
The (discrete) exponentiation problem is as follows: Given a base a, an exponent b and a
modulus p, calculate c such that ab
≡ c (mod p) and 0 ≤ c < p.
It turns out that this problem is fairly easy and can be calculated "quickly" using fast-
exponentiation.
The discrete log problem is the inverse problem:
Given a base a, a result c (0 ≤ c < p) and a modulus p, calculate the exponent b such that
ab
≡ c (mod p).
It turns out that no one has found a quick way to solve this problem. To get an intuition as to
why this is the case, try picking different values of a and p, and listing out each successive
power of a mod p. What you will find is that there is no discernable pattern for the list of
numbers created. Thus, given a number on the list, it's very difficult to predict where it appears
on the list.
2.2 ElGamal Cryptosystem:
Let q be a prime such that the discrete logarithm problem in (Zq,) is infeasible and let Zq be
a primitive element. Let P=Zq, C=Zq×Zq, and define
K={(q, , XB, YB): YB= BX
mod q}.
The values q, and YB are the public key and XB is the private key.
For K= (q,, XB, YB), and for a (secret) random number kZq-1, define
ek(x, k)=(C1, C2)
Where
C1=k
mod q
C2= x k
BY mod q
For C1 and C2Zq , define
k
(C1, C2)=C2
1
1( )BX
C
mod q
2.2 Camina Group:
A group G is called a Camina group if
≠ , and for each ∈ ′
the following
equation holds:
3. International Journal of Modern Trends in Engineering and Research (IJMTER)
Volume 01, Issue 05, [November - 2014] e-ISSN: 2349-9745, p-ISSN: 2393-8161
@IJMTER-2014, All rights Reserved 146
= { },
where = {
∈ } is the conjugacy class of x in G and x{G’} denotes the
set { / ′
∈ ′
}.
It is well know that,
1) In Camina group the equality
= { ′
}
2) In an arbitrary group ⊆ { ′} for each .
III. THE MOR CRYPTOSYSTEM
In this section we discuss the MOR cryptosystem. The concept of the MOR cryptosystem was
first proposed in Crypto2001 by Paeng et al[2].There are two different security concepts used
in [2].
a) The discrete logarithm problem in the group of inner automorphisms.
b) Membership problem in a finite cyclic group.
The MOR cryptosystem is a generalization of ElGamal cryptosystem, where the discrete
logarithm problem works in the automorphism group of a group G, instead of the group G
itself.
Later in same year, Paeng et al [3], they generalized the MOR cryptosystem and study this
new system for non abelian group.
In 2003, Seong-Hun Paeng [4] shows that there are subexponential time algorithms to solve
the DLP in inner automorphism groups for some non-abelian groups.
3.1 Description of the MOR cryptosystem:
Alice’s keys are as follows:
Public Key: ∅ and ∅ , ∈ ℕ.
Private Key: m.
Encryption
a) To send a message ∈ Bob computes ∅ and ∅ for a random ∈ ℕ.
b) The ciphertext is (∅ , ∅ (a)).
Decryption
Alice knows m, so if she receives the ciphertext (∅ , ∅ (a)), she computes ∅ from ∅ and
then ∅ and then from ∅ (a) computes ‘a’.
Alice can compute ∅ in two ways,
a) If she has the information necessary to find out the order of the automorphism ∅ then she
can use the identity ∅ = ∅ whenever ∅ = 1.
b) She can find out the order of some subgroup in which ∅ belongs and use the same identity.
4. International Journal of Modern Trends in Engineering and Research (IJMTER)
Volume 01, Issue 05, [November - 2014] e-ISSN: 2349-9745, p-ISSN: 2393-8161
@IJMTER-2014, All rights Reserved 147
IV. The MOR cryptosystem using Camina group
Camina groups were introduced by A.R.Camina in [5]. The standard definition of camina group
mention above and this group had been extensively studied R. Dark, C.M. Scoppola in [6].
Aayn Mahalanobis elaborately explained that the currently group for the MOR cryptosystem
[2] is 2, × .The automorphisms proposed is inner autotomorphism. It is shown in [4]
that the DLP in the group of inner autotomorphism of 2, × in the same as the DLP
in 2, . So here we consider map ∅: → be an automorphism of camina group and the
map ∅:
∅( )
→
∅( )
.
Theorem: A finite non abelian group G is a Camina group if and only if G is a Camina p-group
of nilpotance class.
In 2010, Marcel Herzog [7], shows that if G is non abelian polycyclic by finite camina group,
then is finite and if G is non abelian locally finite camina group, then the of the following
hold
a) is a p-group, for suitable prime p.
b) is a nilpotent group, and either is p-group or is a localy cyclic group.
Also if G is non-abelian camina group, then if
( )
is finite then G is finite and if
( )
is a
locally finite p-group, then G is a locally finite p-group.
In 2007 Aayn Mahalanobis[8], show that MOR cryptosystem over finite p-group is only as
secure as the ELGamal have cryptosystem over finite field.
On using automorphism of camina group, we can make secure MOR cryptosystem as this
group can reduce into p-group and using fact that,
If G is a camina group,
∈ ′ and ∈ ′
then = for some ∈ .
′
= ( ) ′
= ( ) ′
= ( [ , ]) ′
= ′
and from | | = ℎ ≡ 1( )
Since,
, ∈ ′ implies < >=< > for some ∈ and = ( ) for some integer n.
Using above fact one can build secure MOR cryptosystem using camina group as it can be
reduce to p-group and it is depending upon the value of ∈ ′
which is very difficult to break
such cryptosystem.
V. Conclusion
The objective of this paper is to study camina group for the MOR cryptosystem. It is prove that
by using camina group one can build secure MOR cryptosystem. The security of any proposed
cryptosystem matter of challenge and more work need to be done for security of the given
system.
5. International Journal of Modern Trends in Engineering and Research (IJMTER)
Volume 01, Issue 05, [November - 2014] e-ISSN: 2349-9745, p-ISSN: 2393-8161
@IJMTER-2014, All rights Reserved 148
Acknowledgements
The authors would like to thank anonymous reviewers of International Journal of Modern
Trends in Engineering and Research for their careful and helpful comments.
Reference
[1] Jeffrey Hoffstein, Jill Pipher, and Joseph H. Silverman, An introduction to mathematical
cryptography, Springer, 2008.
[2] S.-H. Paeng, K.-C. Ha, J. Kim, S. Chee, C. Park, New public key cryptosystem using finite non
abelian groups, in: Advances in Cryptology-Crypto, 2001, pp. 470–485.
[3] S.-H. Paeng, D. Kwon, K.-C. Ha, J. Kim, Improved public key cryptosystem using finite non
abelian groups, IACR ePrint 2001/066.
[4] Seong-Hun Paeng ,On the security of cryptosystem using automorphism groups, Information
Processing Letters 88 (2003) 293–298
[5] A.R. Camina, Some conditions which almost characterize Frobenius groups, Israel J. Math 31
(1978), 153–160.
[6] R. Dark, C.M. Scoppola, On Camina groups of prime power order, J. Algebra 181 (1996), 787–
802.
[7] Marcel Herzog, on infinite Camina groups, Tel-aviv university 2010
[8] Aayn Mahalanobis, A note on using finite non-abelian p-groups in the MOR cryptosystem ,
arXiv:cs/0702095v1[cs:CR] 16 Feb 2007.