Enhanced Multistage RSA Encryption Model
IOP Conference Series: Materials Science and Engineering, ISSN: 1757-899X, Vol: 928, Issue: 3
2020
- 4Citations
- 12Captures
Metric Options: CountsSelecting the 1-year or 3-year option will change the metrics count to percentiles, illustrating how an article or review compares to other articles or reviews within the selected time period in the same journal. Selecting the 1-year option compares the metrics against other articles/reviews that were also published in the same calendar year. Selecting the 3-year option compares the metrics against other articles/reviews that were also published in the same calendar year plus the two years prior.
Example: if you select the 1-year option for an article published in 2019 and a metric category shows 90%, that means that the article or review is performing better than 90% of the other articles/reviews published in that journal in 2019. If you select the 3-year option for the same article published in 2019 and the metric category shows 90%, that means that the article or review is performing better than 90% of the other articles/reviews published in that journal in 2019, 2018 and 2017.
Citation Benchmarking is provided by Scopus and SciVal and is different from the metrics context provided by PlumX Metrics.
Example: if you select the 1-year option for an article published in 2019 and a metric category shows 90%, that means that the article or review is performing better than 90% of the other articles/reviews published in that journal in 2019. If you select the 3-year option for the same article published in 2019 and the metric category shows 90%, that means that the article or review is performing better than 90% of the other articles/reviews published in that journal in 2019, 2018 and 2017.
Citation Benchmarking is provided by Scopus and SciVal and is different from the metrics context provided by PlumX Metrics.
Conference Paper Description
Digital data amounts are expanding quickly every day over the Internet. Security plays an essential role in the advancement of communication system, particularly with confidential material transmitted over a network because of the continuous availability of digital data and effective attackers try to access these data cryptography becomes one of the most major fields used, an essential and necessary field for achieving a high level of protection between distinct individuals. Efficient and new editions of cryptography algorithms can help decrease security risks, any type of data has its own confidentiality, so new algorithms should be used to protect confidential data toward unauthorized access. After reviewing the RSA and attacking it, it would appear that a new model should be improved to mitigate this attacks and improve the security of the RSA algorithm. In this research increasing the complexity and search space of RSA algorithm against brute force attack in addition to security enhancement was satisfied by applying four cases with using different cryptography algorithms. This four cases included case1: enhanced the security of RSA by using Optimal Asymmetric Encryption Padding (OAEP), case2: combining of the two most important algorithms RSA and Diffie-Hellman (D-H), case3: for increasing complexity and obtaining high level of security the two above cases (case1 & case2)were concatenated, finally for most complexity and obtained highest security level with increasing search space of RSA case4 was applied. Case4: contained implementation of case3 in addition to apply new level of security by adding another cryptography algorithm called HiSea algorithm. The results of using multiple cryptography algorithm in each case of the above four cases respectively improved security level by increased the complexity and key search space that lead to protect the security goals against the attackers. Case4 is the best case because it provides most efficient complex and accurate encryption system that used the processing of encryption data multiple times using different strong algorithms.
Bibliographic Details
http://www.scopus.com/inward/record.url?partnerID=HzOxMe3b&scp=85097165199&origin=inward; http://dx.doi.org/10.1088/1757-899x/928/3/032068; https://iopscience.iop.org/article/10.1088/1757-899X/928/3/032068; https://iopscience.iop.org/article/10.1088/1757-899X/928/3/032068/pdf; https://dx.doi.org/10.1088/1757-899x/928/3/032068; https://validate.perfdrive.com/9730847aceed30627ebd520e46ee70b2/?ssa=d8c4169b-8e10-4c6d-b41c-c6cca9a41eb3&ssb=13514277121&ssc=https%3A%2F%2Fiopscience.iop.org%2Farticle%2F10.1088%2F1757-899X%2F928%2F3%2F032068&ssi=67d956a2-cnvj-429f-9065-d381ecd3f950&ssk=botmanager_support@radware.com&ssm=02708147101004473307120869992119123&ssn=336b6e49fbf6aeed31f2d39c585568312c9a2617fe85-f716-4004-b1cc6e&sso=e96ce3eb-7b570d50c5e3a5bee90269f562e0ff6f72fb21a15b7fb447&ssp=42363570021726099354172620851234228&ssq=08938525117464322975377985973996781175065&ssr=NTIuMy4yMTcuMjU0&sst=com.plumanalytics&ssu=&ssv=&ssw=&ssx=eyJfX3V6bWYiOiI3ZjYwMDA2YzE4M2RjNi1hOWQwLTQzNzUtOTdhZS05YzZkMTBmMTM0MDAxNzI2MDc3OTg1NDI3MTczMTg4ODI5LWEyZmM4NGUxMTg5M2IzNjczMDcxMiIsInV6bXgiOiI3ZjkwMDBjMWRlMTM3OS01ODdiLTRmY2UtODI5My02NTAwN2FlMTAzYTUzLTE3MjYwNzc5ODU0MjcxNzMxODg4MjktYjFkNmQyYzdkNjVlYjE5NzMwNzA5IiwicmQiOiJpb3Aub3JnIn0=
IOP Publishing
Provide Feedback
Have ideas for a new metric? Would you like to see something else here?Let us know