• Honam Mathematical Journal
• /
• v.31 no.4
• /
• pp.639-644
• /
• 2009

In this paper, we begin with to introduce the concepts of IFP and strong IFP in near-rings and then give some characterizations of IFP in near-rings. Next we derive reversible IFP, and then equivalences of the concepts of strong IFP and strong reversibility. Finally, we obtain some conditions to become strong IFP in right permutable near-rings and strongly reversible near-rings.

• East Asian mathematical journal
• /
• v.25 no.4
• /
• pp.441-447
• /
• 2009

Jat and Choudhari defined a near-ring R with left bipotent or right bipotent condition in 1979. Also, we can dene a near-ring R as subcommutative if aR = Ra for all a in R. From these above two concepts it is natural to investigate the near-ring R with the properties aR = $Ra^2$ (resp. $a^2R$ = Ra) for each a in R. We will say that such is a near-ring with (1,2)-potent condition (resp. a near-ring with (2,1)-potent condition). Thus, we can extend a general concept of a near-ring R with (m,n)-potent condition, that is, $a^mR\;=\;Ra^n$ for each a in R, where m, n are positive integers. We will derive properties of near-ring with (1,n) and (n,1)-potent conditions where n is a positive integer, any homomorphic image of (m,n)-potent near-ring is also (m,n)-potent, and we will obtain some characterization of regular near-rings with (m,n)-potent conditions.

• Journal of Information Processing Systems
• /
• v.8 no.4
• /
• pp.567-574
• /
• 2012

This paper presents a strong designated verifiable signcryption scheme, in which a message is signcrypted by a signcryptor and only a specific receiver, who called a "designated verifier", verifies it using his own secret key. The scheme is secure, as an adversary can not verify the signature even if the secret key of the signer is compromised or leaked. The security of the proposed scheme lies in the complexity of solving two computationally hard problems, namely, the Discrete Logarithm Problem (DLP) and the Integer Factorization Problem (IFP). The security analysis of the scheme has been done and it is proved that, the proposed scheme can withstand an adaptive chosen ciphertext attack. This scheme can be very useful in organizations where there is a need to send confidential documents to a specific recipient. This scheme can also be applicable to real life scenarios, such as, e-commerce applications, e-banking and e-voting.

• Convergence Security Journal
• /
• v.22 no.4
• /
• pp.179-188
• /
• 2022

Password authentication schemes (PAS) are the most common mechanisms used to ensure secure communication in open networks. Mathematical-based cryptographic authentication schemes such as factorization and discrete logarithms have been proposed and provided strong security features, but they have the disadvantage of high computational and message transmission costs required to construct passwords. Fairuz et al. therefore argued for an improved cryptographic authentication scheme based on two difficult fixed issues related to session key consent using the smart card scheme. However, in this paper, we have made clear through security analysis that Fairuz et al.'s protocol has security holes for Privileged Insider Attack, Lack of Perfect Forward Secrecy, Lack of User Anonymity, DoS Attack, Off-line Password Guessing Attack.