Science topic

Cryptography - Science topic

A topic for the discussion of research into Cryptography and Cryptanalysis.
Questions related to Cryptography
  • asked a question related to Cryptography
Question
4 answers
I understand that it is possible to analyze this issue mathematically to estimate the memory requirements for TLS. However, I am particularly interested in understanding how much memory is actually utilized in current implementations. Insights on this matter would be greatly appreciated. Ideally, if anyone could reference relevant papers or studies, that would be perfect.
Moreover, my interest extends beyond memory usage; I am equally curious about the time required to perform a TLS handshake in practice.
Relevant answer
Answer
The TLS (Transport Layer Security) handshake is a critical process for establishing secure communications over the internet. Here are some pros and cons of the TLS handshake in practice:
Pros:
  1. Security: The primary advantage of the TLS handshake is its ability to establish a secure connection between a client and a server. It ensures that data transmitted over the connection is encrypted and protected from eavesdropping and tampering2.
  2. Authentication: The TLS handshake involves the exchange of digital certificates, which helps verify the identities of the communicating parties. This prevents man-in-the-middle attacks and ensures that users are connecting to legitimate servers.
  3. Data Integrity: TLS provides mechanisms to ensure that data is not altered during transmission. This is achieved through the use of cryptographic hash functions and message authentication codes (MACs).
  4. Widely Adopted: TLS is a widely adopted standard for securing internet communications. It is used in various applications, including web browsing, email, instant messaging, and VoIP.
Cons:
  1. Performance Overhead: The TLS handshake involves multiple steps, including key exchange and certificate verification, which can introduce latency and increase the time it takes to establish a connection3.
  2. Complexity: Implementing and managing TLS can be complex, requiring proper configuration and maintenance of digital certificates. Misconfigurations can lead to security vulnerabilities.
  3. Resource Intensive: The cryptographic operations involved in the TLS handshake can be resource-intensive, particularly for devices with limited processing power. This can impact the performance of servers and clients.
  4. Certificate Management: Managing digital certificates, including obtaining, renewing, and revoking them, can be cumbersome and costly. Failure to properly manage certificates can result in expired or compromised certificates.
Overall, while the TLS handshake provides robust security and authentication, it comes with trade-offs in terms of performance and complexity. Proper implementation and management are essential to maximize its benefits and minimize its drawbacks.
If you have any other questions or need further details, feel free to ask!
What is Transport Layer Security (TLS)? Strengths and Vulnerabilities Explained
https:/www.g2.com/articles/ssl-tls-handshake
  • asked a question related to Cryptography
Question
2 answers
With a background in cryptography and current work on Digital Product Passports (DPPs) for sustainability, I'm exploring how cryptographic techniques, like Zero-Knowledge Proofs, can address environmental transparency while protecting privacy. As these technologies become more accessible, a key question arises:
How can we ensure that implementing ZKPs in sustainability efforts, such as tracing product origins or securing green certifications, maintains a balance between traceability and data confidentiality?
For instance, ZKPs allow verification without revealing the full dataset, which is ideal for protecting sensitive information. However, questions remain about the scalability of these solutions and the potential trade-offs in resource-constrained environments.
I’d love to hear perspectives on these challenges and opportunities:
  1. What are the potential pitfalls in integrating ZKP with large-scale sustainability applications?
  2. How might regulatory frameworks evolve to address these new privacy-preserving methods in sustainability reporting?
  3. Are there use cases where ZKPs may not be the best solution?
Relevant answer
Answer
Yes, cryptography and zero-knowledge proofs (ZKPs) can play a significant role in balancing sustainability and privacy in digital product passports. Here’s how:
  1. Data Privacy: ZKPs allow one party to prove to another that a statement is true without revealing any specific information about the statement itself. This can help maintain user privacy while still providing necessary verification of product authenticity and sustainability claims.
  2. Secure Data Sharing: Cryptography ensures that sensitive data related to a product's lifecycle (e.g., materials used, manufacturing processes, and end-of-life disposal) can be securely shared among stakeholders without exposing the underlying data.
  3. Traceability: Digital product passports can utilize cryptographic techniques to ensure that information about a product's journey through the supply chain is tamper-proof, enhancing transparency and trust without compromising sensitive business information.
  4. Sustainability Claims Verification: Companies can use ZKPs to verify sustainability claims (like carbon footprint or ethical sourcing) without disclosing proprietary data, thus encouraging companies to participate in sustainability initiatives without fear of revealing competitive secrets.
  5. Regulatory Compliance: Cryptographic methods can help organizations comply with regulations regarding data protection and sustainability reporting by ensuring that only necessary information is shared, thereby protecting consumer privacy.
In summary, integrating cryptography and zero-knowledge proofs into digital product passports can enhance both privacy and sustainability, fostering trust among consumers and businesses while promoting responsible practices.
  • asked a question related to Cryptography
Question
1 answer
We are excited to invite researchers and practitioners to submit their work to the upcoming Workshop on Combating Illicit Trade, organized by Working Group 4 of the EU COST Action GLITSS. This workshop will focus on leveraging data science, artificial intelligence (AI), machine learning, and blockchain to address the global challenge of illicit trade.
Scope:
Illicit trade spans a wide range of domains, from trafficking of historical artifacts, human and wildlife trafficking, to environmental crimes. In this workshop, we aim to:
  • Address challenges in collecting reliable datasets and developing robust performance measures.
  • Explore the use of advanced technologies such as remote sensing, deep learning, network analysis, and blockchain to combat illicit trade.
  • Foster collaboration across academia, industry, and policy to innovate and share methodologies for the detection and prevention of illicit trade.
Topics of Interest:
  • Machine Learning, Deep Learning, and Reinforcement Learning
  • Explainable AI and Computer Vision
  • Remote Sensing and Spatial Data Analysis
  • Pattern Recognition and Predictive Analytics
  • Illicit Trade: Human and Wildlife Trafficking, Artefacts, Cultural Property
  • Environmental and Endangered Species Crimes
  • Financial and Cyber Crimes
  • Drugs, Arms, and Counterfeits
  • Blockchain and Cryptography
Important Dates:
  • Paper Submission: November 15, 2024
  • Authors Notification: January 6, 2025
  • Camera Ready and Registration: January 22, 2025
This workshop offers a unique opportunity to contribute to the global fight against illicit trade using cutting-edge technologies. We encourage authors to submit their research and join us in advancing this important field.
For more details on submission guidelines and registration, please visit https://icpram.scitevents.org/DSAIB-IllicitTrade.aspx.
Looking forward to your submissions!
Relevant answer
Answer
I am very ineterested.
  • asked a question related to Cryptography
Question
2 answers
Even if ECFM has demonstrated effective methods of resolution in some contexts, its completeness and improvement of performance context are still lacking relative to the scope of literature, particularly when it comes to comparison with newer or hybrid factorization algorithms. In addition, the effect of elliptic curves factorization on the security of certain cryptographic protocols remains to be established, especially as technology continues to undergo rapid changes.
The research is to be conducted in order to provide an in depth analysis of the working of ECFM, its mathematical parameters, its working efficiency and its implications for the cryptographic security, more specifically the following questions shall be raised in this context:
What are the general implications of ECFM usage in performance of other for the state of the art factorization algorithms with respect to diverse computational environments?
What are the merits and the possible demerits of using ECFM in any given scenario where cryptography is exercised?
What are the suggested methods of performance improvement and how can ECFM be modified in relation to other standard factorization performance tasks?
Relevant answer
Answer
dear Sureshkumar Somayajula 1. General Implications of ECFM Usage
Performance Relative to State-of-the-Art Algorithms:
  • Computational Efficiency: ECFM has been recognized for its efficiency in factoring large integers compared to classical methods like the quadratic sieve and general number field sieve, particularly for certain types of numbers. The implications of this efficiency can benefit fields that require rapid factorization, such as cryptanalysis or integer-based cryptographic algorithms.
  • Parallelism and Scalability: Considering diverse computational environments, ECFM can be parallelized effectively, which allows adaptation to multi-core and distributed computing setups, enhancing its performance significantly.
  • Hybrid Approaches: ECFM can be integrated with other factorization techniques to form hybrid approaches, possibly leveraging strengths from both ECFM and newer algorithms, thus improving overall performance.
2. Merits and Possible Demerits of Using ECFM
Merits:
  • Efficient for Certain Classes of Numbers: ECFM excels when factoring numbers with small prime factors or those that are not excessively large, making it a useful tool in specific scenarios.
  • Lower Memory Consumption: ECFM often requires less memory than some other methods, which can be advantageous in resource-constrained environments.
  • Quantum Resistance: Compared to classical algorithms, ECFM may present certain advantages in contexts where quantum algorithms could impact security, especially since traditional factoring advantages may not apply similarly to elliptic curves.
