Java Generate Key From String
Next, VerSig needs to import the encoded public key bytes from the file specified as the first command line argument and to convert them to a PublicKey.A PublicKey is needed because that is what the Signature initVerify method requires in order to initialize the Signature object for verification. First, read in the encoded public key bytes. Stream generate method in Java with examples; Which Java libraries are useful for competitive programming? Extract all integers from the given string in Java; Integer.MAXVALUE and Integer.MINVALUE in Java with Examples; HashMap getOrDefault(key, defaultValue) method in Java with Examples; How to calculate log base 2 of an Integer in Java? Generate SAS token.; 3 minutes to read +1; In this article. This section shows how to programmatically generate a SAS token for using the Event Hubs REST APIs. Aug 08, 2017 A simple primary key consists of a single Java field which maps to a single table column. String generator default '; This annotation defines the types of primary key generation strategies. If this annotation is not used then application is responsible to populate and manage @Id field values itself. Dec 29, 2019 Learn several methods for generating secure random passwords in Java. With RandomStringGenerator, we can generate Unicode strings containing the specified number of code points. Now, we'll create an instance of the generator by using the RandomStringGenerator.Builder class. Of course, we can also further manipulate the properties. Creating a Unique ID from a String. Bharadwaj Adepu. Ranch Hand Posts: 99. Posted 10 years ago. In Java, how can a create a Unique ID from a particular string? I have gone through the UUID class but could not find anything, also googled this but.
how can i create this key from the string.
Please help ! !
I presume you can't implement the Comparable interface? Can you create a Comparator?
If you put Strings as Keys in a Map, I didn't think there was any limit to its length.
Have I misunderstood your question?
There is no free lunch here. You can shorten a string, but you will lose data, and hence, accuracy in comparison. Generally, shortening a string is useful, if you only care to detect if two strings are *not* equal. The easiest way is to use the hashcode, since if two strings are not equal, then their hashcodes are not equal either. Another way is to use a message digest, such as MD5 or SHA1, but again, like with hashcode, it is possible for two unequal strings to have the same digest.
Henry
Ssh generate public key 4096. Books: Java Threads, 3rd Edition, Jini in a Nutshell, and Java Gems (contributor)
inside my main object there are lot of sub objects. this main object is not just a string. so I create a unique string using the data inside this main object. this key would be length of 100 charactors.sometimes more than that. it depend on the data inside the main object.
And i have around 250 main objects to compare each other. so still you propose to keep the string key as the Map key?
I thought to use MD5 and create a hashcode.
also can two unequal objects have same hashcode if i use MD5?
Imesh
can two unequal objects have same hashcode if i use MD5?
No free lunch. Yes, they can.
However, MD5 tries its best to have two objects that are very similar to have different digests. Meaning, if two strings are off by only one or two characters, then it is highly unlikely that the two digests are the same. On the other hand, if two strings are completely different, then it has a better chance that the digests are the same.
Henry
Books: Java Threads, 3rd Edition, Jini in a Nutshell, and Java Gems (contributor)
Imesh Damith wrote:also can two unequal objects have same hashcode if i use MD5?
Yes they can, as Henry already said. Hash codes, in whatever form, are not going to help you here. It's theoretically impossible to make it so that two unequal objects always have different hash codes - if that would be possible, you'd have invented an incredible compression algorithm that violates the laws of information theory.
It's easy to see why this is theoretically impossible. Suppose you have a block of data containing N bits. Then there are 2^N possible ways you could fill this block of data. Now, you're going to calculate an M-bit hash code over the block of data (where M < N). So there are 2^M possible hash codes. Since M < N, 2^M < 2^N, so there are less possible hash codes than blocks of data. This means that there must be different blocks of data that have the same hash code.
Thanks for the explenation, so is there anyway that i can solve my problem? do i have to keep lengthy string itself as the key in the map?
Thanks
Imesh
In my answer above I said that hash codes are not going to help you. That's maybe not entirely true - you can use hash codes to make comparisons faster. That's how collections such as HashSet and HashMap in the standard Java API work. But you will still need a way to compare the complete content of objects.
To compare two objects, you could do this:
1. Check if the hash codes of the two objects are different. If they are, then you're done; the two objects are different.
2. If the hash codes are equal, then you need to compare the full content of the two objects to determine if they are equal or not.
If you do it that way, then you only need to do a full comparison if the hash codes of the two objects are equal.
I don't know how performance critical your code is, but on a normal computer strings of 100 characters and 250 objects that you need to compare can be done in a small fraction of a second. Don't waste too much time on performance optimization if you don't know that there's a performance problem.
java StringHashDemo Campbell
text length: 10000008, starts like this: Campbell멓㕑Campbellꀺ剂CampbellꚲCampbell㡗罴Campbell噠떻Campbell꾌뷭Campbell꾱Campbell竵컗Campbell읥?Campbell雦Campbell⛅䕴Campbell䞈躧CampbellCampbell炂滕Campbell䕘鷎Campbell푽쩊Campbell줕쬃Campbell苀횂CampbellꞲඐCampbell葻촻Campbell–纇Campbell佺Campbell諚嗝Campbell㺭Campbell폖썉Campbell퀿훂Campbell毆饐Campbell暼∙Campbell㩇뤃Campbell齋킎Campbellწ矒Campbell嶔Campbell?婴Campbell㹇끋CampbellᤘࢫCampbell怚捳Campbell偑栛Campbell䦡ᕟCampbell⎀焰Campbellེ倏Campbell睚כCampbell봰癚CampbellCampbell愧驉Campbell羗偎Campbell墘矸Campbell뼛靼Campbell욌Campbell熇놂Campbell旱Campbell풰Campbell涼నCampbellㅰ砬Campbell욪뒂Campbell轗ݣCampbell㦸벱CampbellⲖ㊣Campbell檫ȐCampbell剟ęCampbell䅲炘Campbell▪࿎Campbell閹쮪Campbell㵢䨮Campbell鄱箧Campbell풁㺫Campbell霟崜Campbell薨CampbellЩ㏩Campbell䴅ᢙCampbell힉∊Campbell鱧Campbell?Campbell慰⸣Campbell愲?Campbell뢑뻆Campbell浓Campbell玶Campbell䙁惢Campbell퉿燀Campbell໐?Campbell橂阛Campbell襰Campbell纫?Campbell빬㪚Campbell믥↻Campbell泯⊒Campbell≐箞Campbellꇤ㊦Campbell윋긙Campbell䮇Campbell㇘霡Campbell安螪CampbellCampbell态莫Campbell࣑Campbell孵멒Campbellΐ认Campbellệ쏦Campbellड़Campbellௌ
. . . and the hashcode for that object follows, taking 50497.219 μs to work out . . . d10dfa69
Java Generate Private Key From String
It varies between 51 and 68 milliseconds. For 10 million characters. Is that really too slow for you?Imesh
The Java KeyGenerator class (javax.crypto.KeyGenerator) is used to generate symmetric encryption keys. A symmetric encryption key is a key that is used for both encryption and decryption of data, by a symmetric encryption algorithm. In this Java KeyGenerator tutorial I will show you how to generate symmetric encryption keys.
Creating a KeyGenerator Instance
Before you can use the Java KeyGenerator class you must create a KeyGenerator instance. You create a KeyGenerator instance by calling the static method getInstance() passing as parameter the name of the encryption algorithm to create a key for. Here is an example of creating a Java KeyGenerator instance:
This example creates a KeyGenerator instance which can generate keys for the AES encryption algorithm.
Initializing the KeyGenerator
After creating the KeyGenerator instance you must initialize it. Initializing a KeyGenerator instance is done by calling its init() method. Here is an example of initializing a KeyGenerator instance:
The KeyGeneratorinit() method takes two parameters: The bit size of the keys to generate, and a SecureRandom that is used during key generation.
Generating a Key
Once the Java KeyGenerator instance is initialized you can use it to generate keys. Generating a key is done by calling the KeyGeneratorgenerateKey() method. Here is an example of generating a symmetric key: