• 호남수학학술지
• /
• 제31권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
• /
• 제25권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
• /
• 제8권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.

• 융합보안논문지
• /
• 제22권4호
• /
• pp.179-188
• /
• 2022

패스워드 인증 체계 (PAS)는 개방형 네트워크에서 안전한 통신을 보장하는데 사용되는 가장 일반적인 메커니즘이다. 인수분해와 이산 로그 등의 수학적 기반의 암호 인증 체계가 제안되고 강력한 보안 기능을 제공하였으나, 암호를 구성하는데 필요한 계산 및 메시지 전송 비용이 높다는 단점을 가지고 있었다. Fairuz et al.은 스마트 카드 체계를 이용한 세션 키 동의와 관련하여 인수분해 및 이산 로그 문제를 기반으로 한 개선된 암호 인증 프로토콜을 제안했다. 하지만 본 논문에서는 취약성 분석을 통하여, Fairuz et al.의 프로토콜이 Privileged Insider Attack, Lack of Perfect Forward Secrecy, Lack of User Anonymity, DoS Attack, Off-line Password Guessing Attack에 관한 보안 취약점을 가지고 있다는 것을 확인하였다.