Demerits:
  • Complexity and Implementation Barriers: While ECFM is efficient, its mathematical complexity may present challenges in implementation and understanding compared to simpler methods.
  • Limited Scalability Beyond Certain Thresholds: ECFM's advantages may diminish when dealing with extremely large integers, particularly if hybrid methods are not utilized.
  • Potential Vulnerabilities: The security implications regarding advancements in quantum computing and the advent of new mathematical breakthroughs could pose risks to cryptographic protocols reliant on ECFM.
3. Suggested Methods of Performance Improvement
Modification and Efficiency Enhancement:
  • Algorithm Optimization: Analyzing the current algorithm for bottlenecks and implementing optimized arithmetic operations can help improve the performance of ECFM.
  • Hybridization with Other Algorithms: Combining ECFM with other factorization methods (such as the general number field sieve for large integers) can lead to improved efficiency and versatility.
  • Adaptive Parameter Selection: Developing adaptive techniques for the selection of elliptic curves based on the specifics of the integer being factored could enhance performance.
  • Leveraging Parallel Processing: Enhancing the implementation of ECFM for multi-threaded or distributed computing environments, thus allowing simultaneous execution of multiple instances of the algorithm.
  • asked a question related to Cryptography
Question
2 answers
会议征稿:第四届人工智能、机器人和通信国际会议(ICAIRC 2024)
Call for papers: IEEE 2024 4th International Conference on Artificial Intelligence, Robotics, and Communication (ICAIRC 2024) will be held in Xiamen on December 27-29, 2024.
Conference website(English): https://ais.cn/u/3aMje2
重要信息
大会官网(投稿网址):https://ais.cn/u/3aMje2
大会时间:2024年12月27-29日
大会地点:中国-厦门
收录检索:IEEE Xplore, EI Compendex, Scopus
会议详情
第四届人工智能、机器人和通信国际会议(ICAIRC 2024)定于2024年12月27-29日在中国厦门举行。会议旨在为从事“人工智能、机器人和通信”研究的专家学者、工程技术人员、技术研发人员提供一个共享科研成果和前沿技术,了解学术发展趋势,拓宽研究思路,加强学术研究和探讨,促进学术成果产业化合作的平台。大会诚邀国内外高校、科研机构专家、学者,企业界人士及其他相关人员参会交流。
征稿主题(包括但不限于)
1. 人工智能
人工智能应用与技术
人工神经网络
人工智能工具与应用
贝叶斯网络
神经信息学
机器人
数据挖掘
......
2. 机器人科学与工程
机器人控制
移动机器人
智能养老机器人
移动传感器网络
感知系统
微型机器人和微型操纵
视觉服务
搜索、救援和现场机器人
机器人传感与数据融合
......
3. 通信
光通信
无线通信和技术
高速网络
通信软件
超宽带通信
多媒体通信
密码学和网络安全
绿色通信
移动通信
会议论文出版
ICAIRC 2024所有的投稿都必须经过2-3位组委会专家审稿,经过严格的审稿之后,最终所有录用的论文将由IEEE出版(ISBN号:979-8-3315-3122-5),收录进IEEE Xplore数据库,见刊后由期刊社提交至EI 、SCOPUS收录。
参会方式
—— 每篇录用缴费的文章,允许一名作者免费参会 ——
(1)口头汇报:10-15分钟的全英PPT演讲;
*开放给所有投稿作者与自费参会人员;针对论文或者论文里面的研究做一个10-15min的英文汇报,需要自备PPT,无模板要求,会前根据会议邮件通知进行提交,详情联系会议秘书。
(2)海报展示:自制电子版海报,会议安排展示;
*开放给所有投稿作者与自费参会人员;格式:全英-A1尺寸-竖版,需自制;制作后提交海报图片至会议邮箱icairc@163.com,主题及海报命名格式为:海报展示+姓名+订单号。
(3)仅参会:非投稿作者,现场听众参会。
*仅开放给自费参会人员,(3人及以上)组队参会优惠请联系会议秘书。
(4)报名参会:https://ais.cn/u/3aMje2
Relevant answer
Answer
  • asked a question related to Cryptography
Question
6 answers
I’m planning to apply for an MSc in Computer Science with a specialization in Secure and Reliable Systems at ETH Zurich. For this, I aim to develop a robust Master’s thesis proposal. As a foundation, I want to create a Bachelor’s thesis focused on cutting-edge cryptographic technologies, particularly Zero Knowledge Proofs, Multi-Party Computation, and blockchain.
I’m reaching out to fellow researchers for potential research questions and ideas on how to extend a Bachelor’s thesis into a solid Master’s thesis proposal. Your insights and experiences would be invaluable in shaping my research direction!
#Cryptography #ZeroKnowledgeProofs #MultiPartyComputation #Blockchain #SecureSystems #ResearchIdeas #ETHZurich #ThesisProposal
Relevant answer
  • asked a question related to Cryptography
Question
5 answers
Please suggest basic literature on lattice-based cryptography. A kind response from the cryptographic community will be highly appreciated.
  • asked a question related to Cryptography
Question
3 answers
in H1 list w refer to word and h refer to hash of w and c refer to random coin but what about "a"?
Relevant answer
  • asked a question related to Cryptography
Question
5 answers
Currently working on e-voting using cryptographic Techniques. I Would like to implement RSA and also to know how SHA works technically with RSA.
Relevant answer
  • asked a question related to Cryptography
Question
1 answer
会议征稿:2024年计算机与信息安全国际会议 (WCCIS 2024)
Call for papers: Organized by Universiti Malaya, 2024 World Conference of Computer and Information Security(WCCIS 2024) will be held on 20-22 September 2024 in Malaysia.
Conference website(English):https://ais.cn/u/JnMNfa
重要信息
大会官网(投稿网址):https://ais.cn/u/JnMNfa
大会时间:2024年9月20-22日
大会地点:吉隆坡,马来西亚 | 中国郑州 双会场
收录类型:EI Compendex、Scopus
主办单位:马来亚大学、郑州大学公共安全研究院
会议详情
由马来亚大学主办,2024年计算机与信息安全国际会议 (WCCIS 2024) 将于2024年9月20-22日召开。会议将设置中国/马来西亚双会场。中国会场将在郑州举行;马来西亚会场将在吉隆坡召开。会议旨在为从事计算机与信息安全的专家学者、工程技术人员、技术研发人员提供一个共享科研成果和前沿技术,了解学术发展趋势,拓宽研究思路,加强学术研究和探讨,促进学术成果产业化合作的平台。
会议征稿主题(包括但不限于)
网络
访问控制
信息系统安全与管理
社交网络安全、隐私和信任
计算机网络与通信
信号和图像处理
信息安全算法与协议
嵌入式系统安全
通信工程
卫星通信
云与边缘计算安全
区块链安全与隐私
身份访问管理
网络物理系统安全
知识产权保护
智能信息处理技术
数据挖掘
数据可视化
图像处理
语音识别
信息技术在企业的应用
信号处理
智能通信与计算
数学与信息网络
数字媒体信息处理
卫星通信
无线通信
系统模型设计与信息管理
生物识别技术
嵌入式系统和软件
物联网信息安全
社交网络
物联网信息分析处理
......
出版信息
本会议投稿经过2-3位组委会专家严格审核之后,最终所录用的论文将由全球知名的科技出版社380220803174252410.png斯普林格旗下的Springer-LNICST(Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering), ISSN: 1867-822X 出版,出版后提交至EI Compendex,Scopus检索。
参会报名
1、投稿作者参会:投稿全文经审稿后文章被录用且完成注册,每篇文章由一名作者代表参会,在会议现场进行口头报告或海报展示。
2、报告者参会(无投稿):在会议上进行口头报告展示,口头报告摘要不提交出版。
3、海报参会(无投稿):在会议上进行论文海报展示,A1尺寸,彩色打印(具体要求咨询会议负责老师)。
4、听众参会(无投稿):出席并参加这次会议, 并可全程旁听会议所有展示与报告。
*参会报名方式:https://ais.cn/u/JnMNfa
Relevant answer
Answer
me bridaria mas infiormacion por favor
  • asked a question related to Cryptography
Question
2 answers
Explore the unresolved question in computational complexity theory, addressing whether problems solvable in polynomial time (P) can be verified as efficiently as they are solved (NP), impacting fields like cryptography and optimization.
Relevant answer
Answer
The question of whether P equals NP in polynomial time is one of the most famous unsolved problems in computational complexity theory. In this context, P refers to the set of problems that can be solved in polynomial time on a deterministic Turing machine, while NP refers to the set of problems for which a solution can be verified in polynomial time once it is given.
If P were to equal NP, it would imply that problems for which solutions can be verified quickly could also be solved quickly. This would have profound implications across various fields, including cryptography, optimization, artificial intelligence, and many other areas of computer science.
For example, in cryptography, the security of many encryption algorithms relies on the assumption that certain problems are hard to solve (NP-hard problems). If P were to equal NP, it could potentially mean that these problems are not as hard to solve as previously believed, leading to significant vulnerabilities in cryptographic systems.
Similarly, in optimization, many real-world problems involve finding the best solution among a vast number of possible options. If P were to equal NP, it would revolutionize optimization algorithms, potentially enabling the efficient solution of complex optimization problems that are currently considered computationally intractable.
Despite decades of research and numerous attempts to solve the P vs. NP problem, no definitive answer has been found yet. The resolution of this question would not only have far-reaching implications for computer science but also impact our understanding of the inherent complexity of computational problems and the limits of efficient computation.
  • asked a question related to Cryptography
Question
3 answers
Explore the intersection of quantum computing and cryptography, focusing on the impact of quantum algorithms on current security protocols and the potential vulnerabilities or advancements in cybersecurity.
Relevant answer
Answer
Dear S M Mohiuddin Khan Shiam,
You may want to look over some helpful information presented below:
Quantum algorithms have the potential to significantly impact cryptographic protocols, both in terms of enhancing security and posing new challenges for traditional cryptographic methods. Here are key aspects of how quantum algorithms can influence cryptographic protocols and their implications for cybersecurity:
  1. Shor's Algorithm and RSA/ECDSA: Enhancement: Shor's algorithm, a quantum algorithm, can efficiently factor large numbers. This capability threatens the security of widely used public-key cryptosystems like RSA and ECDSA, which rely on the difficulty of factoring large numbers for their security. Implications: If large-scale quantum computers become practical, these algorithms could break the security of current public-key cryptography. This has prompted the need for quantum-resistant cryptographic algorithms, often referred to as post-quantum cryptography.
  2. Quantum Key Distribution (QKD): Enhancement: QKD leverages the principles of quantum mechanics to secure communication channels by detecting any eavesdropping attempts. It offers a theoretically secure way to exchange cryptographic keys. Implications: QKD can enhance the security of key exchange protocols, providing a level of security that is guaranteed by the laws of physics. However, practical implementations of QKD face challenges, and its widespread adoption is still evolving.
  3. Grover's Algorithm and Symmetric Key Encryption: Enhancement: Grover's algorithm accelerates the search of an unsorted database, providing a quadratic speedup. In the context of cryptography, this implies that symmetric key lengths could be effectively halved in a post-quantum scenario without sacrificing security. Implications: While Grover's algorithm doesn't break symmetric key encryption, it requires doubling key lengths to maintain equivalent security against quantum attacks. This has implications for the efficiency and performance of symmetric-key cryptographic protocols.
  4. Multivariate Polynomial Cryptography: Enhancement: Some post-quantum cryptographic algorithms, such as multivariate polynomial cryptography, are based on mathematical problems that are hard for both classical and quantum computers to solve. Implications: These types of algorithms offer potential alternatives to traditional cryptographic approaches and are being explored as part of the ongoing effort to develop quantum-resistant cryptographic solutions.
  5. Security Challenges: Enhancement: Quantum computers can theoretically break certain cryptographic schemes more efficiently than classical computers. Implications: As quantum computers advance, they could potentially undermine the security of widely used cryptographic protocols. Organizations need to prepare for the post-quantum era by developing and adopting quantum-resistant cryptographic algorithms.
  6. Quantum-Safe Cryptography: Enhancement: Quantum-safe or post-quantum cryptography involves the development and deployment of cryptographic algorithms that remain secure even in the presence of quantum computers. Implications: Preparing for the post-quantum era involves transitioning to quantum-safe cryptographic algorithms to ensure the continued security of sensitive data in a quantum computing environment.
In summary, while quantum algorithms pose threats to certain cryptographic protocols, they also offer opportunities for developing more secure communication methods. The ongoing development of quantum-resistant cryptographic algorithms is crucial to maintaining the security of information in the face of evolving quantum computing capabilities. As quantum technologies advance, the field of cryptography will need to adapt to address both the challenges and opportunities presented by quantum algorithms.
  • asked a question related to Cryptography
Question
13 answers
The future of blockchain-based internet solutions
Blockchain is defined as a decentralized and distributed database in the open source model in a peer-to-peer internet network without central computers and without a centralized data storage space, used to record individual transactions, payments or journal entries encoded using cryptographic algorithms.
In current applications, blockchain is usually a decentralized and dispersed register of financial transactions. It is also a decentralized transaction platform in a distributed network infrastructure. In this formula, blockchain is currently implemented into financial institutions.
Some banks are already trying to use blockchain in their operations. if they did not do it, other economic entities, including fintechs, implementing blockchain could become more competitive in this respect. However, cryptocurrencies and a secure record of transactions are not the only blockchain applications. Various potential blockchain applications are being considered in the future.
Perhaps these new, different applications already exist in specific companies, corporations, public institutions or research centers in individual countries. In view of the above, the current question is: In what applications, besides cryptocurrency, blockchain in your company, organization, country, etc.?
Please reply
I invite you to the discussion
Thank you very much
Best wishes
Relevant answer
Answer
A. Abusukhon, Z. Mohammad, A. Al-Thaher (2021) An authenticated, secure, and mutable multiple-session-keys protocol based on elliptic curve cryptography and text_to-image encryption algorithm. Concurrency and computation practice and experience. [Science Citation Index].
A. Abusukhon, N. Anwar, M. Mohammad, Z., Alghanam, B. (2019) A hybrid network security algorithm based on Diffie Hellman and Text-to-Image Encryption algorithm. Journal of Discrete Mathematical Sciences and Cryptography. 22(1) pp. 65- 81. (SCOPUS). https://www.tandfonline.com/doi/abs/10.1080/09720529.2019.1569821A. Abusukhon, B.Wawashin, B. (2015) A secure network communication protocol based on text to barcode encryption algorithm. International Journal of Advanced Computer Science and Applications (IJACSA). (ISI indexing). https://thesai.org/Publications/ViewPaper?Volume=6&Issue=12&Code=IJACSA&Seri alNo=9
A. Abusukhon, Talib, M., and Almimi, H. (2014) Distributed Text-to-Image Encryption Algorithm. International Journal of Computer Applications (IJCA), 106 (1). [ available online at : https://www.semanticscholar.org/paper/Distributed-Text-to-Image-Encryption-Algorithm-Ahmad-Mohammad/0764b3bd89e820afc6007b048dac159d98ba5326]
A. Abusukhon (2013) Block Cipher Encryption for Text-to-Image Algorithm. International Journal of Computer Engineering and Technology (IJCET). 4(3) , 50-59. http://www.zuj.edu.jo/portal/ahmad-abu-alsokhon/wpcontent/uploads/sites/15/BLOCK-CIPHER-ENCRYPTION-FOR-TEXT-TO-IMAGE ALGORITHM.pdf
A. Abusukhon, Talib, M. and Nabulsi, M. (2012) Analyzing the Efficiency of Text-to-Image Encryption Algorithm. International Journal of Advanced Computer Science and Applications ( IJACSA )(ISI indexing) , 3(11), 35 – 38. https://thesai.org/Publications/ViewPaper?Volume=3&Issue=11&Code=IJACSA&Seri alNo=6
A. Abusukhon, Talib M., Issa, O. (2012) Secure Network Communication Based on Text to Image Encryption. International Journal of Cyber-Security and Digital Forensics (IJCSDF), 1(4). The Society of Digital Information and Wireless Communications (SDIWC) 2012. https://www.semanticscholar.org/paper/SECURENETWORK-COMMUNICATION-BASED-ON-TEXT-TO-IMAGE-Abusukhon-Talib/1d122f280e0d390263971842cc54f1b044df8161
  • asked a question related to Cryptography
Question
5 answers
I need papers for that
Relevant answer
Answer
Hi,
This is a list of papers:
Hi Maytha,
You may find my paper list useful for your future work:
■ A. Abusukhon, Z. Mohammad, A. Al-Thaher (2021) An authenticated, secure, and mutable multiple-session-keys protocol based on elliptic curve cryptography and text_to-image encryption algorithm. Concurrency and computation practice and experience. [Science Citation Index].
■ Ahmad Abusukhon, Bilal Hawashin and Mohammad Lafi (2021) An Efficient Algorithm for Reducing the Power Consumption in Offices Using the Internet of Things, International Journal of Advances in Soft Computing and its Applications (IJASCA). http://ijasca.zuj.edu.jo/Volumes.aspx
■ A. Abusukhon, N. Anwar, M. Mohammad, Z., Alghanam, B. (2019) A hybrid network security algorithm based on Diffie Hellman and Text-to-Image Encryption algorithm. Journal of Discrete Mathematical Sciences and Cryptography. 22(1) pp. 65- 81. (SCOPUS). https://www.tandfonline.com/doi/abs/10.1080/09720529.2019.1569821
■ A. Abusukhon, B.Wawashin, B. (2015) A secure network communication protocol based on text to barcode encryption algorithm. International Journal of Advanced Computer Science and Applications (IJACSA). (ISI indexing). https://thesai.org/Publications/ViewPaper?Volume=6&Issue=12&Code=IJACSA&Seri alNo=9
■ A. Abusukhon, Talib, M., and Almimi, H. (2014) Distributed Text-to-Image Encryption Algorithm. International Journal of Computer Applications (IJCA), 106 (1). [ available online at : https://www.semanticscholar.org/paper/Distributed-Text-to-Image-Encryption-Algorithm-Ahmad-Mohammad/0764b3bd89e820afc6007b048dac159d98ba5326]
■ A. Abusukhon (2013) Block Cipher Encryption for Text-to-Image Algorithm. International Journal of Computer Engineering and Technology (IJCET). 4(3) , 50-59. http://www.zuj.edu.jo/portal/ahmad-abu-alsokhon/wpcontent/uploads/sites/15/BLOCK-CIPHER-ENCRYPTION-FOR-TEXT-TO-IMAGE ALGORITHM.pdf
■ A. Abusukhon, Talib, M. and Nabulsi, M. (2012) Analyzing the Efficiency of Text-to-Image Encryption Algorithm. International Journal of Advanced Computer Science and Applications ( IJACSA )(ISI indexing) , 3(11), 35 – 38. https://thesai.org/Publications/ViewPaper?Volume=3&Issue=11&Code=IJACSA&Seri alNo=6
■ A. Abusukhon, Talib M., Issa, O. (2012) Secure Network Communication Based on Text to Image Encryption. International Journal of Cyber-Security and Digital Forensics (IJCSDF), 1(4). The Society of Digital Information and Wireless Communications (SDIWC) 2012. https://www.semanticscholar.org/paper/SECURE-NETWORK-COMMUNICATION-BASED-ON-TEXT-TO-IMAGE-Abusukhon-Talib/1d122f280e0d390263971842cc54f1b044df816
Regards,
Ahmad
  • asked a question related to Cryptography
Question
5 answers
Hi Dears, according to implementation RSA in python. I found that if p and q large.
the decryption phase takes a lot of time to execute.
for example, in this code i select p=23099, q=23059, message=3
it takes 26 minute it decrypts the encrypted message.!
So I wonderful how we can select to large prime number for RSA, while it cannot execute in desired time. !
So, I think that we cannot use RSA i n real time systems.
Are you agree with me?
the source code is:
from math import gcd
import time
# defining a function to perform RSA approch
def RSA(p: int, q: int, message: int):
# calculating n
n = p * q
print(n)
# calculating totient, t
t = (p - 1) * (q - 1)
start = time.time()
# selecting public key, e
for i in range(2,t):
if gcd(i, t) == 1:
e = i
break
print("eeeeeeeeeeeeee",e)
# selecting private key, d
j = 0
while True:
if (j * e) % t == 1:
d = j
break
j += 1
print("dddddddddddddddd",d)
end = time.time()
# print(end-start)
e=0
#RSA(p=7, q=17, message=3)
RSA(p=23099, q=23059, message=3)
d=106518737
n=532639841
e=5
#RSA(p=23099, q=23059, message=3)
start= time.time()
ct=(3 ** e) % n
print(ct)
pt=(ct ** d) % n
end = time.time()
print(end-start)
print(pt)
#----------------------------------------------------
Relevant answer
Answer
Hi Mohammad,
If you're using Python, I'd suggest using pow(ct, d, n) instead of pt=(ct ** d) % n. That should improve the time. As Wim suggests, modular exponentiation improves the running time of large exponents.
Cheers
  • asked a question related to Cryptography
Question
7 answers
Blockchain is a distributed database of immutable records called blocks, which are secured using cryptography. There are a previous hash, transaction details, nonce, and target hash value. Financial institutions were the first to pay notice to it, as it was in simple words a new payment system.
Block is a place in a blockchain where data is stored. In the case of cryptocurrency blockchains, the data stored in a block are transactions. These blocks are chained together by adding the previous block's hash to the next block's header. It keeps the order of the blocks intact and makes the data in the blocks immutable.
A block is like a record of the transaction. Each time a block is verified, it gets recorded in chronological order in the main Blockchain. Once the data is recorded, it cannot be modified.
Relevant answer
Answer
Blocks are data structures within the blockchain database, where transaction data in a cryptocurrency blockchain are permanently recorded. A block records some or all of the most recent transactions not yet validated by the network. Once the data are validated, the block is closed. Then, a new block is created for new transactions to be entered into and validated.
A block is thus a permanent store of records that, once written, cannot be altered or removed...
Blocks and blockchains are not used solely by cryptocurrencies. They also have many other uses...
  • asked a question related to Cryptography
Question
4 answers
Please guide me on how can I find a topic for my thesis and where to start work.
Relevant answer
Answer
You have a general topic, now think about the skills you want to use. What skills and knowledge do you want to sharpen for your next job? What have you mastered? Do you like playing with data or writing and explaining models? Are your interests interdisciplinary?
At the end of your thesis, for one hot minute, you will be the world's expert in answering one question. What do you want that question to be?
  • asked a question related to Cryptography
Question
6 answers
I need to understand what & how to choose sampling techniques I should pick to explore cryptography issues in cyber security domain.
Relevant answer
Answer
To start on research design and sampling techniques in cybersecurity and cryptography, the following steps may be helpful:
1. Define research problem: Identify a topic that is worth studying. It could be a security vulnerability that needs to be addressed or a cryptographic algorithm that needs to be studied.
2. Literature Review: Review existing studies and literature related to the topic. It will help understand the research gaps and research questions.
3. Research questions: Develop research questions that will guide the research study. For example, "What are the common cyber-attacks on financial institutions, and what are the effective cryptography techniques to defend against them?"
4. Research design: Select a research design that allows answering the research questions effectively. It could be experimental, survey-based, observational, etc.
5. Sampling Techniques: Determine the appropriate sampling technique that will help in selecting the participants from the population. In cybersecurity and cryptography, it is essential to choose participants who have knowledge and experience in the field.
6. Data Collection: Collect data that aligns with the research design and research question. For instance, if the research design is a case study, collect data through interviews, observation, and documentation.
7. Data Analysis: Analyze the collected data to answer the research questions. It can be done by applying qualitative or quantitative analysis methods.
8. Draw Conclusions: Based on the analysis, draw conclusions from the research study, and provide recommendations.
  • asked a question related to Cryptography
Question
11 answers
These days VAS are playing important roles in mobile networks, so without their security nobody can rely on them. In these instances cryptography plays an important role in securing these issues. I want to know the best way to apply cryptography VAS. Also any references would be appreciated.
Relevant answer
Answer
There are various ways in which cryptography can be applied to value-added services in mobile networks. One way is to use encryption to secure the communication between the mobile device and the service provider. This can be done by using algorithms such as AES (Advanced Encryption Standard) or RSA (Rivest–Shamir–Adleman).
Another way is to use digital signatures to authenticate users and transactions. Digital signatures use a combination of public and private keys to prove the authenticity of a message or transaction. This can be particularly important for financial transactions or other sensitive transactions.
Finally, it's important to use secure protocols such as TLS (Transport Layer Security) or HTTPS (HTTP Secure) to ensure that all communication between the mobile device and the service provider is encrypted and secure. These protocols can help to prevent eavesdropping and other types of attacks that can compromise the security of value-added services in mobile networks.
  • asked a question related to Cryptography
Question
4 answers
Cryptography efficiency
Relevant answer
Answer
Dear Isaac Obiri,
You may want to look over the following data below:
A Study of Hyperelliptic Curves in Cryptography
Elliptic curves are some specific type of curves known as hyper elliptic curves. Compared to the integer factorization problem(IFP) based systems, using elliptic curve based cryptography will significantly decrease key size of the encryption. Therefore, application of this type of cryptography in systems that need high security and smaller key size has found great attention. Hyperelliptic curves help to make key length shorter. Many investigations are done with regard to improving computations, hardware and software implementation of these curves, their security and resistance against attacks. This paper studies and analyzes researches done about security and efficiency of hyperelliptic curves.
_____
_____
Hyper-and-elliptic-curve cryptography
This paper introduces ‘hyper-and-elliptic-curve cryptography’, in which a single high-security group supports fast genus-2-hyperelliptic-curve formulas for variable-base-point single-scalar multiplication (for example, Diffie–Hellman shared-secret computation) and at the same time supports fast elliptic-curve formulas for fixed-base-point scalar multiplication (for example, key generation) and multi-scalar multiplication (for example, signature verification).
_____
_____
An (imaginary) hyperelliptic curve of genus over a field is given by the equation where is a polynomial of degree not larger than and is a monic polynomial of degree. From this definition it follows that elliptic curves are hyperelliptic curves of genus 1. In hyperelliptic curve cryptography is often a finite field. The Jacobian of, denoted, is a quotient group, thus the elements of the Jacobian are not points, they are equivalence classes of divisors of degree 0 under the relation of linear equivalence. This agrees with the elliptic curve case, because it can be shown that the Jacobian of an elliptic curve is isomorphic with the group of points on the elliptic curve.[1] The use of hyperelliptic curves in cryptography came about in 1989 from Neal Koblitz. Although introduced only 3 years after ECC, not many cryptosystems implement hyperelliptic curves because the implementation of the arithmetic isn't as efficient as with cryptosystems based on elliptic curves or factoring (RSA). The efficiency of implementing the arithmetic depends on the underlying finite field, in practice it turns out that finite fields of characteristic 2 are a good choice for hardware implementations while software is usually faster in odd characteristic.[2].
_____
_____
  • asked a question related to Cryptography
Question
2 answers
Greetings all,
I am a Phd student starting on my thesis journey to hopefully do good to the libraries, furthermore, lets say the main theme focus suggested by the ministy of higher education is the corporate governance and IPO instead of internal financing. and since I am highly interested in Blockchain I believe such techonology would serve corporate governance in wide range of ways, since it shares same characteristics with it (Transparency, cryptography, security etc), My question is what problem can we solve on the IPO in particular? can we assume blockchain adoption is same as corporate governance ? what variables can we use? the preferable study case (empirical ? ) I would be happy to find some insights since it is broad new topic and we need to shed lights on. thanks in advance
Relevant answer
Answer
Look into DAOs or decentralized autonomous organizations
  • asked a question related to Cryptography
Question
3 answers
I'm working on modifying the TDES cipher and the implementation will be in pure python (only builtin libraries used), and need to compare the results with the standard pure python implementation of the original TDES and other ciphers . Is there a repository containing such pure implementations (in python) without re-implementing them from scratch?
Relevant answer
Answer
Why do you need a python version to start with? Python is close enough to C, certainly for the language elements used in symmetric cryptography that a "find and replace" on an existing C example will do most of the work.
The golden standard for refence values is of course FIPS-46, but OpenSSL is unlikely to deviate ;-) Another very commonly used code base is libtomcrypt.
  • asked a question related to Cryptography
Question
6 answers
What is the background story of calculating the value of d in the RSA algorithm of Cryptography and Network Security?
The value of d is required for decryption. I want to know the derivation of finding d. The equation of finding d is d = e-1mod Φ(n).
Consider an example: P = 17, q = 7, n = 119, φ (n) = 96, e = 5. From here I want to find the value of d in my hand. How can I do this?
Relevant answer
Answer
The idea! The idea of RSA is based on the fact that it is difficult to factorize a large integer. The public key consists of two numbers where one number is multiplication of two large prime numbers. And private key is also derived from the same two prime numbers. So if somebody can factorize the large number, the private key is compromised. Therefore encryption strength totally lies on the key size and if we double or triple the key size, the strength of encryption increases exponentially. RSA keys can be typically 1024 or 2048 bits long, but experts believe that 1024 bit keys could be broken in the near future. But till now it seems to be an infeasible task.
  • asked a question related to Cryptography
Question
3 answers
It is widely claimed, without any hesitation or disclaimer, that quantum computers (QC) can (or well, will be soon able to) break cryptography by factorizing large numbers. However, to my knowledge, largest number ever factorized by a quantum computer is 21 (= 7 x 3) for Shors algorithm, and to make things worse, this world record hasn't been improved for a whole decade!
Some larger numbers were factorized too, but not like "give me a number and I will factorize it". Rather, it was done by starting from a known solutuion and figuring out if this particular case could be programmed in to the QC - which is basically cheating, or at least not a useful factorization process.
So what is stopping the game? What are the factors that limit the size (measured in number of bits) of an arbitrary numer that can be factorized by a QC? Are they just a technologic annoyance or is there a fundamental obstacle that invalidades QC from ever factoring large numbers?
Relevant answer
Answer
Quantum computers work with quantum gates, just like classical computers work with classical gates. In both cases the gates are ``logical''-their material implementation just respects the logic.
For classical computers it's known how to design logical circuits that can realize any computation-and how to construct real circuits that implement this; for quantum computers this isn't, yet, known at comparable level of detail.
Factoring a number means two things: (a) Deciding whether it's a prime or not; and, (b) Determining its factors. The two problems are, actually, independent, since it is possible to solve (a), without solving (b)-of course, solving (b) provides an answer to (a).
What was realized, before quantum algorithms were even imagined, was that it was possible to define the probability that, given a number N, another number, a, could be one of its factors. This led to classical factoring algorithms and quantum algorithms.
With 50 bits one can represent all integers from 0 to 250-1. So any such integer is a string of 50 bits. So it's necessary to translate the statements of problems (a) and (b) into operators on such strings. It might be useful to start with smaller numbers, to understand how things work. Shor's algorithm is presented here: https://en.wikipedia.org/wiki/Shor%27s_algorithm and this might be a good place to start. It solves problem (b) by realizing a way for computing the probability that some number is, or not, a factor of the number one wants to factor.
In general, the bits will be entangled, of course.
  • asked a question related to Cryptography
Question
2 answers
2 Logistic chaotic sequences generation, we are generating two y sequence(Y1,Y2) to encrypt a data
2D logistic chaotic sequence, we are generating x and y sequence to encrypt a data
whether the above statement is correct, kindly help in this and kindly share the relevant paper if possible
Relevant answer
Answer
after reading an article baesd on quantum image encryption I think these two chaotic sequences are used for a key generation, not for encryption.
  • asked a question related to Cryptography
Question
3 answers
Good day Dear Researchers. Please I would want to ask a question on cryptography. Am trying to use hybrid cryptography to secure a system, that is 3DES AND AES. Is it possible to merge both algorithms to have a unique algorithm. Or we encrypt the plaintext using the first algorithm (3DES) then the output is encrypted again using the next algorithm (AES). PLEASE, WHICH IS BETTER AND WHY?? AND WHICH IS POSSIBLE AND WHY??
Relevant answer
Answer
Dear Chibueze Nwamouh Ubochi,
Find below several professional opinions to your question:
Integrating AES, DES, and 3-DES Encryption Algorithms for Enhanced Data Security
_____
Why would anyone choose 3DES over AES in software?
_____
Combination of more than one crypto algorithm
  • asked a question related to Cryptography
Question
1 answer
Dear colleagues and experts
When I encrypt audio using one of the chaotic map for example logistic map and then DNA cryptography rules, how can I estimate the keyspace of all system
Thanks
Relevant answer
Answer
  • asked a question related to Cryptography
Question
2 answers
Kindly visit the article, and share your honest thoughts in any communication style, even if you are not an expert. Feel free to submit your thoughts here, or under the comments section of the article.
Looking forward to hear your thoughts. Let the fun debates begin!
Best,
M. R.
Relevant answer
Answer
hi,
In cryptography, a key derivation function (KDF) is a cryptographic algorithm that derives one or more secret keys from a secret value such as a main key, a password, or a passphrase using a pseudorandom function (which typically uses a cryptographic hash function or block cipher).Ġasaq; a provably secure key derivation method that, when given access to a true random number generator (TRNG), allows communicating parties, that have a pre-shared secret password p, to agree on a secret key k that is indistinguishable from truly random numbers with a guaranteed entropy.The derivation key index is used to locate the derivation key (i.e. the master DES key) for the issuer BIN, as derived by the online switch in case of EMV cards. .
for more info:
best wishes..
  • asked a question related to Cryptography
Question
6 answers
Hi all,
Does PUF stop side channel attacks?? If so, how does PUF stop side channel analysis based on timing differences or power differences??
Thanks in advance..
Relevant answer
Answer
It does not stop side channel attack. In contrast, one of the problems of PUF is the side channel attack itself.
  • asked a question related to Cryptography
Question
3 answers
I was able to create a compound chaotic system which is given satisfying results so far when used to generate substitution boxes. However, I want to improve the values of NL, SAC, BIC, DP and LP. I need recommendations on how to improve these values. What I am thinking is to use values generated by the proposed chaotic system as an input for elliptic curve. Problem is that I am not much familiar with ECC. Please help in this regard. Thank you!
P.S. I want to achieve results much better than AES S-box in all criteria.
Relevant answer
Answer
Hi
It is always better to mention the full forms such as Avalanche Effect, Bit Independence etc of the matrices instead of BIC, SAC etc so that it will be easier for people to understand and respond.
Please follow the link given below for SAC
  • asked a question related to Cryptography
Question
7 answers
I am interested in the usefulness of zero knowledge proof in verifying an algorithm (for bias, privacy, data processing, and general deployment process). Have you come across examples of it in regulatory compliance?
  • asked a question related to Cryptography
Question
8 answers
May you please name some good books on Blockchain technology?
Relevant answer
Answer
Dear Jay Kamlesh Dave,
Here there are some more:
  • asked a question related to Cryptography
Question
6 answers
Today's network security is mainly based on public-key cryptography. It is expected that these algorithms will be faster to break for attackers with quantum computers. Especially in case of collecting vehicle data in central storage systems, which could be used to support autonomous driving or to solve crimes, security plays a major role. This raises the question of the application of Post-Quantum Cryptography. In which time frame are realizations seen and also the costs of the application?
Relevant answer
Answer
I want to share this talk with you: " Drive (Quantum) Safe! –Towards Post-Quantum Security for Vehicle-to- Vehicle Communications; " which is presented at CAST e.V. Workshop “Quantentechnologie und Quantencomputer-resistente Sicherheit” 2021 (virtual). The link is here https://ninabindel.de/presentations-2.
In short, they concluded that Falcon-512 is the most suitable NIST PQC finalist for V2V and illustrate how Falcon can be incorporated.
  • asked a question related to Cryptography
Question
3 answers
Some recent events point that IBM got a 27 qubit computer (https://www.ibm.com/blogs/research/2020/09/ibm-quantum-roadmap/), and maybe 10 years from now one with one million qubits (see same source). Speculations aside, the fact is that quantum entanglement does proves a remarkable advancement in cryptography, among many other applications.
On the other hand let us recapitulate that the Riemann hypothesis (RH) is still out there, unsolved, and that its proof (or disproof) might lead to an understanding on how to factorize much faster than now. We know that today's internet security is based on prime cryptography, and hence its very close connection to a proof of the RE, even if that proof is only existential (the tools for proving it may show a way for faster factorization, and hence to decrypt in way that can't be done now).
It seems that quantum cryptography might arrive much faster than the solution to the RE, and hence the question. As concerns of cryptography, RE would appear that it has lost its most important motivation to be researched, at least commercially speaking. Thus, RE would remain as a pure mathematical problem ( a very tough one, though), connected, perhaps, with many other mathematical statements that are assumed true, if RE is proven true. So, the question is:
Is RE still relevant for some foreseeable practical applications, other that cryptography?
Relevant answer
Answer
Yes, it's relevant for a lot of things, if you're into math, of course.
I have a sketch of a proof for it in my profile, go check it out.
  • asked a question related to Cryptography
Question
7 answers
Respected research fellows,
I am working on logistic chaotic map for generating numbers from 0-255 (in non-repetitive manner), so far I am successful in generating numbers but there are so many repetition of values. I need some help please! Following is python snippet I am using to generate these numbers.
def sbox(x, r, size):
i = []
for j in range(size):
x=r*x*(1-x)
i.append(int((x* pow(10,14))%256))
return i
print(sbox(0.9058,3.9,256))
This will eventually go towards Substitution Box creations.
Relevant answer
Answer
Karima Amara Korba Thank you ma'am. I already found a solution but I am working on it. I will share it with the research community once I am successful.
  • asked a question related to Cryptography
Question
7 answers
Hello all, I'm an undergraduate student and currently I'm interested to learn more about Cryptographic for Network Security. I want to know is there any paper or journal that quickly summarize whether each Encryptions Algorithm has their own behaviour that maybe works better for its different purposes?
Like some algorithms are best-used for Cloud Computing, some others are for an E-Commerce website, some others for Social Media application, etc. that would lead to decision making of which are more suitable for algorithm for every project.
Thanks before!
Relevant answer
Answer
RSA
  • asked a question related to Cryptography
Question
5 answers
My friend and I wrote a research paper on computer science (cryptography). The article is a simple contribution. We need someone to join us and do a good grammar correction for the theory part. In addition, an improvement may be proposed to the proposed contribution.
my respects
Relevant answer
Answer
Dear Seddiq Abd Al-Rahman
I will be interested in that.
  • asked a question related to Cryptography
Question
17 answers
Hi, I am looking forward for collaborators (academic and research work) who are interested to work in the following area:
Quantum Attacks
Quantum Computing
Quantum Artificial Intelligence
Post-quantum Cryptography
Internet of Drones
Blockchain and Quantum Computing
Relevant answer
Answer
Hello Sir,
I am interested in the suggested topics. My domain is cloud computing security using cryptographic techniques. I have few publications in this domain. Please have a look.
Regards
  • asked a question related to Cryptography
Question
5 answers
I want to generate a Lyapunov-exponents-Diagram for my new chaotic map using matlab code. i am unable understand the concept which some of the matlab codes used to get Lyapunov-exponents-Diagram for any chaotic map . kindly help me
Relevant answer
Answer
You may get some ideas here. Just apply the same for your chaotic map.
  • asked a question related to Cryptography
Question
3 answers
NIST randomness test is very important for any encryption algorithm. I want Matlab code for NIST test.
Relevant answer
Answer
I have tested the image using different test suites in the following paper. (Not only NIST)
  • asked a question related to Cryptography
Question
11 answers
The recent Sveriges Riksbank Prize in Economic Sciences or Nobel prize (as commonly known) was actually awarded to an economist (Fama) who claimed that markets are efficient and any prediction of it's movement is fruitless. Isn't the Bitcoin price random too?
Furthermore, we can even fit Robert Schiller's theory into it. There is clearly a long-term trend and crazy volatility. Also, Bitcoin tries modelling the ideal world scenario of no transaction fee as used when designing theory like CAPM.
With such similarities, why isn't research being done in the Bitcoins? There's so little to read. We pretty much end up with Satoshi's paper which is more cryptography and less economics.
Relevant answer
Answer
Bitcoin (not asset backed cryptocurrencies) is nothing more and nothing less than unlicensed gambling. Instead, central bank cryptocurrencies -- digital regular money issued by government -- will lead change.
Details are in my book: Bitcoin: The Mother of all Scams. https://www.amazon.com/gp/product/B095NMLM2F
  • asked a question related to Cryptography
Question
3 answers
I want to know the execution times of the following cryptographic primitives involved in ECC:
1. ECC point addition
2. ECC point multiplication
3. ECDSA signing time
4. ECDSA signature verification time
Can anyone please help me with this.
Relevant answer
Answer
1) It depends by your architecture and your CPU.
2) It depends by the elliptic curve that you are considering, i.e. secp160r1, secp192r1, ecc. (and the respective Koblitz version).
3) It depends if you are considering pre-computations or not.
4) It depends if you are estimating these costs in C or Python or another generic language. By the way, from my experience you should work in C to estimate how much time requires an ECC operation. As a standard library to make these experiments, I can suggest you OpenSSL.
5) The best option is to measure the time and the energy consumption by adopting an oscilloscope.
6) Further you need to repeat the tests (i.e. 10,000 times) and compute the mean + interval confidence at 95%.
7) An example here (Section VI A):
  • asked a question related to Cryptography
