No abstract

Michael O. Rabin Cryptosystem can generate same ciphertext form different plaintext as well as multiple plaintext from single cyphertext. There are a number of techniues to reveal original plaintext. But none of them can seperate same cyphertext against each plaintext generated from modular reduction arithmetic. If question arises about how one can distinguish particular ciphertext against each plaintext, to answer those questions, I design a new mathematical model for identifying same ciphertext against each plaintext and it also facilitates message encryption and decryption. The proposed mathematical model constructiond based on quadratic root of quadratic residue, quadratic quotient, floor function and absolute value counting in order to identify the ciphertext against the plaintext. In particular. When same number of residues generated from multiple plaintext applying modular reduction arithmetic. The proposed crypto intensive technique uses symmetric key using Diffie-Hellman key exchange protocol. The advantage of proposed crypto intensive technique is intended receiver getting only one plainvalue distinguishing the ciphertext against the plaintext. The proposed crypto teachnique requires less time complexity and probabily secure against man-in-the-middle, chosen plaintext and cyphertext attack.

M.S.H. Biswas crypto-intensive techniques in combination of Encryption algorithm, Signature generation algorithm, Signature verification algorithm and Decription algorithm. Michael O. Rabin Signature scheme uses random padding to validate signature. Analogously the proposed techniques uses same padding system including additional quotient and residuum. The only difference is that Rabin signature is pair or triple in some special cases but proposed model uses forefold signature system. Michael O. Rabin Cryptosystem can generate same ciphertext form different plaintext as well as multiple plaintext from single cyphertext. To solve those issues, i designed a new cryptosystem "A mathematical model for ascertaining same ciphertext generated from distinct plaintext in Michael O. Rabin Cryptosystem". But it did not have authentication system to verify sender and valid message because there was no signature generation facility.In this article, i have designed a new signature algorithm in combination with previous techniques and Michael O. Rabin public key Signature scheme. Receiver can decipher secret message from sender's signature. The proposed crypto intensive technique uses two times security key by slightly altering Diffie-Hellman key exchange protocol. The advantage of proposed crypto intensive technique is that the sender generate signature using encrypted text and intended receiver can retrieve plaintext from signature through signature verification system.The proposed crypto teachniques secure against man-inthe-middle attack. It is unforgeable while Rabin's signature is forgeable in forgery attack.

I hereby declare that this research monograph becomes the property of Md. Shamim Hossain Biswas and to be placed at the worldwide database access library for future cryptographic researchers and also be available Online. Md. Shamim Hossain Biswas is the owner of this Monograph and own all copyrights of the Work. IJSRP acts as publishing partner and author will remain owner of the content. Copyright©2020, All Rights Reserved No part of this Monograph may be reproduced, stored in a retrieval system, or transmitted, in any form or by any means, electronic, mechanical, photocopying, recording, scanning or otherwise, except as described below, without the permission in writing of the Author & publisher. Copying of content is not permitted except for personal and internal use, to the extent permitted by national copyright law, or under the terms of a license issued by the national Reproduction Rights Organization.

No abstract