Science topic
Cryptography - Science topic
A topic for the discussion of research into Cryptography and Cryptanalysis.
Questions related to Cryptography
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.
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:
- What are the potential pitfalls in integrating ZKP with large-scale sustainability applications?
- How might regulatory frameworks evolve to address these new privacy-preserving methods in sustainability reporting?
- Are there use cases where ZKPs may not be the best solution?
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!
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?
会议征稿：第四届人工智能、机器人和通信国际会议（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
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
Please suggest basic literature on lattice-based cryptography. A kind response from the cryptographic community will be highly appreciated.
in H1 list w refer to word and h refer to hash of w and c refer to random coin but what about "a"?
Currently working on e-voting using cryptographic Techniques. I Would like to implement RSA and also to know how SHA works technically with RSA.
会议征稿：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
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.
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.
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
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)
#----------------------------------------------------
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.
Please guide me on how can I find a topic for my thesis and where to start work.
I need to understand what & how to choose sampling techniques I should pick to explore cryptography issues in cyber security domain.
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.
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
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?
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?
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?
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
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??
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
The article is here: https://www.researchgate.net/publication/360059185_Gasaq_Provably_Secure_Key_Derivation/
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.
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..
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.
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?
May you please name some good books on Blockchain technology?
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?
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?
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.
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!
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
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
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
NIST randomness test is very important for any encryption algorithm. I want Matlab code for NIST test.
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.
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.
what is the new idea it can implemented security and cryptography for IoT ?
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.
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.
I'm looking to talk with people that match that description. Any suggestions or advice is greatly appreciated.
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?
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.
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 .
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 .
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 ?
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.
WHAT IS A MDS MATRIX (MDS in AES finalists) and how can we achieve diffusion through it?
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?
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.
I have to calculate the NPCR and UACI of the binary image. How it will be different from grayscale images.
I want a hardware which support MATLAB code code for my data hiding algorithm . Kindly suggest me the hardware board which support MATLAB code.
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 )
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?
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?
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?
I would like to use bilinear pair concept for designing a secure data.
I wanted to know if it is possible to generate random numbers using GAN and what mathematical background is necessary.
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 ?
Why is there not detailed material on this subject? Anybody, to begin with, can take initiative.
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)?
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?
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?
