Cryptography - Science topic

Look into DAOs or decentralized autonomous organizations

see also https://stanford-jblp.pubpub.org/pub/blockchain-corporate-governance/release/1

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.

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.

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 2⁵⁰-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.

after reading an article baesd on quantum image encryption I think these two chaotic sequences are used for a key generation, not for encryption.

hi,

kindly refer this link:

Best wishes...

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..

It does not stop side channel attack. In contrast, one of the problems of PUF is the side channel attack itself.

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

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.

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.

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.

RSA

Dear Seddiq Abd Al-Rahman

I will be interested in that.

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

You may get some ideas here. Just apply the same for your chaotic map.

I have tested the image using different test suites in the following paper. (Not only NIST)

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

Next, you may check the answer given by Dana A. Jacobsen in this post:

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):

@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

Read about :quantum cryptography for access control in cloud computing

Dear Horst Treiblmaier,

Thank you very much for your answer and confirmation of my theses. Thank you very much for your valuable participation in our discussion. Yes, I agree with you on this point that improving risk management processes is a key issue and that the decentralized finance (DeFi) sector will continue to grow in the future.

Best regards,

Dariusz Prokopowicz

Choice is a plenty But any choice has to deal with attributes like time, efficiency and cost.

I hope you feel very well. Yes I know a very good researcher:

Dr. Mohamed Mahmoud CHEMS-EDDIN

2m.chemseddin@gmail.com

Good luck.

You can contact him for discussing your purpose.

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.

# 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, "%")

thanks a lot

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.

use different polynomial equation for each parts

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.

Dear Dr Lazaros,

You many many such standard & benchmark image dataset at

Regards,

Musheer

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.

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.

Nice Habakuk Kibagendi.

Hello Sanjay Kumar

Hope this may help you:

Regards

Dear all

I need a base paper to implement my algorithm in hardware. if anyone working in this area kindly share those details

Thanks Ait Mansour El Houssain.

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.

Dear Reza

The reference that you sent me is my own publication.

Best regards

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 :

https://gmplib.org/~tege/x86-timing.pdf

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 .

e(u,v)=2power(u*v)

from this we can prove G1xG1-->G2

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.

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)

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.

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!!

Thanks Sir

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.

Peter Breuer Thank you Dr. Peter for your answer. May you please let us know how may we replace the integer x with a string message?

Dear Bello A. Buhari

Both RSA Cryptosystem and Elgamal Cryptosystem are secure enough to use.

Actually, if we looking for the best one, we need to determine the application space.

Sincerely,

Dear Matias Morsa

It's interesting question, I will tray answer asap.

Kind regards,

Milica Slijepcevic

Dear Dariusz,

Thank you very much for pointing out the issues of the security breaches, looking at the database as the storage aspect. What do you think could be the best mechanism to protect the biometric data in the database server.

Any link to the papers and the books is welcomed

Kind regards

Bio-hashing and cancellable biometric approach can help in some extend

Hi Dr. Anik Islam Abhi

Try with the following, they could help you.

http://ijns.jalaxy.com.tw/contents/ijns-v15-n4/ijns-2013-v15-n4-p256-264.pdf

https://crypto.stackexchange.com/questions/1025/can-one-generalize-the-diffie-hellman-key-exchange-to-three-or-more-parties

Sincerely

Amina, I recommend using a good textbook which comes with lecture slides and labs with instructor's manuals. For cryptography, "Cryptography and Network Security" by Stallings 7th edition is pretty good! It is from 2017, so should have all the latest updates included

Yes download ns-allinone and add any new module with C code for any of the well known cryptography algorithms.. Refer https://www.nsnam.org/docs/manual/html/new-modules.html

Hi Pantuvo Tsoke

"enhanced elliptic curve scalar multiplication"

Hi,

visual cryptography, pixel expansion and contrast are two ... contrast of the recovered binary secret images is only a half of the original secret . In Visual cryptography mainly visual information is encrypted .it takes a secret image as input, and outputs share images that shares are having visual.

Kindly Refer the link:

https://link.springer.com/10.1007/978-3-642-27733-7_9077-2

Best Wishes..

Hi.,Try to use in MANET environments ... with the help of protocol stack and NS mobile node in NS2 simulation. NS2 help in commands and getting output from simulation after running tcl file.

Ref: https://ns2blogger.blogspot.com/p/to-implement-new-protocol.html

Ms Preeti,

the data set for ECG cryptography can be obtained from Bonn university site at the below link

http://epileptologie-

bonn.de/cms/front_content.php?idcat=193&lang=3&changelang=3

you can also employ discrete chaos for realization of new ecg cryptographic method.

Dear Timos Mukoko,

to answer this question illustratively, I would like to refer to some figures in the following literature sources:

[1] Anatol Badach: TLS – Transport Layer Security

See here in particular the figures: 4132 (TLS Importance), 4134 (TLS Handshake) und 4140 (Structure of Shiper Suites)

[2] Dr. Erwin Hoffmann: Was ist neu bei TLS 1.3? TSLv1.3 – 21nd Century Internet Transmission Security

See especially the pages: 3, 4, 8, 11 und 16

By using asymmetric cryptographic algorithm RSA and SHA (Secure Hash Algorithm), connection-oriented communication can be secured over TCP connections - especially communication in distributed web applications with HTTP.

In order to be able to secure communication over TCP connections, for example in distributed web applications and the use of HTTP, TLS was developed. Among other things, the security protocol TLS regulates the way in which RSA and SHA are used.