Question
13 answers
what is the new idea it can implemented security and cryptography for IoT ?
Relevant answer
Answer
@Thenmozi Sundaram, very good point on the energy consumption issue inherent to Blockchain processing.
This would be irrealistic to expect a "thin client" type of IoT node to replicate and update the list of transactions having occured until t, at every time t. This is however what a fully Distributed Ledger system would have to do.
Hence a massive downsampling is needed to implement such a Distributed Ledger Technology in IoT:
-time downsampling, restricting transaction list update to more spaced times...
-hierarchical downsampling whereby nodes would be aggregated, especially at the Edge, where sensors input real world measurement data, in IoT nodes cluster, and one update per cluster would replace one update per IoT node.
-then you need to address data protection within the clusters, when the different nodes aggregated in a cluster need to share or exchange data.
You may use block coding for the local cluster aspects of data.
The above sketches a possible path towards your goal.
Is it compatible with the problem you have in mind?
Let me know
  • asked a question related to Cryptography
Question
5 answers
Hii,
I'm doing MBA in cloud computing, please suggest me some topic to do thesis on cloud cryptography, If possible on aviation cloud implementation.
Relevant answer
Answer
Read about :quantum cryptography for access control in cloud computing
  • asked a question related to Cryptography
Question
5 answers
cryptography is a technique for securing the message through various ways such as cipher and algorithms so that Intruders or attackers don't steal or replicate our data.
Relevant answer
Answer
Choice is a plenty But any choice has to deal with attributes like time, efficiency and cost.
  • asked a question related to Cryptography
Question
9 answers
I'm looking to talk with people that match that description. Any suggestions or advice is greatly appreciated.
Relevant answer
Answer
I hope you feel very well. Yes I know a very good researcher:
Dr. Mohamed Mahmoud CHEMS-EDDIN
Good luck.
You can contact him for discussing your purpose.
  • asked a question related to Cryptography
Question
7 answers
Number theory is among cryptography foundations, but sometimes it is hard for students to understand the theory, mostly due the lack of previous skills and knowledge of that mathematical theory by students.
Have you dealt with that problem? Have you faced other problems while teaching number theory? How to overcome them?
Relevant answer
Answer
This is a good question! I was trying to figure that out a couple years ago.
The best approach I found was Coursera's course from USC San Diego - Intro to Discrete Math for CS Specialization with the 4th course being Number Theory and Crypto. The first two courses give enough grounding for those students that don't have enough of the correct mathematical background for Number Theory. I think they need something pretty accessible to not be overwhelmed. People often have such a love of crypto that they slog through with just a really basic and algorithm specific understanding of number theory - which really won't help them in the long run if they are going to do cryptanalysis etc. Dan Boneh's refresher on Probability is really short and helpful as well.
Please post here if you find a good solution.
  • asked a question related to Cryptography
Question
8 answers
the avalanche effect
Relevant answer
Answer
# Python program to measure avalanche effect for cryptographic algorithms
a = 546313 # first_cipher
b = 37385 # second_cipher after chanage one bit
# print bitwise XOR operation
a_xor_b = a ^ b
print("a ^ b =", a_xor_b)
# Base 2(binary)
bin_a_xor_b = bin(a_xor_b)
print("the result in decimal =", bin_a_xor_b)
# next steps to count 1s in binary number
one_count = 0
for i in bin_a_xor_b:
if i == "1":
one_count+=1
print ("the 1s numbers is=", one_count)
# next steps to calculate equation of avalanche effect
len_a = len(bin(a))
len_b = len(bin(b))
# if to ensure divide by the longest binary string
if (len_a) >= (len_b):
AVA = (one_count/ len (bin(a))) * 100
else:
AVA = (one_count/ len (bin(b))) * 100
print ("avalanche effect =", AVA, "%")
  • asked a question related to Cryptography