As shown in Fig. 4134 in [1], according to TLS, the two communicating partners - the TLS client and the TLS server - agree on the principles by which they secure the communication. These principles are specified in the form of a cipher suite. Each cipher suite has the structure shown in Fig. 4140.

Each cipher suite consists of the following three parts:

When using RSA, for Key Exchange (only „key material“ exchange!) and Authentication, and SHA (for Data Integrity Checking), the cipher suites can take the form:

TLS_RSA_WITH_3DES_EDE_CBC_SHA

The "good" cipher suites are registered with the IANA. Their listing can be found at the web address

http://www.iana.org/assignments/tls-parameters/tls-parameters

Best regards and much success

Anatol Badach

Dear Anuj, the point raised by you is really timely. From your points, it is understood that traditional methods will not help much. However, I would like to say QAM may be an option along with orbital angular momentum multiplexing. Just have a look at the articles attached.

a) https://www.osapublishing.org/oe/viewmedia.cfm?uri=oe-26-2-2099&seq=0

b)

Dear Korakot Boonyaphon,

The difference between true random number generators(TRNGs) and pseudo-random number generators(PRNGs) is that TRNGs use an unpredictable physical means to generate numbers (like atmospheric noise), and PRNGs use mathematical algorithms (completely computer-generated).

Pseudo-RNG's are sets of algorithms (i.e. logical instructions for by a computer program) that utilize mathematical formulas to produce a certain sequence of numbers that will appear random, or at least will have the effect of randomness. Other RNG's use pre-calculated tables instead of mathematical formulas, but either way table or formula, the objective is still the same.

A lot of research has been done (and is still ongoing) on RNG's insomuch that our modern algorithms used for Pseudo-RNG's produce number sequences that do exactly mimic truly random sequences. But that may be the outcome of today's research there is still room for improvement since the results of Pseudo-RNG's are really "pseudo".

Comparing the results of a Pseudo-RNG with that from a True-RNG will prove useful. If you list down the results of a Pseudo-RNG mimicking dice rolls the numbers will really appear as if they are random. But statistical analysis will prove that the numbers produced by a Pseudo-RNG is not really random but is rather predetermined. Thus its results can be measured and standardized, and, we can say, controlled.

True-RNG's behave differently since the results are truly random and unpredictable. If we try to get a computer to produce a really random sequence of numbers then the computer must base its numbers on a naturally occurring physical phenomenon, which may include the radioactive decay of isotopes, static in the airwaves, and the waves of the sea. True-RNG's will not really be cost-efficient if you compare it to Pseudo-RNG's. True-RNG's will be subject to wear and tear since all things natural will really be subject to entropy. A Pseudo-RNG will not be subject to such physical phenomena.

Another efficiency of a Pseudo-RNG is that you can reproduce the same sequence of numbers in another time by simply knowing the starting point of the sequence (thus it is also periodic and the sequence will repeat itself in due time). This better facilitates inspections done by casino control boards. But you can be sure that the sequence of numbers produced by a Pseudo-RNG, though periodic, the time to reproduce the same sequence will eventually take a really long time that unless you acquire the actual algorithms, the correct sequence will be very difficult (almost impossible) to crack.

Many online casinos have settled for Pseudo-RNG's for its cost-efficiency, periodicity, and efficiency. These are good reasons to choose this type of random number generator, though a True-RNG will also have its own benefits as well.

I hope I have answered your question.

With Best Wishes,

Samir G. Pandya

You can read the literature yourself and come up with your own conclusions. It would do you good, you would sound less like a non-expert rambling about something you have very little clue about. I am done here.

In addition to what Peter presents, my answer to the original question might be, "it depends." The best cipher today is generally accepted to be AES, by NIST anyway. A block cipher, which can also be used in "counter mode," to encrypt and decrypt continuous streams of data. Could be text or anything else.

The computationally somewhat more efficient ciphers may be symmetric key stream ciphers. Functionally, they work much like AES when used in counter mode, but depend only on good quality pseudo-random number generators (PRNG). You need a PRNG with seeds that consist of many bits, like 128-bit seeds or better, to achieve good results.

Not sure if this link still works, because the partial government shutdown won't let me use it at the moment, to see what updates may have been introduced lately:

Quoting from that link, while it was working:

Currently, the use of AES in the Output Feedback Mode (OFB) mode and the counter (CTR) mode are approved by NIST as block-cipher based stream ciphers. However, dedicated stream ciphers sometimes have performance advantages, especially for software applications with high throughput requirements, or for hardware applications with constrained resources (such as limited storage, gate count or power consumption). During FY2013, the performance of some of the well-understood stream ciphers (focusing on the eSTREAM finalists) will be studied and compared to the approved block-cipher based stream ciphers. A technical report is being finalized, and is expected to be published soon.

Thank you very much

Many implementations can be found here!

https://gist.github.com/artjomb/f2d720010506569d3a39

It is very important to maintain a high level of cyber security also in the area of computerized health and social care institutions.

Unfortunately, despite the assurances of companies that run social media portals, the information contained on these websites is not always fully secured against the activities of cybercriminals.

In addition, the issue of downloading data from social media portals by large companies to Big Data database systems should be added in order to process them for marketing purposes.

The issue of privacy in social media is very important and is related to the security of personal information. Privacy is at risk in terms of information posted on social media portals.

I invite you to the discussion

There is no way to leak IP or HDL as those are physical or logical representations, they are not data present in the circuit. Imaging/delayering techniques are more adequate for IP theft.