Question
5 answers
Visual cryptography scheme (VCS) used to encrypt the secret image in visual form by splitting it into k shares, then be transmitted securely via communication channels to n participants. When all the k shares stacked ,the original secret image is visible.
Although this scheme has important features, but suffers from major problems such as the codebook is very difficult to manage and design , generate meaningless share that is not carry any visual information, loss contrast and pixel expansion that results increase size and poor quality of recover image and suffers from cross interference problem .
In order to obtain better quality of the shares with carrying visual information, it is important to enlarge the area of visual cryptography (VC) through proposition scheme to create halftone share that carrying meaningful information to increase visual quality and security, this scheme called Halftone Visual Cryptography (HVC)
The main idea of (HVC) scheme is realization visual cryptography" via digital halftone technique depending on the Blue noise concept to generated k shares more pleasant to human eyes and more flexible shares management. Halftone Visual Cryptography (HVC) methods are still endure unsolved problems like the visual quality of shares , large pixel expansion, difficulty design codebook and cross interference in reconstruction secret image and construction share images.
Relevant answer
Answer
thanks a lot
  • asked a question related to Cryptography
Question
4 answers
I am new to Cryptography field and try to implement Threshold Implementation. In Decomposition of SBox into composition of two quadratic SBox. I am not getting how to split SBox input of 4bit into 12bit input of G1,G2,G3 respectively. And also how to form ANF(Algebraic Normal Form)equation to get G(x) and F(x).
I am attaching image of SBox decomposition also for reference.
Please can someone explain it .
Relevant answer
Answer
I don't agree with Mohammed Salem Atoum , in my opinion blockchain have nothing to do with this task.
Mahima Bhatnagar , I'm not quite sure what do you mean by Threshold Implementation (maybe due to our different native languages terminology or missed context) - providing more verbose specification would help me or other colleagues to answer the question more specifically.
As far as it seemed from figure the input of G1, G2, G3 is 8 bit (12 bit - whole device's block), but it still doesn't help though, because the rightmost part of the figure contradicts its center part. It is more likely that authors of the figure made a mistake or missed something while describing the center part (SBox decomposition).
Regarding ANF - the particular result should heavily depend on the particular SBox case. Try to build a Cayley's table for it or something similar and then build respective ANF. There are a lot of materials regarding ANF designing within discrete mathematics handbooks.
  • asked a question related to Cryptography
Question
4 answers
I am new to Cryptography field and try to implement Threshold Implementation. In Decomposition of SBox into composition of two quadratic SBox. I am not getting how to split SBox input of 4bit into 12bit input of G1,G2,G3 respectively. And also how to form ANF(Algebraic Normal Form)equation to get G(x) and F(x).
I am attaching image of SBox decomposition also for reference.
Please can someone explain it with a small example .
Relevant answer
Answer
use different polynomial equation for each parts
  • asked a question related to Cryptography
Question
1 answer
Hello fellow researchers;
I want to generate the AES cipher Sboxes, and I couldn't figure out how to do it; I know that we take 4X4 bytes state matrix, where each byte can be expressed as a polynomial ; and then we calculate the multiplicative inverse of that byte mod x^8+x^4+x^3+x+1; then we multiply it by the matrix A and XOR it with a constant c.
A = [1 0 0 0 1 1 1 1] and c = [0
[1 1 0 0 0 1 1 1] 1
[1 1 1 0 0 0 1 1] 1
[1 1 1 1 0 0 0 1] 0
[1 1 1 1 1 0 0 0] 0
[0 1 1 1 1 1 0 0] 0
[0 0 1 1 1 1 1 0] 1
[0 0 0 1 1 1 1 1] 1]
And as I understand the multiplicative inverse of 1 is 1 and for 0 is not defined; so what would a byte turn into? for example x = 00011001, what is b such that x . b mod x^8+x^4+x^3+x+1 =1 ?
Relevant answer
Answer
hello
you can see me in the next september, and i can give you a book where a good explanation has been done about what do you looking for.
  • asked a question related to Cryptography
Question
3 answers
Dear colleagues
I want to ask, where can I obtain the original versions of classic photos that are traditionally used for image encryption?
Examples include the Lenna figure, vegetables, baboon, cameraman, rice, etc.
Is there any source to get all such images, and maybe try out new ones, that aren't bound by any copyright.
Apart from the above, I want to see if there are any copyright free images of other types, like fingerprints, x-ray images, satelite images, that can be used as examples in image encryption papers.
Relevant answer
Answer
Dear Dr Lazaros,
You many many such standard & benchmark image dataset at
Regards,
Musheer
  • asked a question related to Cryptography
Question
2 answers
WHAT IS A MDS MATRIX (MDS in AES finalists) and how can we achieve diffusion through it?
Relevant answer
Answer
The term MDS originates from coding theory, codes for which the Singleton bound is met are called MDS (maximal distance separable) codes. A matrix is MDS if all its square sub-matrices are nonsingular. Though its characterization is also given by branch number (see https://tosc.iacr.org/index.php/ToSC/article/view/8364/7713). MDS matrices are matrices with a property that even a small change in input costs a maximum change in its output results. Through this property, we can achieve maximum diffusion. For more details, see the above-refered paper.
  • asked a question related to Cryptography
Question
3 answers
In my master's Degree I proposed a way to extend the existing privacy enhancing technologies used in Instant messaging in order for the users to be able to publish user-driven services:
This MSc Thesis I want to continue it over into a PhD as a step to implement it. From my point of view it requires lots of research that may also have scientific value as well.
The research I am interested to do it via a MEXT Scholarchip in Japan. But so far what I found only few researchers that either are qualified in cryptography or in cyber security:
But still I have hard time to look over univercities that do a complete research in Privacy Enhancing technologies or in Cybersecurity in Japan. Therefore, I want to ask:
- Which Universities in Japan do research in a related field (Cryptography, Cyber security, Internet Privacy) and which ones would you reccomend and why?
- Should I keep looking for professors-only and create a database with contact info or it is reccomend to look for univercities as well?
Relevant answer
Answer
The Japan government is keen to attract more international students, and has set a target of having 300,000 foreign students in the country by 2020 (it reached the 100,000 mark in 2003). As a result, universities are focusing on making life easier for foreign students, from the application process all the way through to finding a job after graduation.
  • asked a question related to Cryptography
Question
3 answers
Hash Question (Use Sage): The following describes the simple hash function: Choose p, q primes and compute N = pq. Choose g relatively prime to N and less than N. Then a number n is hashed as follows: H = gn mod N If there is an m that hashes to the same value as n, then gm ≡ gn mod N so gm-n ≡ 1 mod N which implies that m –n ≡ 0 mod φ (N) So breaking this amounts to finding a multiple of φ (N), which is the hard problem in RSA. Write a function that takes a bit length n and generates a modulus N of bitlength n and g less than N and relatively prime to it. Show the output of your function from part (a) for a few outputs. Using N, g, n as arguments write a function to perform the hashing. For parts (d)-(f) compute the simple hash: N = 600107, g = 154835, n = 239715 N = 548155966307, g = 189830397891, n = 44344313866 N = 604766153, g = 12075635, n = 443096843 Write a function that creates a collision given p and q. Show that your function works for a couple of examples.
Relevant answer
Nice Habakuk Kibagendi.
  • asked a question related to Cryptography
Question
8 answers
I have to calculate the NPCR and UACI of the binary image. How it will be different from grayscale images.
  • asked a question related to Cryptography
Question
6 answers
I want a hardware which support MATLAB code code for my data hiding algorithm . Kindly suggest me the hardware board which support MATLAB code.
Relevant answer
Answer
Dear all
I need a base paper to implement my algorithm in hardware. if anyone working in this area kindly share those details
  • asked a question related to Cryptography
Question
10 answers
I am looking for mathematical methods or techniques discussed on solving number triangles such as simple case pascal triangle. For example, one finds sequence of numbers that form a pascal triangle pattern. The formula to generate those numbers are hypothetically unknown. Is there a method in mathematics to derive the formula that will generate those numbers. (example, methods in cryptography )
Relevant answer
Answer
Thanks Ait Mansour El Houssain.
  • asked a question related to Cryptography
Question
5 answers
I am doing research on comparative analysis of ID based cryptographic protocols like ElGamal, RSA, DSA etc. How can compare these protocols with the properties without doing any objective experiment?
Relevant answer
Answer
You need to choose the properties for comparing. It could be size of the keys, or size of additional data, computational and memory complexity, complexity for cryptanalysis (with different attack model), mathematical problems in the base of protocols, application of protocols in different standards.
  • asked a question related to Cryptography
Question
2 answers
I have introduced some factorization for the infinite Hilbert Operator based on the Cesaro, generalized Cesaro and Gamma matrices in the following papers:
1-H. Roopaei, Factorization of Cesàro and Hilbert matrices based on generalized Cesàro
matrix, Linear Multilinear Algebra, 68 (1) (2020), 193-204.
2-H. Roopaei, Factorization of the Hilbert matrix based on Cesàro and Gamma matrices,
Results Math., 75 (1) 3, 2020. DOI: 10.1007/s00025-019-1129-1.
Now, my questions are:
1-Is there any other factorization for the Hilbert matrix based on the Hausdorff operators? and in especial case of Hausdorff classes, based on Euler or Holder operators?
2- As I know the infinite Hilbert operator is used in Cryptography and Image processing. Is there any mathematicians in this group who can introduce some good references?
Relevant answer
Answer
Dear Reza
The reference that you sent me is my own publication.
Best regards
  • asked a question related to Cryptography
Question
5 answers
I want to know why is it that XOR is ignored in the computation cost of a security protocol? And is there any reference there which can prove that it is insignificant so can be ignored?
Like in a certain research paper it is stated that "In the proposed scheme, we take the
cost of concatenation (||) operations and XOR (⊕) evaluated as insignificant." why is this?
Relevant answer
Answer
based on complexities measurements (Big- O , Theta and Omega), Bit-wise Primitive operators (such as XOR) has lower time complexity compared to +, - , *, /
for example (reference):
Complexities of primitive operators (logical and math) using different processors compared in :
bit- wise operators such as XOR got minimum complexity time.
Thus, if XOR is ignored (as refereed in the question context), it means XOR considered as O(1) or constant ( relative to other higher computation primitive operators, typically used in encryption and decryption as necessary .
  • asked a question related to Cryptography
Question
4 answers
I would like to use bilinear pair concept for designing a secure data.
Relevant answer
Answer
e(u,v)=2power(u*v)
from this we can prove G1xG1-->G2
  • asked a question related to Cryptography
Question
4 answers
I wanted to know if it is possible to generate random numbers using GAN and what mathematical background is necessary.
Relevant answer
Answer
If a GAN can accept Non-Parallel data then it has the ability to generate random numbers.
1. They may have a sequence in past to predict new numbers. OR
2. Just a random sequence .
I worked with non parallel voice data using GAN and it worked, then this has also the ability to work for random numbers as well. But this method may not be the best choice as there are other models SVM,LSTM(for exmple). But your question is "whether we can ?" Then you can give it a try.
  • asked a question related to Cryptography
Question
9 answers
I developed a new cryptographic algorithm (block cipher) based on RADG and using chaos (tent Map) with key of 256 bit, the design of the RADG is no more fixed as it was, the design totally depends on the chaos seed X and TM parameter μ , which is vary .
I built the cipher/Decipher code and it works perfectly .
what standard test/validation programs should I use to prove validity ?
Relevant answer
Answer
1. Key Analysis (Key Space Analysis, Key Sensitivity Test)
2. Statistical Analysis (Correlation Coefficients Analysis, Correlation Distribution(Similarity) of The Adjacent Pixels , Histograms Analysis)
3. Differential Analysis
4. Information Entropy
5. other test like the Histogram Deviation, The Irregular Deviation, Encryption Quality Metric, The Avalanche Effect Metric)
  • asked a question related to Cryptography
Question
6 answers
Why is there not detailed material on this subject? Anybody, to begin with, can take initiative.
Relevant answer
Answer
The term „Whitebox Cryptography“ is probably a marketing invention and a contradiction in itself. The Greek source of the term crypto refers to “secret/hidden” which is not really the case in what is called “Whitebox Cryptography”. The term “Whitebox” refers to the fact that nothing is really hidden. I would prefer this technique to be called obfuscation instead of using the term “crypto”. Modern Cryptography is based on secrets called keys and algorithms using said keys to transform plaintext into a message unreadable without access (not knowledge) to said key material. Given the key material is kept secret and only authorized access is granted mathematical methods can be applied to prove the strength of function. The technique some call “Whitebox Cryptography” cannot be mathematically assessed since all details needed to transform a message back to plain text is contained in the transmitted message. The technique relies on proprietary mechanisms for both directions of the transformation which an attacker can also reverse engineer from one or multiple transmitted message(s) (with more or less efforts). The major difference between Cryptography and obfuscation is that given proper access control to secret key material cryptography can be secured against external AND internal attackers while the mechanisms of obfuscation are always known by multiple individuals. Still obfuscation is helpful since it uses up external attacker’s time for attack preparation. It is used when a message is to be sent to a party while it was not possible to yet share secrets.
  • asked a question related to Cryptography
Question
7 answers
I’m doing a project on ”Applying graph theory on symmetric cryptography”. As a part of it, I’ve been given an algorithm to calculate the time complexity using Big O notation. I have got an answer of O(l(n^2)). Note that here n ≤ l.
But the answer should be O(l^3).
Can I argue that O(l(n^2)) ≤ O(l(l^2)) = O(l^3)?
Relevant answer
Answer
If L =O(n) which is the case that there are only constant number of blocks and for example L=n/3 and there are 3 blocks exactly. Then n *L^2 =O(n^3)
L cannot exceed n (when there is only one block) and can be even smaller (which is exactly the definition of O(n)).
Advice:
It will help to learn analysis of algorithms and understand asymptotic analysis of algorithms' complexity to do this things right!!
  • asked a question related to Cryptography
Question
2 answers
Bijection Functions used for Internal Encoding in Look Up Tables in White-Box Cryptography, but it suffers from few attacks, so to avoiding these attacks can we replace it by any other functions or optimization algorithm?
Relevant answer
Answer
Thanks Sir
  • asked a question related to Cryptography
Question
9 answers
For Security Purpose in Smart Devices we generally used Symmetric Key Cryptography (DES, AES) for its lightweight, but for increasing security can we think about public key Cryptography too?
Relevant answer
Answer
as u know the IoT devices have some constraints in power, processing data, memory, so because of these constraints i don't propose using RSA. you can use the lightweight version encryption than RSA like ECC or DTLS. ECC is an approach to public-key cryptography based on the algebraic structure of elliptic curves over finite fields.